./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_spec4_product28.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d 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_spec4_product28.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 619b5b07f7bee6d460265c38ff6f46d0f3c88b87f6fc28a24021d9529c74e42f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:31:12,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:31:12,105 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:31:12,109 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:31:12,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:31:12,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:31:12,135 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:31:12,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:31:12,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:31:12,137 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:31:12,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:31:12,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:31:12,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:31:12,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:31:12,139 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:31:12,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:31:12,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:31:12,140 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:31:12,140 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:31:12,140 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:31:12,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:31:12,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:31:12,146 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:31:12,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:31:12,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:31:12,146 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:31:12,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:31:12,147 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:31:12,147 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:31:12,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:31:12,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:31:12,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:31:12,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:31:12,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:31:12,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:31:12,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:31:12,148 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:31:12,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:31:12,148 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:31:12,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:31:12,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:31:12,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:31:12,150 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 -> 619b5b07f7bee6d460265c38ff6f46d0f3c88b87f6fc28a24021d9529c74e42f [2024-10-12 19:31:12,353 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:31:12,373 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:31:12,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:31:12,375 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:31:12,376 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:31:12,377 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product28.cil.c [2024-10-12 19:31:13,518 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:31:13,735 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:31:13,736 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product28.cil.c [2024-10-12 19:31:13,754 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b5e2cab2/f24ead2075784473a5ee6b823ea1ca10/FLAG90320a4c7 [2024-10-12 19:31:13,764 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b5e2cab2/f24ead2075784473a5ee6b823ea1ca10 [2024-10-12 19:31:13,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:31:13,767 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:31:13,769 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:31:13,769 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:31:13,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:31:13,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:31:13" (1/1) ... [2024-10-12 19:31:13,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f703e1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:31:13, skipping insertion in model container [2024-10-12 19:31:13,774 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:31:13" (1/1) ... [2024-10-12 19:31:13,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:31:14,026 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_spec4_product28.cil.c[8467,8480] [2024-10-12 19:31:14,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:31:14,176 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:31:14,185 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2024-10-12 19:31:14,186 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [97] [2024-10-12 19:31:14,186 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [445] [2024-10-12 19:31:14,186 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [454] [2024-10-12 19:31:14,186 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [471] [2024-10-12 19:31:14,186 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [871] [2024-10-12 19:31:14,187 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1092] [2024-10-12 19:31:14,187 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2167] [2024-10-12 19:31:14,187 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2303] [2024-10-12 19:31:14,187 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [2568] [2024-10-12 19:31:14,188 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2595] [2024-10-12 19:31:14,199 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_spec4_product28.cil.c[8467,8480] [2024-10-12 19:31:14,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:31:14,266 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:31:14,266 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:31:14 WrapperNode [2024-10-12 19:31:14,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:31:14,267 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:31:14,267 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:31:14,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:31:14,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:31:14" (1/1) ... [2024-10-12 19:31:14,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:31:14" (1/1) ... [2024-10-12 19:31:14,356 INFO L138 Inliner]: procedures = 128, calls = 196, calls flagged for inlining = 55, calls inlined = 45, statements flattened = 859 [2024-10-12 19:31:14,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:31:14,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:31:14,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:31:14,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:31:14,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:31:14" (1/1) ... [2024-10-12 19:31:14,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:31:14" (1/1) ... [2024-10-12 19:31:14,370 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:31:14" (1/1) ... [2024-10-12 19:31:14,391 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-12 19:31:14,391 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:31:14" (1/1) ... [2024-10-12 19:31:14,392 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:31:14" (1/1) ... [2024-10-12 19:31:14,409 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:31:14" (1/1) ... [2024-10-12 19:31:14,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:31:14" (1/1) ... [2024-10-12 19:31:14,422 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:31:14" (1/1) ... [2024-10-12 19:31:14,425 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:31:14" (1/1) ... [2024-10-12 19:31:14,430 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:31:14,430 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:31:14,430 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:31:14,430 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:31:14,431 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:31:14" (1/1) ... [2024-10-12 19:31:14,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:31:14,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:31:14,456 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-12 19:31:14,458 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-12 19:31:14,491 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-10-12 19:31:14,491 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-10-12 19:31:14,491 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-10-12 19:31:14,491 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-10-12 19:31:14,491 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-10-12 19:31:14,491 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-10-12 19:31:14,492 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-12 19:31:14,492 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-12 19:31:14,492 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-12 19:31:14,493 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-12 19:31:14,493 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-12 19:31:14,493 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-12 19:31:14,493 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-12 19:31:14,493 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-12 19:31:14,493 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-10-12 19:31:14,493 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-10-12 19:31:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-12 19:31:14,494 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-12 19:31:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-12 19:31:14,494 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-12 19:31:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-12 19:31:14,494 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-12 19:31:14,494 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-12 19:31:14,494 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-12 19:31:14,495 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:31:14,495 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-12 19:31:14,495 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-12 19:31:14,495 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-12 19:31:14,495 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-12 19:31:14,495 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-12 19:31:14,495 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-12 19:31:14,496 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-12 19:31:14,496 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-12 19:31:14,496 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-12 19:31:14,496 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-12 19:31:14,496 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-12 19:31:14,496 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-12 19:31:14,496 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-12 19:31:14,496 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-12 19:31:14,496 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-10-12 19:31:14,496 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-10-12 19:31:14,496 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-12 19:31:14,496 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-12 19:31:14,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:31:14,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 19:31:14,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 19:31:14,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 19:31:14,496 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-12 19:31:14,497 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-12 19:31:14,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:31:14,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:31:14,623 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:31:14,625 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:31:15,221 INFO L? ?]: Removed 399 outVars from TransFormulas that were not future-live. [2024-10-12 19:31:15,222 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:31:15,276 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:31:15,277 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 19:31:15,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:31:15 BoogieIcfgContainer [2024-10-12 19:31:15,277 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:31:15,279 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:31:15,279 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:31:15,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:31:15,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:31:13" (1/3) ... [2024-10-12 19:31:15,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8118f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:31:15, skipping insertion in model container [2024-10-12 19:31:15,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:31:14" (2/3) ... [2024-10-12 19:31:15,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e8118f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:31:15, skipping insertion in model container [2024-10-12 19:31:15,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:31:15" (3/3) ... [2024-10-12 19:31:15,284 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec4_product28.cil.c [2024-10-12 19:31:15,295 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:31:15,296 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:31:15,347 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:31:15,353 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;@641f5ea4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:31:15,354 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:31:15,358 INFO L276 IsEmpty]: Start isEmpty. Operand has 303 states, 229 states have (on average 1.5764192139737991) internal successors, (361), 233 states have internal predecessors, (361), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-12 19:31:15,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-12 19:31:15,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:15,370 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-12 19:31:15,371 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:15,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:15,375 INFO L85 PathProgramCache]: Analyzing trace with hash -413976073, now seen corresponding path program 1 times [2024-10-12 19:31:15,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:15,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182863730] [2024-10-12 19:31:15,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:15,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:15,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:15,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:15,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:15,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:31:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:15,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:31:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:15,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:31:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:15,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:31:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:15,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:31:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:15,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:31:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:15,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:31:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:15,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 19:31:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:15,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 19:31:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:15,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 19:31:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-12 19:31:15,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:15,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182863730] [2024-10-12 19:31:15,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182863730] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:31:15,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228345492] [2024-10-12 19:31:15,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:15,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:31:15,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:31:15,970 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-12 19:31:15,971 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-12 19:31:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-12 19:31:16,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:31:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-12 19:31:16,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:31:16,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228345492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:16,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:31:16,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-10-12 19:31:16,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109404092] [2024-10-12 19:31:16,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:16,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:31:16,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:16,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:31:16,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:31:16,263 INFO L87 Difference]: Start difference. First operand has 303 states, 229 states have (on average 1.5764192139737991) internal successors, (361), 233 states have internal predecessors, (361), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) 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-12 19:31:16,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:16,328 INFO L93 Difference]: Finished difference Result 465 states and 692 transitions. [2024-10-12 19:31:16,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:31:16,331 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 98 [2024-10-12 19:31:16,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:16,343 INFO L225 Difference]: With dead ends: 465 [2024-10-12 19:31:16,346 INFO L226 Difference]: Without dead ends: 300 [2024-10-12 19:31:16,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:31:16,355 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:16,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 447 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:31:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-12 19:31:16,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2024-10-12 19:31:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 227 states have (on average 1.5594713656387664) internal successors, (354), 230 states have internal predecessors, (354), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-12 19:31:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 453 transitions. [2024-10-12 19:31:16,402 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 453 transitions. Word has length 98 [2024-10-12 19:31:16,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:16,403 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 453 transitions. [2024-10-12 19:31:16,403 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-12 19:31:16,403 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 453 transitions. [2024-10-12 19:31:16,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-12 19:31:16,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:16,407 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-12 19:31:16,423 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-12 19:31:16,609 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-12 19:31:16,610 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:16,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:16,610 INFO L85 PathProgramCache]: Analyzing trace with hash 468515798, now seen corresponding path program 1 times [2024-10-12 19:31:16,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:16,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839676505] [2024-10-12 19:31:16,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:16,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:16,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:16,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:31:16,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:31:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:31:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:31:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:31:16,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:31:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:31:16,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:31:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:31:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:31:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:16,812 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-12 19:31:16,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:16,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839676505] [2024-10-12 19:31:16,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839676505] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:31:16,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308868589] [2024-10-12 19:31:16,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:16,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:31:16,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:31:16,814 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-12 19:31:16,815 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-12 19:31:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:17,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 19:31:17,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:31:17,043 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-12 19:31:17,043 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:31:17,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308868589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:17,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:31:17,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-12 19:31:17,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363874705] [2024-10-12 19:31:17,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:17,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:31:17,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:17,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:31:17,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:31:17,048 INFO L87 Difference]: Start difference. First operand 300 states and 453 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-12 19:31:17,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:17,100 INFO L93 Difference]: Finished difference Result 461 states and 679 transitions. [2024-10-12 19:31:17,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:31:17,100 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 99 [2024-10-12 19:31:17,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:17,103 INFO L225 Difference]: With dead ends: 461 [2024-10-12 19:31:17,103 INFO L226 Difference]: Without dead ends: 302 [2024-10-12 19:31:17,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:31:17,104 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 0 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:17,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 887 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:31:17,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-12 19:31:17,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2024-10-12 19:31:17,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 229 states have (on average 1.554585152838428) internal successors, (356), 232 states have internal predecessors, (356), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-12 19:31:17,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 455 transitions. [2024-10-12 19:31:17,128 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 455 transitions. Word has length 99 [2024-10-12 19:31:17,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:17,128 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 455 transitions. [2024-10-12 19:31:17,129 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-12 19:31:17,129 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 455 transitions. [2024-10-12 19:31:17,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-12 19:31:17,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:17,136 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-12 19:31:17,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 19:31:17,337 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-12 19:31:17,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:17,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:17,338 INFO L85 PathProgramCache]: Analyzing trace with hash -483380743, now seen corresponding path program 1 times [2024-10-12 19:31:17,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:17,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272801010] [2024-10-12 19:31:17,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:17,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:17,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:17,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:17,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:17,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:17,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:31:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:17,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:31:17,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:17,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:31:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:17,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:31:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:17,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:31:17,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:17,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:31:17,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:17,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 19:31:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:17,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 19:31:17,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:17,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:31:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:17,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 19:31:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 19:31:17,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:17,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272801010] [2024-10-12 19:31:17,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272801010] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:31:17,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015845888] [2024-10-12 19:31:17,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:17,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:31:17,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:31:17,529 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-12 19:31:17,530 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-12 19:31:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:17,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 19:31:17,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:31:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-12 19:31:17,763 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:31:17,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015845888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:17,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:31:17,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-12 19:31:17,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980739853] [2024-10-12 19:31:17,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:17,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:31:17,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:17,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:31:17,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:31:17,764 INFO L87 Difference]: Start difference. First operand 302 states and 455 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-12 19:31:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:17,805 INFO L93 Difference]: Finished difference Result 630 states and 962 transitions. [2024-10-12 19:31:17,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:31:17,805 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 104 [2024-10-12 19:31:17,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:17,808 INFO L225 Difference]: With dead ends: 630 [2024-10-12 19:31:17,808 INFO L226 Difference]: Without dead ends: 350 [2024-10-12 19:31:17,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:31:17,809 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 95 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:17,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 857 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:31:17,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-10-12 19:31:17,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 345. [2024-10-12 19:31:17,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 261 states have (on average 1.5670498084291187) internal successors, (409), 264 states have internal predecessors, (409), 61 states have call successors, (61), 22 states have call predecessors, (61), 22 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-12 19:31:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 530 transitions. [2024-10-12 19:31:17,831 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 530 transitions. Word has length 104 [2024-10-12 19:31:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:17,831 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 530 transitions. [2024-10-12 19:31:17,831 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-12 19:31:17,831 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 530 transitions. [2024-10-12 19:31:17,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-12 19:31:17,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:17,833 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-12 19:31:17,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-12 19:31:18,034 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-12 19:31:18,035 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:18,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:18,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1859197006, now seen corresponding path program 1 times [2024-10-12 19:31:18,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:18,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630113627] [2024-10-12 19:31:18,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:18,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:31:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:31:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:31:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-12 19:31:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 19:31:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:31:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 19:31:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:31:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 19:31:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 19:31:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 19:31:18,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:18,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630113627] [2024-10-12 19:31:18,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630113627] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:31:18,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956236689] [2024-10-12 19:31:18,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:18,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:31:18,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:31:18,218 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-12 19:31:18,219 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-12 19:31:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 19:31:18,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:31:18,474 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 19:31:18,475 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:31:18,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956236689] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:18,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:31:18,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-10-12 19:31:18,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462776333] [2024-10-12 19:31:18,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:18,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:31:18,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:18,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:31:18,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:31:18,477 INFO L87 Difference]: Start difference. First operand 345 states and 530 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-12 19:31:18,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:18,544 INFO L93 Difference]: Finished difference Result 685 states and 1054 transitions. [2024-10-12 19:31:18,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:31:18,545 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 105 [2024-10-12 19:31:18,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:18,547 INFO L225 Difference]: With dead ends: 685 [2024-10-12 19:31:18,547 INFO L226 Difference]: Without dead ends: 347 [2024-10-12 19:31:18,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:31:18,549 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 2 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:18,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1733 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:31:18,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-10-12 19:31:18,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-10-12 19:31:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 262 states have (on average 1.5648854961832062) internal successors, (410), 266 states have internal predecessors, (410), 61 states have call successors, (61), 22 states have call predecessors, (61), 23 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) [2024-10-12 19:31:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 533 transitions. [2024-10-12 19:31:18,563 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 533 transitions. Word has length 105 [2024-10-12 19:31:18,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:18,563 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 533 transitions. [2024-10-12 19:31:18,563 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-12 19:31:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 533 transitions. [2024-10-12 19:31:18,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-12 19:31:18,565 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:18,565 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 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] [2024-10-12 19:31:18,581 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-12 19:31:18,768 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-12 19:31:18,769 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:18,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:18,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1335082445, now seen corresponding path program 1 times [2024-10-12 19:31:18,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:18,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741860066] [2024-10-12 19:31:18,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:18,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:18,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:31:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 19:31:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:31:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:31:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:31:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:31:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:31:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:31:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 19:31:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-12 19:31:18,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:18,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741860066] [2024-10-12 19:31:18,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741860066] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:31:18,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734544534] [2024-10-12 19:31:18,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:18,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:31:18,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:31:18,978 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-12 19:31:18,980 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-12 19:31:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:19,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 19:31:19,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:31:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-12 19:31:19,216 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:31:19,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734544534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:19,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:31:19,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-10-12 19:31:19,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540225646] [2024-10-12 19:31:19,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:19,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:31:19,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:19,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:31:19,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:31:19,218 INFO L87 Difference]: Start difference. First operand 347 states and 533 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-12 19:31:19,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:19,289 INFO L93 Difference]: Finished difference Result 687 states and 1059 transitions. [2024-10-12 19:31:19,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:31:19,291 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 106 [2024-10-12 19:31:19,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:19,293 INFO L225 Difference]: With dead ends: 687 [2024-10-12 19:31:19,293 INFO L226 Difference]: Without dead ends: 349 [2024-10-12 19:31:19,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:31:19,295 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 2 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:19,296 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1719 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:31:19,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-12 19:31:19,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-10-12 19:31:19,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 263 states have (on average 1.5627376425855513) internal successors, (411), 268 states have internal predecessors, (411), 61 states have call successors, (61), 22 states have call predecessors, (61), 24 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2024-10-12 19:31:19,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 539 transitions. [2024-10-12 19:31:19,313 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 539 transitions. Word has length 106 [2024-10-12 19:31:19,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:19,314 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 539 transitions. [2024-10-12 19:31:19,314 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-12 19:31:19,314 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 539 transitions. [2024-10-12 19:31:19,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-12 19:31:19,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:19,316 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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] [2024-10-12 19:31:19,329 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-12 19:31:19,516 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-12 19:31:19,517 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:19,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:19,517 INFO L85 PathProgramCache]: Analyzing trace with hash -755917868, now seen corresponding path program 1 times [2024-10-12 19:31:19,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:19,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862787709] [2024-10-12 19:31:19,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:19,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:19,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:19,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:19,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:19,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:19,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:19,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:31:19,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:19,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:31:19,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:19,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:31:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:19,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:31:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:19,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 19:31:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:19,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:31:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:19,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 19:31:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:19,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 19:31:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 19:31:19,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:19,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862787709] [2024-10-12 19:31:19,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862787709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:19,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:19,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:31:19,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982555363] [2024-10-12 19:31:19,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:19,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:31:19,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:19,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:31:19,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:31:19,680 INFO L87 Difference]: Start difference. First operand 349 states and 539 transitions. Second operand has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (15), 5 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-12 19:31:20,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:20,834 INFO L93 Difference]: Finished difference Result 741 states and 1152 transitions. [2024-10-12 19:31:20,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:31:20,834 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (15), 5 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 107 [2024-10-12 19:31:20,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:20,837 INFO L225 Difference]: With dead ends: 741 [2024-10-12 19:31:20,837 INFO L226 Difference]: Without dead ends: 411 [2024-10-12 19:31:20,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:31:20,838 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 737 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1875 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 2104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:20,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 817 Invalid, 2104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1875 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 19:31:20,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-10-12 19:31:20,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 349. [2024-10-12 19:31:20,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 263 states have (on average 1.5627376425855513) internal successors, (411), 268 states have internal predecessors, (411), 61 states have call successors, (61), 22 states have call predecessors, (61), 24 states have return successors, (66), 60 states have call predecessors, (66), 60 states have call successors, (66) [2024-10-12 19:31:20,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 538 transitions. [2024-10-12 19:31:20,873 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 538 transitions. Word has length 107 [2024-10-12 19:31:20,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:20,873 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 538 transitions. [2024-10-12 19:31:20,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (15), 5 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-12 19:31:20,873 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 538 transitions. [2024-10-12 19:31:20,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-12 19:31:20,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:20,874 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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] [2024-10-12 19:31:20,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:31:20,875 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:20,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:20,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1792395443, now seen corresponding path program 2 times [2024-10-12 19:31:20,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:20,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604130596] [2024-10-12 19:31:20,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:20,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:20,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:20,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:20,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:20,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:20,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:20,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:20,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:20,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:20,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:20,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:31:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:20,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:31:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:20,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:31:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:20,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:31:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:20,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:31:20,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:20,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:31:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:20,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 19:31:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:20,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:31:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:20,995 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-12 19:31:20,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:20,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604130596] [2024-10-12 19:31:20,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604130596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:20,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:20,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-12 19:31:20,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667307370] [2024-10-12 19:31:20,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:20,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-12 19:31:20,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:20,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-12 19:31:20,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-12 19:31:20,997 INFO L87 Difference]: Start difference. First operand 349 states and 538 transitions. Second operand has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 5 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-12 19:31:22,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:22,116 INFO L93 Difference]: Finished difference Result 743 states and 1155 transitions. [2024-10-12 19:31:22,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:31:22,117 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 5 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 108 [2024-10-12 19:31:22,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:22,119 INFO L225 Difference]: With dead ends: 743 [2024-10-12 19:31:22,119 INFO L226 Difference]: Without dead ends: 413 [2024-10-12 19:31:22,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:31:22,123 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 734 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1890 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:22,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 817 Invalid, 2119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1890 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-12 19:31:22,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-12 19:31:22,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 351. [2024-10-12 19:31:22,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 264 states have (on average 1.5606060606060606) internal successors, (412), 270 states have internal predecessors, (412), 61 states have call successors, (61), 22 states have call predecessors, (61), 25 states have return successors, (68), 60 states have call predecessors, (68), 60 states have call successors, (68) [2024-10-12 19:31:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 541 transitions. [2024-10-12 19:31:22,144 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 541 transitions. Word has length 108 [2024-10-12 19:31:22,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:22,144 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 541 transitions. [2024-10-12 19:31:22,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 5 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-12 19:31:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 541 transitions. [2024-10-12 19:31:22,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-12 19:31:22,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:22,146 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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-12 19:31:22,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:31:22,146 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:22,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:22,147 INFO L85 PathProgramCache]: Analyzing trace with hash 504202105, now seen corresponding path program 1 times [2024-10-12 19:31:22,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:22,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120536840] [2024-10-12 19:31:22,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:22,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:22,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:22,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:22,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:22,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:22,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:22,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:22,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:22,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:31:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:22,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:31:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:22,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:31:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:22,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 19:31:22,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:22,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 19:31:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:22,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-12 19:31:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:22,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 19:31:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:22,298 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-12 19:31:22,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:22,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120536840] [2024-10-12 19:31:22,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120536840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:22,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:22,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 19:31:22,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676405090] [2024-10-12 19:31:22,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:22,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 19:31:22,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:22,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 19:31:22,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:31:22,300 INFO L87 Difference]: Start difference. First operand 351 states and 541 transitions. Second operand has 11 states, 10 states have (on average 7.0) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (15), 5 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-12 19:31:23,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:23,846 INFO L93 Difference]: Finished difference Result 741 states and 1150 transitions. [2024-10-12 19:31:23,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:31:23,846 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.0) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (15), 5 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 109 [2024-10-12 19:31:23,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:23,849 INFO L225 Difference]: With dead ends: 741 [2024-10-12 19:31:23,849 INFO L226 Difference]: Without dead ends: 413 [2024-10-12 19:31:23,850 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-12 19:31:23,850 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 737 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 3188 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 3422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 3188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:23,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1174 Invalid, 3422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 3188 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 19:31:23,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-12 19:31:23,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 351. [2024-10-12 19:31:23,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 264 states have (on average 1.5606060606060606) internal successors, (412), 270 states have internal predecessors, (412), 61 states have call successors, (61), 22 states have call predecessors, (61), 25 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2024-10-12 19:31:23,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 540 transitions. [2024-10-12 19:31:23,868 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 540 transitions. Word has length 109 [2024-10-12 19:31:23,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:23,868 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 540 transitions. [2024-10-12 19:31:23,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.0) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (15), 5 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-12 19:31:23,868 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 540 transitions. [2024-10-12 19:31:23,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-12 19:31:23,869 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:23,869 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 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] [2024-10-12 19:31:23,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:31:23,869 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:23,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:23,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1153678138, now seen corresponding path program 2 times [2024-10-12 19:31:23,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:23,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473632098] [2024-10-12 19:31:23,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:23,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:23,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:23,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:24,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:24,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:24,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:24,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:24,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:24,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 19:31:24,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:24,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:31:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:24,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 19:31:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:24,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:31:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:24,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:31:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:24,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:31:24,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:24,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 19:31:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-12 19:31:24,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:24,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473632098] [2024-10-12 19:31:24,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473632098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:24,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:24,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-12 19:31:24,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773285498] [2024-10-12 19:31:24,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:24,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-12 19:31:24,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:24,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-12 19:31:24,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-12 19:31:24,070 INFO L87 Difference]: Start difference. First operand 351 states and 540 transitions. Second operand has 11 states, 10 states have (on average 7.1) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (15), 5 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-12 19:31:25,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:25,545 INFO L93 Difference]: Finished difference Result 743 states and 1156 transitions. [2024-10-12 19:31:25,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:31:25,545 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (15), 5 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 110 [2024-10-12 19:31:25,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:25,548 INFO L225 Difference]: With dead ends: 743 [2024-10-12 19:31:25,548 INFO L226 Difference]: Without dead ends: 415 [2024-10-12 19:31:25,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-12 19:31:25,551 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 734 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 3229 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 3461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 3229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:25,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 1175 Invalid, 3461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 3229 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 19:31:25,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-12 19:31:25,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 353. [2024-10-12 19:31:25,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 265 states have (on average 1.558490566037736) internal successors, (413), 272 states have internal predecessors, (413), 61 states have call successors, (61), 22 states have call predecessors, (61), 26 states have return successors, (72), 60 states have call predecessors, (72), 60 states have call successors, (72) [2024-10-12 19:31:25,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 546 transitions. [2024-10-12 19:31:25,569 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 546 transitions. Word has length 110 [2024-10-12 19:31:25,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:25,569 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 546 transitions. [2024-10-12 19:31:25,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (15), 5 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-12 19:31:25,570 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 546 transitions. [2024-10-12 19:31:25,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-12 19:31:25,571 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:25,572 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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-12 19:31:25,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:31:25,572 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:25,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:25,572 INFO L85 PathProgramCache]: Analyzing trace with hash 868232542, now seen corresponding path program 1 times [2024-10-12 19:31:25,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:25,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973128247] [2024-10-12 19:31:25,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:25,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:25,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:25,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:25,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:25,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:25,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:25,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:25,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:25,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:31:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:25,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:31:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:25,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 19:31:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:25,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:31:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:25,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 19:31:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:25,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 19:31:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:25,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 19:31:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:25,676 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:25,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:25,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973128247] [2024-10-12 19:31:25,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973128247] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:31:25,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133583449] [2024-10-12 19:31:25,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:25,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:31:25,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:31:25,678 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-12 19:31:25,679 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-12 19:31:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:25,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 19:31:25,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:31:25,914 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:25,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:31:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:25,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133583449] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:31:25,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:31:25,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-10-12 19:31:25,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319372875] [2024-10-12 19:31:25,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:31:25,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:31:25,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:25,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:31:25,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:31:25,995 INFO L87 Difference]: Start difference. First operand 353 states and 546 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 7 states have internal predecessors, (98), 2 states have call successors, (30), 5 states have call predecessors, (30), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-12 19:31:27,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:27,223 INFO L93 Difference]: Finished difference Result 884 states and 1441 transitions. [2024-10-12 19:31:27,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-12 19:31:27,224 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 7 states have internal predecessors, (98), 2 states have call successors, (30), 5 states have call predecessors, (30), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 111 [2024-10-12 19:31:27,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:27,228 INFO L225 Difference]: With dead ends: 884 [2024-10-12 19:31:27,228 INFO L226 Difference]: Without dead ends: 725 [2024-10-12 19:31:27,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-12 19:31:27,229 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 1097 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 1972 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 2316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 1972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:27,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 997 Invalid, 2316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 1972 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-12 19:31:27,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-10-12 19:31:27,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 648. [2024-10-12 19:31:27,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 496 states have (on average 1.6189516129032258) internal successors, (803), 503 states have internal predecessors, (803), 125 states have call successors, (125), 22 states have call predecessors, (125), 26 states have return successors, (146), 124 states have call predecessors, (146), 124 states have call successors, (146) [2024-10-12 19:31:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1074 transitions. [2024-10-12 19:31:27,258 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1074 transitions. Word has length 111 [2024-10-12 19:31:27,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:27,259 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 1074 transitions. [2024-10-12 19:31:27,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 7 states have internal predecessors, (98), 2 states have call successors, (30), 5 states have call predecessors, (30), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-12 19:31:27,259 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1074 transitions. [2024-10-12 19:31:27,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-12 19:31:27,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:27,261 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:31:27,276 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-12 19:31:27,462 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-12 19:31:27,463 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:27,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:27,463 INFO L85 PathProgramCache]: Analyzing trace with hash 593859387, now seen corresponding path program 1 times [2024-10-12 19:31:27,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:27,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635284775] [2024-10-12 19:31:27,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:27,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:27,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:27,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:27,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:27,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:27,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:27,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:27,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:27,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:27,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:31:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:27,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:31:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:27,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:31:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:27,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:31:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:27,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 19:31:27,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:27,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 19:31:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:27,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 19:31:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:27,559 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:27,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:27,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635284775] [2024-10-12 19:31:27,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635284775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:27,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:27,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:31:27,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433115938] [2024-10-12 19:31:27,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:27,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:31:27,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:27,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:31:27,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:31:27,560 INFO L87 Difference]: Start difference. First operand 648 states and 1074 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 5 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-12 19:31:28,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:28,354 INFO L93 Difference]: Finished difference Result 1595 states and 2710 transitions. [2024-10-12 19:31:28,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:31:28,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 5 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-12 19:31:28,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:28,360 INFO L225 Difference]: With dead ends: 1595 [2024-10-12 19:31:28,360 INFO L226 Difference]: Without dead ends: 1007 [2024-10-12 19:31:28,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:31:28,363 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 826 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:28,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 594 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 19:31:28,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2024-10-12 19:31:28,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 940. [2024-10-12 19:31:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 724 states have (on average 1.6298342541436464) internal successors, (1180), 731 states have internal predecessors, (1180), 189 states have call successors, (189), 22 states have call predecessors, (189), 26 states have return successors, (220), 188 states have call predecessors, (220), 188 states have call successors, (220) [2024-10-12 19:31:28,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1589 transitions. [2024-10-12 19:31:28,395 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1589 transitions. Word has length 117 [2024-10-12 19:31:28,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:28,395 INFO L471 AbstractCegarLoop]: Abstraction has 940 states and 1589 transitions. [2024-10-12 19:31:28,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 5 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-12 19:31:28,395 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1589 transitions. [2024-10-12 19:31:28,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-12 19:31:28,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:28,399 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:31:28,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 19:31:28,399 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:28,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:28,400 INFO L85 PathProgramCache]: Analyzing trace with hash -803479539, now seen corresponding path program 1 times [2024-10-12 19:31:28,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:28,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259090604] [2024-10-12 19:31:28,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:28,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:28,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:28,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:28,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:28,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:28,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:28,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:28,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:31:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:28,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 19:31:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:28,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 19:31:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:28,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:31:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:28,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 19:31:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:28,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 19:31:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:28,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 19:31:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:28,472 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:28,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:28,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259090604] [2024-10-12 19:31:28,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259090604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:28,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:28,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:31:28,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900182010] [2024-10-12 19:31:28,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:28,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:31:28,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:28,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:31:28,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:31:28,474 INFO L87 Difference]: Start difference. First operand 940 states and 1589 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 5 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-12 19:31:29,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:29,217 INFO L93 Difference]: Finished difference Result 2292 states and 3937 transitions. [2024-10-12 19:31:29,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:31:29,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 5 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-12 19:31:29,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:29,224 INFO L225 Difference]: With dead ends: 2292 [2024-10-12 19:31:29,225 INFO L226 Difference]: Without dead ends: 1462 [2024-10-12 19:31:29,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:31:29,227 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 824 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:29,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 585 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 19:31:29,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2024-10-12 19:31:29,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1395. [2024-10-12 19:31:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1084 states have (on average 1.636531365313653) internal successors, (1774), 1091 states have internal predecessors, (1774), 284 states have call successors, (284), 22 states have call predecessors, (284), 26 states have return successors, (315), 283 states have call predecessors, (315), 283 states have call successors, (315) [2024-10-12 19:31:29,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 2373 transitions. [2024-10-12 19:31:29,270 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 2373 transitions. Word has length 118 [2024-10-12 19:31:29,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:29,270 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 2373 transitions. [2024-10-12 19:31:29,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 5 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-12 19:31:29,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 2373 transitions. [2024-10-12 19:31:29,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-12 19:31:29,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:29,275 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:31:29,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:31:29,276 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:29,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:29,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1159932381, now seen corresponding path program 1 times [2024-10-12 19:31:29,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:29,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297489123] [2024-10-12 19:31:29,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:29,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:29,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:29,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:29,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:29,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:29,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:29,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:29,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:29,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:31:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:29,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 19:31:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:29,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 19:31:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:29,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:31:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:29,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 19:31:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:29,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 19:31:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:29,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 19:31:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:29,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:29,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297489123] [2024-10-12 19:31:29,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297489123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:29,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:29,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:31:29,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180107274] [2024-10-12 19:31:29,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:29,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:31:29,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:29,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:31:29,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:31:29,353 INFO L87 Difference]: Start difference. First operand 1395 states and 2373 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 5 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-12 19:31:30,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:30,102 INFO L93 Difference]: Finished difference Result 3310 states and 5749 transitions. [2024-10-12 19:31:30,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:31:30,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 5 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-12 19:31:30,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:30,114 INFO L225 Difference]: With dead ends: 3310 [2024-10-12 19:31:30,114 INFO L226 Difference]: Without dead ends: 2145 [2024-10-12 19:31:30,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:31:30,118 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 822 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:30,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 570 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:31:30,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2024-10-12 19:31:30,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 2078. [2024-10-12 19:31:30,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2078 states, 1644 states have (on average 1.6423357664233578) internal successors, (2700), 1651 states have internal predecessors, (2700), 407 states have call successors, (407), 22 states have call predecessors, (407), 26 states have return successors, (454), 406 states have call predecessors, (454), 406 states have call successors, (454) [2024-10-12 19:31:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 3561 transitions. [2024-10-12 19:31:30,193 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 3561 transitions. Word has length 119 [2024-10-12 19:31:30,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:30,195 INFO L471 AbstractCegarLoop]: Abstraction has 2078 states and 3561 transitions. [2024-10-12 19:31:30,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 5 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-12 19:31:30,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 3561 transitions. [2024-10-12 19:31:30,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-12 19:31:30,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:30,202 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:31:30,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:31:30,202 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:30,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:30,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2092714002, now seen corresponding path program 1 times [2024-10-12 19:31:30,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:30,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225257474] [2024-10-12 19:31:30,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:30,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:30,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:30,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:30,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:30,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:30,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:30,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:30,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:30,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:31:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:30,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:31:30,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:30,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 19:31:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:30,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 19:31:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:30,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 19:31:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:30,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 19:31:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:30,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-12 19:31:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:30,289 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:30,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:30,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225257474] [2024-10-12 19:31:30,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225257474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:30,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:30,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:31:30,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798370881] [2024-10-12 19:31:30,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:30,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:31:30,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:30,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:31:30,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:31:30,291 INFO L87 Difference]: Start difference. First operand 2078 states and 3561 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 5 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-12 19:31:31,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:31,094 INFO L93 Difference]: Finished difference Result 4880 states and 8554 transitions. [2024-10-12 19:31:31,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:31:31,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 5 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-12 19:31:31,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:31,110 INFO L225 Difference]: With dead ends: 4880 [2024-10-12 19:31:31,110 INFO L226 Difference]: Without dead ends: 3229 [2024-10-12 19:31:31,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:31:31,116 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 820 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:31,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 570 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 19:31:31,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2024-10-12 19:31:31,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 3162. [2024-10-12 19:31:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3162 states, 2549 states have (on average 1.6461357395056886) internal successors, (4196), 2556 states have internal predecessors, (4196), 586 states have call successors, (586), 22 states have call predecessors, (586), 26 states have return successors, (659), 585 states have call predecessors, (659), 585 states have call successors, (659) [2024-10-12 19:31:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3162 states to 3162 states and 5441 transitions. [2024-10-12 19:31:31,216 INFO L78 Accepts]: Start accepts. Automaton has 3162 states and 5441 transitions. Word has length 120 [2024-10-12 19:31:31,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:31,216 INFO L471 AbstractCegarLoop]: Abstraction has 3162 states and 5441 transitions. [2024-10-12 19:31:31,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 5 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-12 19:31:31,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3162 states and 5441 transitions. [2024-10-12 19:31:31,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-12 19:31:31,225 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:31,225 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:31:31,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:31:31,225 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:31,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:31,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1525973785, now seen corresponding path program 1 times [2024-10-12 19:31:31,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:31,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482874514] [2024-10-12 19:31:31,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:31,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:31,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:31,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:31,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:31,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:31,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:31,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:31,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:31:31,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:31,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 19:31:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:31,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 19:31:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:31,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:31:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:31,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:31:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:31,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 19:31:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:31,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-12 19:31:31,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:31,328 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:31,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:31,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482874514] [2024-10-12 19:31:31,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482874514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:31,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:31,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:31:31,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96081882] [2024-10-12 19:31:31,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:31,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:31:31,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:31,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:31:31,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:31:31,330 INFO L87 Difference]: Start difference. First operand 3162 states and 5441 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 5 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-12 19:31:32,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:32,030 INFO L93 Difference]: Finished difference Result 7711 states and 13566 transitions. [2024-10-12 19:31:32,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:31:32,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 5 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-12 19:31:32,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:32,052 INFO L225 Difference]: With dead ends: 7711 [2024-10-12 19:31:32,052 INFO L226 Difference]: Without dead ends: 5199 [2024-10-12 19:31:32,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:31:32,060 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 818 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:32,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 602 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:31:32,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5199 states. [2024-10-12 19:31:32,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5199 to 5132. [2024-10-12 19:31:32,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5132 states, 4143 states have (on average 1.6381848901762008) internal successors, (6787), 4150 states have internal predecessors, (6787), 962 states have call successors, (962), 22 states have call predecessors, (962), 26 states have return successors, (1079), 961 states have call predecessors, (1079), 961 states have call successors, (1079) [2024-10-12 19:31:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5132 states to 5132 states and 8828 transitions. [2024-10-12 19:31:32,246 INFO L78 Accepts]: Start accepts. Automaton has 5132 states and 8828 transitions. Word has length 121 [2024-10-12 19:31:32,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:32,246 INFO L471 AbstractCegarLoop]: Abstraction has 5132 states and 8828 transitions. [2024-10-12 19:31:32,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 5 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-12 19:31:32,250 INFO L276 IsEmpty]: Start isEmpty. Operand 5132 states and 8828 transitions. [2024-10-12 19:31:32,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-12 19:31:32,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:32,265 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:31:32,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:31:32,265 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:32,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:32,266 INFO L85 PathProgramCache]: Analyzing trace with hash 2080387762, now seen corresponding path program 1 times [2024-10-12 19:31:32,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:32,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246158525] [2024-10-12 19:31:32,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:32,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:32,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:32,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:32,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:32,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:32,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:32,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:32,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:32,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:32,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:31:32,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:32,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:31:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:32,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:31:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:32,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 19:31:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:32,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 19:31:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:32,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:31:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:32,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 19:31:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:32,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:32,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246158525] [2024-10-12 19:31:32,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246158525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:32,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:32,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:31:32,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807727951] [2024-10-12 19:31:32,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:32,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:31:32,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:32,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:31:32,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:31:32,338 INFO L87 Difference]: Start difference. First operand 5132 states and 8828 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 5 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-12 19:31:33,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:33,189 INFO L93 Difference]: Finished difference Result 12692 states and 22314 transitions. [2024-10-12 19:31:33,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:31:33,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 5 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-12 19:31:33,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:33,226 INFO L225 Difference]: With dead ends: 12692 [2024-10-12 19:31:33,229 INFO L226 Difference]: Without dead ends: 8576 [2024-10-12 19:31:33,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:31:33,242 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 816 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:33,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 581 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 19:31:33,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8576 states. [2024-10-12 19:31:33,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8576 to 8509. [2024-10-12 19:31:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8509 states, 6914 states have (on average 1.6358113971651722) internal successors, (11310), 6921 states have internal predecessors, (11310), 1568 states have call successors, (1568), 22 states have call predecessors, (1568), 26 states have return successors, (1763), 1567 states have call predecessors, (1763), 1567 states have call successors, (1763) [2024-10-12 19:31:33,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8509 states to 8509 states and 14641 transitions. [2024-10-12 19:31:33,561 INFO L78 Accepts]: Start accepts. Automaton has 8509 states and 14641 transitions. Word has length 122 [2024-10-12 19:31:33,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:33,561 INFO L471 AbstractCegarLoop]: Abstraction has 8509 states and 14641 transitions. [2024-10-12 19:31:33,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 5 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-12 19:31:33,562 INFO L276 IsEmpty]: Start isEmpty. Operand 8509 states and 14641 transitions. [2024-10-12 19:31:33,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-12 19:31:33,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:33,580 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:31:33,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 19:31:33,580 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:33,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:33,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1929376667, now seen corresponding path program 1 times [2024-10-12 19:31:33,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:33,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19174046] [2024-10-12 19:31:33,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:33,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:33,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:33,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:31:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 19:31:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:31:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:31:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 19:31:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 19:31:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:31:33,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:33,653 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:33,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:33,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19174046] [2024-10-12 19:31:33,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19174046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:33,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:33,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:31:33,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620702179] [2024-10-12 19:31:33,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:33,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:31:33,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:33,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:31:33,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:31:33,655 INFO L87 Difference]: Start difference. First operand 8509 states and 14641 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 5 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-12 19:31:34,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:34,593 INFO L93 Difference]: Finished difference Result 22044 states and 38713 transitions. [2024-10-12 19:31:34,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:31:34,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 5 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-12 19:31:34,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:34,637 INFO L225 Difference]: With dead ends: 22044 [2024-10-12 19:31:34,637 INFO L226 Difference]: Without dead ends: 14960 [2024-10-12 19:31:34,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:31:34,656 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 814 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:34,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 596 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:31:34,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14960 states. [2024-10-12 19:31:35,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14960 to 14893. [2024-10-12 19:31:35,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14893 states, 12095 states have (on average 1.6260438197602316) internal successors, (19667), 12102 states have internal predecessors, (19667), 2771 states have call successors, (2771), 22 states have call predecessors, (2771), 26 states have return successors, (3110), 2770 states have call predecessors, (3110), 2770 states have call successors, (3110) [2024-10-12 19:31:35,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14893 states to 14893 states and 25548 transitions. [2024-10-12 19:31:35,094 INFO L78 Accepts]: Start accepts. Automaton has 14893 states and 25548 transitions. Word has length 123 [2024-10-12 19:31:35,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:35,095 INFO L471 AbstractCegarLoop]: Abstraction has 14893 states and 25548 transitions. [2024-10-12 19:31:35,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 5 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-12 19:31:35,096 INFO L276 IsEmpty]: Start isEmpty. Operand 14893 states and 25548 transitions. [2024-10-12 19:31:35,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 19:31:35,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:35,119 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:31:35,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 19:31:35,120 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:35,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:35,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1294665267, now seen corresponding path program 1 times [2024-10-12 19:31:35,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:35,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008567632] [2024-10-12 19:31:35,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:35,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:35,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:35,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:35,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:35,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:35,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:35,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:35,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:35,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:31:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:35,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:31:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:35,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:31:35,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:35,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 19:31:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:35,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 19:31:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:35,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 19:31:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:35,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 19:31:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:35,184 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:35,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:35,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008567632] [2024-10-12 19:31:35,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008567632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:35,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:35,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:31:35,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913418595] [2024-10-12 19:31:35,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:35,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:31:35,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:35,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:31:35,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:31:35,186 INFO L87 Difference]: Start difference. First operand 14893 states and 25548 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 5 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-12 19:31:36,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:36,406 INFO L93 Difference]: Finished difference Result 39403 states and 69099 transitions. [2024-10-12 19:31:36,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:31:36,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 5 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 124 [2024-10-12 19:31:36,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:36,497 INFO L225 Difference]: With dead ends: 39403 [2024-10-12 19:31:36,497 INFO L226 Difference]: Without dead ends: 26527 [2024-10-12 19:31:36,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:31:36,534 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 812 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:36,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 571 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 19:31:36,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26527 states. [2024-10-12 19:31:37,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26527 to 26460. [2024-10-12 19:31:37,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26460 states, 21623 states have (on average 1.6219765989918142) internal successors, (35072), 21630 states have internal predecessors, (35072), 4810 states have call successors, (4810), 22 states have call predecessors, (4810), 26 states have return successors, (5423), 4809 states have call predecessors, (5423), 4809 states have call successors, (5423) [2024-10-12 19:31:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26460 states to 26460 states and 45305 transitions. [2024-10-12 19:31:37,385 INFO L78 Accepts]: Start accepts. Automaton has 26460 states and 45305 transitions. Word has length 124 [2024-10-12 19:31:37,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:37,386 INFO L471 AbstractCegarLoop]: Abstraction has 26460 states and 45305 transitions. [2024-10-12 19:31:37,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 5 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-12 19:31:37,386 INFO L276 IsEmpty]: Start isEmpty. Operand 26460 states and 45305 transitions. [2024-10-12 19:31:37,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-12 19:31:37,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:37,412 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:31:37,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 19:31:37,412 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:37,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:37,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1751403395, now seen corresponding path program 1 times [2024-10-12 19:31:37,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:37,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138839433] [2024-10-12 19:31:37,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:37,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:37,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:37,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:37,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:37,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:37,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:37,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:37,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:37,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:37,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:31:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:37,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:31:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:37,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:31:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:37,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 19:31:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:37,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 19:31:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:37,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 19:31:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:37,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 19:31:37,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:37,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:37,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138839433] [2024-10-12 19:31:37,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138839433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:37,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:37,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:31:37,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691509387] [2024-10-12 19:31:37,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:37,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:31:37,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:37,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:31:37,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:31:37,489 INFO L87 Difference]: Start difference. First operand 26460 states and 45305 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 5 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-12 19:31:39,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:39,341 INFO L93 Difference]: Finished difference Result 72015 states and 125523 transitions. [2024-10-12 19:31:39,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:31:39,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 5 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 125 [2024-10-12 19:31:39,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:39,485 INFO L225 Difference]: With dead ends: 72015 [2024-10-12 19:31:39,485 INFO L226 Difference]: Without dead ends: 48287 [2024-10-12 19:31:39,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:31:39,539 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 810 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:39,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 585 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 19:31:39,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48287 states. [2024-10-12 19:31:41,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48287 to 48220. [2024-10-12 19:31:41,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48220 states, 39668 states have (on average 1.6165170918624585) internal successors, (64124), 39675 states have internal predecessors, (64124), 8525 states have call successors, (8525), 22 states have call predecessors, (8525), 26 states have return successors, (9670), 8524 states have call predecessors, (9670), 8524 states have call successors, (9670) [2024-10-12 19:31:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48220 states to 48220 states and 82319 transitions. [2024-10-12 19:31:41,295 INFO L78 Accepts]: Start accepts. Automaton has 48220 states and 82319 transitions. Word has length 125 [2024-10-12 19:31:41,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:41,296 INFO L471 AbstractCegarLoop]: Abstraction has 48220 states and 82319 transitions. [2024-10-12 19:31:41,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 5 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-12 19:31:41,296 INFO L276 IsEmpty]: Start isEmpty. Operand 48220 states and 82319 transitions. [2024-10-12 19:31:41,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 19:31:41,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:41,330 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:31:41,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 19:31:41,330 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:41,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:41,330 INFO L85 PathProgramCache]: Analyzing trace with hash -47176237, now seen corresponding path program 1 times [2024-10-12 19:31:41,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:41,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895786327] [2024-10-12 19:31:41,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:41,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:41,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:41,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:41,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:41,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:41,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:41,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:41,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:41,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:41,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:41,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:41,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:31:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:41,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 19:31:41,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:41,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 19:31:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:41,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-12 19:31:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:41,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 19:31:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:41,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 19:31:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:41,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 19:31:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:41,615 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:41,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:41,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895786327] [2024-10-12 19:31:41,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895786327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:41,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:41,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-12 19:31:41,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130078989] [2024-10-12 19:31:41,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:41,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-12 19:31:41,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:41,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-12 19:31:41,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-12 19:31:41,622 INFO L87 Difference]: Start difference. First operand 48220 states and 82319 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 5 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-12 19:31:43,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:43,921 INFO L93 Difference]: Finished difference Result 89734 states and 156887 transitions. [2024-10-12 19:31:43,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-12 19:31:43,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 5 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 126 [2024-10-12 19:31:43,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:44,204 INFO L225 Difference]: With dead ends: 89734 [2024-10-12 19:31:44,204 INFO L226 Difference]: Without dead ends: 89575 [2024-10-12 19:31:44,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:31:44,237 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 805 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:44,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 579 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-12 19:31:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89575 states. [2024-10-12 19:31:46,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89575 to 89508. [2024-10-12 19:31:46,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89508 states, 74157 states have (on average 1.6094771902854754) internal successors, (119354), 74164 states have internal predecessors, (119354), 15324 states have call successors, (15324), 22 states have call predecessors, (15324), 26 states have return successors, (17515), 15323 states have call predecessors, (17515), 15323 states have call successors, (17515) [2024-10-12 19:31:46,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89508 states to 89508 states and 152193 transitions. [2024-10-12 19:31:46,903 INFO L78 Accepts]: Start accepts. Automaton has 89508 states and 152193 transitions. Word has length 126 [2024-10-12 19:31:46,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:31:46,904 INFO L471 AbstractCegarLoop]: Abstraction has 89508 states and 152193 transitions. [2024-10-12 19:31:46,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 5 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-12 19:31:46,904 INFO L276 IsEmpty]: Start isEmpty. Operand 89508 states and 152193 transitions. [2024-10-12 19:31:46,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-12 19:31:46,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:31:46,940 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:31:46,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 19:31:46,940 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:31:46,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:31:46,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1341870980, now seen corresponding path program 1 times [2024-10-12 19:31:46,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:31:46,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618726971] [2024-10-12 19:31:46,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:31:46,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:31:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:47,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:31:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:47,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:31:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:47,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:31:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:47,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:31:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:47,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:31:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:47,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:31:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:47,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:31:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:47,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 19:31:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:47,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:31:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:47,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:31:47,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:47,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 19:31:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:47,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-12 19:31:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:47,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-12 19:31:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:31:47,670 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:31:47,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:31:47,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618726971] [2024-10-12 19:31:47,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618726971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:31:47,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:31:47,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-12 19:31:47,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226935784] [2024-10-12 19:31:47,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:31:47,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-12 19:31:47,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:31:47,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-12 19:31:47,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2024-10-12 19:31:47,672 INFO L87 Difference]: Start difference. First operand 89508 states and 152193 transitions. Second operand has 16 states, 15 states have (on average 5.533333333333333) internal successors, (83), 11 states have internal predecessors, (83), 6 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-10-12 19:31:54,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:31:54,067 INFO L93 Difference]: Finished difference Result 178747 states and 315868 transitions. [2024-10-12 19:31:54,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-12 19:31:54,068 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.533333333333333) internal successors, (83), 11 states have internal predecessors, (83), 6 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 127 [2024-10-12 19:31:54,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:31:54,914 INFO L225 Difference]: With dead ends: 178747 [2024-10-12 19:31:54,914 INFO L226 Difference]: Without dead ends: 178595 [2024-10-12 19:31:54,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=512, Invalid=1938, Unknown=0, NotChecked=0, Total=2450 [2024-10-12 19:31:54,975 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 3190 mSDsluCounter, 2055 mSDsCounter, 0 mSdLazyCounter, 6351 mSolverCounterSat, 1046 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3190 SdHoareTripleChecker+Valid, 2263 SdHoareTripleChecker+Invalid, 7397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1046 IncrementalHoareTripleChecker+Valid, 6351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:31:54,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3190 Valid, 2263 Invalid, 7397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1046 Valid, 6351 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 19:31:55,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178595 states. [2024-10-12 19:32:00,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178595 to 178282. [2024-10-12 19:32:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178282 states, 147773 states have (on average 1.6104430443991797) internal successors, (237980), 147677 states have internal predecessors, (237980), 30443 states have call successors, (30443), 59 states have call predecessors, (30443), 65 states have return successors, (38094), 30551 states have call predecessors, (38094), 30440 states have call successors, (38094) [2024-10-12 19:32:02,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178282 states to 178282 states and 306517 transitions. [2024-10-12 19:32:02,183 INFO L78 Accepts]: Start accepts. Automaton has 178282 states and 306517 transitions. Word has length 127 [2024-10-12 19:32:02,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:32:02,183 INFO L471 AbstractCegarLoop]: Abstraction has 178282 states and 306517 transitions. [2024-10-12 19:32:02,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.533333333333333) internal successors, (83), 11 states have internal predecessors, (83), 6 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-10-12 19:32:02,184 INFO L276 IsEmpty]: Start isEmpty. Operand 178282 states and 306517 transitions. [2024-10-12 19:32:02,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-12 19:32:02,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:32:02,271 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:32:02,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 19:32:02,271 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:32:02,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:32:02,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1144723784, now seen corresponding path program 1 times [2024-10-12 19:32:02,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:32:02,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185773761] [2024-10-12 19:32:02,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:32:02,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:32:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:32:02,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:32:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:32:02,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:32:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:32:02,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:32:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:32:02,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:32:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:32:02,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:32:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:32:02,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:32:02,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:32:02,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:32:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:32:02,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 19:32:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:32:02,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:32:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:32:02,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:32:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:32:02,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:32:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:32:02,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-12 19:32:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:32:02,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 19:32:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:32:02,481 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-12 19:32:02,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:32:02,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185773761] [2024-10-12 19:32:02,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185773761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:32:02,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:32:02,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-12 19:32:02,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362835104] [2024-10-12 19:32:02,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:32:02,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-12 19:32:02,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:32:02,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-12 19:32:02,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:32:02,483 INFO L87 Difference]: Start difference. First operand 178282 states and 306517 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 8 states have internal predecessors, (84), 5 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-12 19:32:07,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:32:07,874 INFO L93 Difference]: Finished difference Result 179263 states and 314505 transitions. [2024-10-12 19:32:07,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-12 19:32:07,875 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 8 states have internal predecessors, (84), 5 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 128 [2024-10-12 19:32:07,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:32:08,641 INFO L225 Difference]: With dead ends: 179263 [2024-10-12 19:32:08,641 INFO L226 Difference]: Without dead ends: 178583 [2024-10-12 19:32:08,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2024-10-12 19:32:08,698 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1454 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 3622 mSolverCounterSat, 482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 4104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 3622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:32:08,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 1253 Invalid, 4104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 3622 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 19:32:08,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178583 states.