./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_spec0_product37.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product37.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 9dc54d5213c4407313cf4404e06f4e3ced3af047edaa52f6d33441570abdeda7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:41:32,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:41:32,449 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:41:32,456 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:41:32,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:41:32,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:41:32,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:41:32,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:41:32,490 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:41:32,491 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:41:32,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:41:32,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:41:32,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:41:32,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:41:32,495 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:41:32,496 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:41:32,496 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:41:32,496 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:41:32,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:41:32,497 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:41:32,497 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:41:32,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:41:32,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:41:32,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:41:32,502 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:41:32,503 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:41:32,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:41:32,503 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:41:32,504 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:41:32,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:41:32,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:41:32,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:41:32,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:41:32,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:41:32,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:41:32,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:41:32,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:41:32,506 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:41:32,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:41:32,507 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:41:32,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:41:32,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:41:32,509 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-clean/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-clean/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 -> 9dc54d5213c4407313cf4404e06f4e3ced3af047edaa52f6d33441570abdeda7 [2024-10-11 02:41:32,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:41:32,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:41:32,801 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:41:32,802 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:41:32,803 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:41:32,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product37.cil.c [2024-10-11 02:41:34,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:41:34,667 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:41:34,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product37.cil.c [2024-10-11 02:41:34,688 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2cab354a4/d366367339ed4bc0a1dbbfbf0f6c4284/FLAG55efc7e88 [2024-10-11 02:41:34,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/2cab354a4/d366367339ed4bc0a1dbbfbf0f6c4284 [2024-10-11 02:41:34,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:41:34,950 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:41:34,953 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:41:34,953 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:41:34,960 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:41:34,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:41:34" (1/1) ... [2024-10-11 02:41:34,963 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@761f1dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:34, skipping insertion in model container [2024-10-11 02:41:34,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:41:34" (1/1) ... [2024-10-11 02:41:35,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:41:35,224 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_spec0_product37.cil.c[1542,1555] [2024-10-11 02:41:35,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:41:35,668 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:41:35,679 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2024-10-11 02:41:35,681 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [57] [2024-10-11 02:41:35,681 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [384] [2024-10-11 02:41:35,682 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1455] [2024-10-11 02:41:35,682 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1686] [2024-10-11 02:41:35,682 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1721] [2024-10-11 02:41:35,682 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1738] [2024-10-11 02:41:35,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2146] [2024-10-11 02:41:35,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2512] [2024-10-11 02:41:35,684 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [2576] [2024-10-11 02:41:35,684 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2595] [2024-10-11 02:41:35,686 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_spec0_product37.cil.c[1542,1555] [2024-10-11 02:41:35,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:41:35,881 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:41:35,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:35 WrapperNode [2024-10-11 02:41:35,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:41:35,883 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:41:35,883 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:41:35,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:41:35,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:35" (1/1) ... [2024-10-11 02:41:35,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:35" (1/1) ... [2024-10-11 02:41:35,992 INFO L138 Inliner]: procedures = 124, calls = 170, calls flagged for inlining = 51, calls inlined = 46, statements flattened = 834 [2024-10-11 02:41:35,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:41:35,993 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:41:35,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:41:35,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:41:36,013 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:35" (1/1) ... [2024-10-11 02:41:36,013 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:35" (1/1) ... [2024-10-11 02:41:36,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:35" (1/1) ... [2024-10-11 02:41:36,051 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-11 02:41:36,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:35" (1/1) ... [2024-10-11 02:41:36,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:35" (1/1) ... [2024-10-11 02:41:36,064 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:35" (1/1) ... [2024-10-11 02:41:36,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:35" (1/1) ... [2024-10-11 02:41:36,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:35" (1/1) ... [2024-10-11 02:41:36,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:35" (1/1) ... [2024-10-11 02:41:36,094 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:41:36,098 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:41:36,099 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:41:36,099 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:41:36,100 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:35" (1/1) ... [2024-10-11 02:41:36,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:41:36,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:41:36,159 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:41:36,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:41:36,224 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-11 02:41:36,225 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-11 02:41:36,225 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-11 02:41:36,225 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-11 02:41:36,225 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-11 02:41:36,225 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-11 02:41:36,226 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-11 02:41:36,226 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-11 02:41:36,227 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-11 02:41:36,227 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-11 02:41:36,227 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-11 02:41:36,227 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-11 02:41:36,227 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2024-10-11 02:41:36,228 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2024-10-11 02:41:36,228 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-11 02:41:36,228 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-11 02:41:36,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:41:36,229 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-11 02:41:36,229 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-11 02:41:36,229 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-11 02:41:36,229 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-11 02:41:36,229 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-11 02:41:36,229 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-11 02:41:36,229 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-11 02:41:36,230 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-11 02:41:36,230 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-11 02:41:36,230 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-11 02:41:36,230 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-11 02:41:36,230 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-11 02:41:36,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:41:36,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:41:36,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:41:36,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:41:36,233 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-11 02:41:36,233 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-11 02:41:36,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:41:36,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:41:36,426 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:41:36,428 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:41:37,088 INFO L? ?]: Removed 326 outVars from TransFormulas that were not future-live. [2024-10-11 02:41:37,089 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:41:37,140 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:41:37,141 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:41:37,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:41:37 BoogieIcfgContainer [2024-10-11 02:41:37,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:41:37,144 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:41:37,144 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:41:37,147 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:41:37,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:41:34" (1/3) ... [2024-10-11 02:41:37,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2783facd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:41:37, skipping insertion in model container [2024-10-11 02:41:37,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:41:35" (2/3) ... [2024-10-11 02:41:37,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2783facd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:41:37, skipping insertion in model container [2024-10-11 02:41:37,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:41:37" (3/3) ... [2024-10-11 02:41:37,150 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec0_product37.cil.c [2024-10-11 02:41:37,165 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:41:37,165 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:41:37,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:41:37,245 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;@1efc5044, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:41:37,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:41:37,252 INFO L276 IsEmpty]: Start isEmpty. Operand has 234 states, 177 states have (on average 1.5932203389830508) internal successors, (282), 179 states have internal predecessors, (282), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 02:41:37,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 02:41:37,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:37,276 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] [2024-10-11 02:41:37,277 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:37,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:37,283 INFO L85 PathProgramCache]: Analyzing trace with hash 740656969, now seen corresponding path program 1 times [2024-10-11 02:41:37,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:37,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666036507] [2024-10-11 02:41:37,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:37,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:37,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:37,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:37,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:38,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:41:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:38,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:41:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:38,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:41:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:38,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:41:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:38,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:41:38,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:38,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:41:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:38,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:41:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:38,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:41:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:38,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:41:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:38,116 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-11 02:41:38,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:38,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666036507] [2024-10-11 02:41:38,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666036507] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:41:38,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641680085] [2024-10-11 02:41:38,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:38,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:41:38,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:41:38,122 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:41:38,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:41:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:38,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 02:41:38,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:41:38,443 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-11 02:41:38,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:41:38,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641680085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:38,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:41:38,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-11 02:41:38,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861193365] [2024-10-11 02:41:38,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:38,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:41:38,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:38,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:41:38,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:41:38,487 INFO L87 Difference]: Start difference. First operand has 234 states, 177 states have (on average 1.5932203389830508) internal successors, (282), 179 states have internal predecessors, (282), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:41:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:38,574 INFO L93 Difference]: Finished difference Result 319 states and 480 transitions. [2024-10-11 02:41:38,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:41:38,577 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 88 [2024-10-11 02:41:38,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:38,590 INFO L225 Difference]: With dead ends: 319 [2024-10-11 02:41:38,590 INFO L226 Difference]: Without dead ends: 231 [2024-10-11 02:41:38,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:41:38,599 INFO L432 NwaCegarLoop]: 343 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:38,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 343 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:41:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-10-11 02:41:38,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2024-10-11 02:41:38,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 175 states have (on average 1.5714285714285714) internal successors, (275), 176 states have internal predecessors, (275), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 02:41:38,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 354 transitions. [2024-10-11 02:41:38,677 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 354 transitions. Word has length 88 [2024-10-11 02:41:38,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:38,678 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 354 transitions. [2024-10-11 02:41:38,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:41:38,679 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 354 transitions. [2024-10-11 02:41:38,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 02:41:38,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:38,687 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] [2024-10-11 02:41:38,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 02:41:38,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-11 02:41:38,888 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:38,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:38,890 INFO L85 PathProgramCache]: Analyzing trace with hash -717797368, now seen corresponding path program 1 times [2024-10-11 02:41:38,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:38,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940627657] [2024-10-11 02:41:38,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:38,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:41:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:41:39,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:41:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:41:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:41:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:41:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:41:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:41:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:41:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,250 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-11 02:41:39,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:39,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940627657] [2024-10-11 02:41:39,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940627657] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:41:39,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249820897] [2024-10-11 02:41:39,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:39,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:41:39,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:41:39,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:41:39,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:41:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:39,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:41:39,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:41:39,553 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-11 02:41:39,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:41:39,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249820897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:39,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:41:39,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:41:39,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651312680] [2024-10-11 02:41:39,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:39,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:41:39,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:39,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:41:39,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:41:39,564 INFO L87 Difference]: Start difference. First operand 231 states and 354 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:41:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:39,642 INFO L93 Difference]: Finished difference Result 315 states and 467 transitions. [2024-10-11 02:41:39,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:41:39,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 89 [2024-10-11 02:41:39,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:39,647 INFO L225 Difference]: With dead ends: 315 [2024-10-11 02:41:39,648 INFO L226 Difference]: Without dead ends: 233 [2024-10-11 02:41:39,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:41:39,650 INFO L432 NwaCegarLoop]: 340 mSDtfsCounter, 0 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:39,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 679 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:41:39,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-10-11 02:41:39,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-10-11 02:41:39,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 177 states have (on average 1.5649717514124293) internal successors, (277), 178 states have internal predecessors, (277), 40 states have call successors, (40), 15 states have call predecessors, (40), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-10-11 02:41:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 356 transitions. [2024-10-11 02:41:39,682 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 356 transitions. Word has length 89 [2024-10-11 02:41:39,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:39,683 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 356 transitions. [2024-10-11 02:41:39,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:41:39,684 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 356 transitions. [2024-10-11 02:41:39,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 02:41:39,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:39,690 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] [2024-10-11 02:41:39,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:41:39,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:41:39,892 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:39,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:39,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1491998209, now seen corresponding path program 1 times [2024-10-11 02:41:39,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:39,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111130125] [2024-10-11 02:41:39,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:39,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:39,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:40,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:40,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:40,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:40,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:41:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:40,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:41:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:40,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:41:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:40,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:41:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:40,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:41:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:40,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:41:40,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:40,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:41:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:40,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:41:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:40,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:41:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:40,166 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-11 02:41:40,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:40,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111130125] [2024-10-11 02:41:40,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111130125] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:41:40,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682586670] [2024-10-11 02:41:40,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:40,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:41:40,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:41:40,171 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:41:40,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:41:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:40,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:41:40,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:41:40,460 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-11 02:41:40,461 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:41:40,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682586670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:40,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:41:40,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:41:40,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920096422] [2024-10-11 02:41:40,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:40,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:41:40,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:40,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:41:40,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:41:40,466 INFO L87 Difference]: Start difference. First operand 233 states and 356 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:41:40,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:40,536 INFO L93 Difference]: Finished difference Result 500 states and 778 transitions. [2024-10-11 02:41:40,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:41:40,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 96 [2024-10-11 02:41:40,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:40,540 INFO L225 Difference]: With dead ends: 500 [2024-10-11 02:41:40,540 INFO L226 Difference]: Without dead ends: 289 [2024-10-11 02:41:40,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:41:40,543 INFO L432 NwaCegarLoop]: 345 mSDtfsCounter, 109 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:40,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 639 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:41:40,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-11 02:41:40,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 284. [2024-10-11 02:41:40,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 217 states have (on average 1.5852534562211982) internal successors, (344), 218 states have internal predecessors, (344), 51 states have call successors, (51), 15 states have call predecessors, (51), 15 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-11 02:41:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 445 transitions. [2024-10-11 02:41:40,575 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 445 transitions. Word has length 96 [2024-10-11 02:41:40,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:40,575 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 445 transitions. [2024-10-11 02:41:40,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:41:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 445 transitions. [2024-10-11 02:41:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 02:41:40,578 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:40,578 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] [2024-10-11 02:41:40,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 02:41:40,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:41:40,783 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:40,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:40,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1762228474, now seen corresponding path program 1 times [2024-10-11 02:41:40,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:40,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236994107] [2024-10-11 02:41:40,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:40,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:40,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:40,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:40,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:40,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:40,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:41:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:40,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:41:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:40,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:41:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:40,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:41:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:41:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:41:41,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:41:41,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:41:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:41:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,021 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-11 02:41:41,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:41,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236994107] [2024-10-11 02:41:41,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236994107] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:41:41,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592384766] [2024-10-11 02:41:41,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:41,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:41:41,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:41:41,024 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:41:41,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 02:41:41,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 898 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 02:41:41,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:41:41,346 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-11 02:41:41,349 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:41:41,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592384766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:41,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:41:41,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-11 02:41:41,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595736195] [2024-10-11 02:41:41,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:41,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:41:41,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:41,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:41:41,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:41:41,351 INFO L87 Difference]: Start difference. First operand 284 states and 445 transitions. Second operand has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:41:41,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:41,463 INFO L93 Difference]: Finished difference Result 563 states and 884 transitions. [2024-10-11 02:41:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:41:41,464 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2024-10-11 02:41:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:41,467 INFO L225 Difference]: With dead ends: 563 [2024-10-11 02:41:41,467 INFO L226 Difference]: Without dead ends: 286 [2024-10-11 02:41:41,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:41:41,470 INFO L432 NwaCegarLoop]: 332 mSDtfsCounter, 2 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1317 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:41,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1317 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:41:41,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-11 02:41:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-10-11 02:41:41,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 218 states have (on average 1.5825688073394495) internal successors, (345), 220 states have internal predecessors, (345), 51 states have call successors, (51), 15 states have call predecessors, (51), 16 states have return successors, (52), 50 states have call predecessors, (52), 50 states have call successors, (52) [2024-10-11 02:41:41,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 448 transitions. [2024-10-11 02:41:41,492 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 448 transitions. Word has length 97 [2024-10-11 02:41:41,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:41,492 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 448 transitions. [2024-10-11 02:41:41,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.25) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:41:41,493 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 448 transitions. [2024-10-11 02:41:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 02:41:41,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:41,495 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] [2024-10-11 02:41:41,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 02:41:41,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:41:41,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:41,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:41,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1397427171, now seen corresponding path program 1 times [2024-10-11 02:41:41,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:41,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843393328] [2024-10-11 02:41:41,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:41,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:41,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:41,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:41:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:41:41,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:41:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:41:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:41:41,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:41:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:41:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:41:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:41,944 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-11 02:41:41,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:41,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843393328] [2024-10-11 02:41:41,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843393328] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:41:41,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636099858] [2024-10-11 02:41:41,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:41,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:41:41,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:41:41,947 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:41:41,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 02:41:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:42,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 899 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 02:41:42,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:41:42,268 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-11 02:41:42,269 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:41:42,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636099858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:42,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:41:42,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-11 02:41:42,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202710846] [2024-10-11 02:41:42,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:42,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:41:42,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:42,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:41:42,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:41:42,272 INFO L87 Difference]: Start difference. First operand 286 states and 448 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:41:42,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:42,410 INFO L93 Difference]: Finished difference Result 565 states and 889 transitions. [2024-10-11 02:41:42,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:41:42,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 98 [2024-10-11 02:41:42,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:42,414 INFO L225 Difference]: With dead ends: 565 [2024-10-11 02:41:42,414 INFO L226 Difference]: Without dead ends: 288 [2024-10-11 02:41:42,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:41:42,416 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 2 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:42,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1303 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:41:42,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-11 02:41:42,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-10-11 02:41:42,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 219 states have (on average 1.5799086757990868) internal successors, (346), 222 states have internal predecessors, (346), 51 states have call successors, (51), 15 states have call predecessors, (51), 17 states have return successors, (57), 50 states have call predecessors, (57), 50 states have call successors, (57) [2024-10-11 02:41:42,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 454 transitions. [2024-10-11 02:41:42,432 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 454 transitions. Word has length 98 [2024-10-11 02:41:42,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:42,433 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 454 transitions. [2024-10-11 02:41:42,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:41:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 454 transitions. [2024-10-11 02:41:42,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 02:41:42,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:42,436 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] [2024-10-11 02:41:42,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 02:41:42,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:41:42,637 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:42,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:42,638 INFO L85 PathProgramCache]: Analyzing trace with hash 2012801472, now seen corresponding path program 1 times [2024-10-11 02:41:42,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:42,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430474501] [2024-10-11 02:41:42,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:42,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:42,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:42,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:42,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:42,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:42,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:42,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:42,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:41:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:42,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:41:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:42,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:41:42,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:42,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:41:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:42,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:41:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:42,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:41:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:42,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:41:42,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:42,876 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-11 02:41:42,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:42,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430474501] [2024-10-11 02:41:42,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430474501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:42,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:42,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:41:42,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039972246] [2024-10-11 02:41:42,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:42,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:41:42,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:42,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:41:42,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:41:42,879 INFO L87 Difference]: Start difference. First operand 288 states and 454 transitions. Second operand has 9 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:41:44,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:44,511 INFO L93 Difference]: Finished difference Result 678 states and 1078 transitions. [2024-10-11 02:41:44,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:41:44,511 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 99 [2024-10-11 02:41:44,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:44,515 INFO L225 Difference]: With dead ends: 678 [2024-10-11 02:41:44,515 INFO L226 Difference]: Without dead ends: 409 [2024-10-11 02:41:44,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:41:44,517 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 646 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 2041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:44,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1015 Invalid, 2041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1800 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 02:41:44,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-10-11 02:41:44,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 288. [2024-10-11 02:41:44,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 219 states have (on average 1.5799086757990868) internal successors, (346), 222 states have internal predecessors, (346), 51 states have call successors, (51), 15 states have call predecessors, (51), 17 states have return successors, (56), 50 states have call predecessors, (56), 50 states have call successors, (56) [2024-10-11 02:41:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 453 transitions. [2024-10-11 02:41:44,548 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 453 transitions. Word has length 99 [2024-10-11 02:41:44,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:44,548 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 453 transitions. [2024-10-11 02:41:44,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:41:44,549 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 453 transitions. [2024-10-11 02:41:44,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 02:41:44,551 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:44,551 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] [2024-10-11 02:41:44,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:41:44,552 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:44,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:44,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1973452793, now seen corresponding path program 2 times [2024-10-11 02:41:44,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:44,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518415859] [2024-10-11 02:41:44,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:44,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:44,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:44,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:44,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:44,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:44,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:44,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:44,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:44,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:41:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:44,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:41:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:44,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:41:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:44,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:41:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:44,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:41:44,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:44,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:41:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:44,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:41:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:44,768 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-11 02:41:44,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:44,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518415859] [2024-10-11 02:41:44,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518415859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:44,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:44,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:41:44,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774503658] [2024-10-11 02:41:44,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:44,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:41:44,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:44,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:41:44,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:41:44,770 INFO L87 Difference]: Start difference. First operand 288 states and 453 transitions. Second operand has 9 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:41:46,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:46,296 INFO L93 Difference]: Finished difference Result 680 states and 1081 transitions. [2024-10-11 02:41:46,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:41:46,297 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 100 [2024-10-11 02:41:46,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:46,300 INFO L225 Difference]: With dead ends: 680 [2024-10-11 02:41:46,303 INFO L226 Difference]: Without dead ends: 411 [2024-10-11 02:41:46,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:41:46,305 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 642 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 2049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:46,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 1015 Invalid, 2049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 02:41:46,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-10-11 02:41:46,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 290. [2024-10-11 02:41:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 220 states have (on average 1.5772727272727274) internal successors, (347), 224 states have internal predecessors, (347), 51 states have call successors, (51), 15 states have call predecessors, (51), 18 states have return successors, (58), 50 states have call predecessors, (58), 50 states have call successors, (58) [2024-10-11 02:41:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 456 transitions. [2024-10-11 02:41:46,334 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 456 transitions. Word has length 100 [2024-10-11 02:41:46,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:46,334 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 456 transitions. [2024-10-11 02:41:46,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 02:41:46,334 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 456 transitions. [2024-10-11 02:41:46,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 02:41:46,336 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:46,338 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] [2024-10-11 02:41:46,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:41:46,338 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:46,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:46,338 INFO L85 PathProgramCache]: Analyzing trace with hash 2070118437, now seen corresponding path program 1 times [2024-10-11 02:41:46,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:46,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867408828] [2024-10-11 02:41:46,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:46,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:46,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:46,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:46,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:46,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:46,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:46,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:41:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:46,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:41:46,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:46,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:41:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:46,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:41:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:46,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:41:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:46,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:41:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:46,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:41:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:46,561 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-11 02:41:46,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:46,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867408828] [2024-10-11 02:41:46,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867408828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:46,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:46,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:41:46,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052748361] [2024-10-11 02:41:46,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:46,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:41:46,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:46,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:41:46,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:41:46,563 INFO L87 Difference]: Start difference. First operand 290 states and 456 transitions. Second operand has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 8 states have internal predecessors, (64), 4 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 02:41:48,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:48,512 INFO L93 Difference]: Finished difference Result 678 states and 1076 transitions. [2024-10-11 02:41:48,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:41:48,512 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 8 states have internal predecessors, (64), 4 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 101 [2024-10-11 02:41:48,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:48,515 INFO L225 Difference]: With dead ends: 678 [2024-10-11 02:41:48,515 INFO L226 Difference]: Without dead ends: 411 [2024-10-11 02:41:48,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:41:48,517 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 646 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 2944 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 3190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 2944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:48,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1408 Invalid, 3190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 2944 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 02:41:48,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-10-11 02:41:48,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 290. [2024-10-11 02:41:48,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 220 states have (on average 1.5772727272727274) internal successors, (347), 224 states have internal predecessors, (347), 51 states have call successors, (51), 15 states have call predecessors, (51), 18 states have return successors, (57), 50 states have call predecessors, (57), 50 states have call successors, (57) [2024-10-11 02:41:48,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 455 transitions. [2024-10-11 02:41:48,542 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 455 transitions. Word has length 101 [2024-10-11 02:41:48,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:48,542 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 455 transitions. [2024-10-11 02:41:48,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.818181818181818) internal successors, (64), 8 states have internal predecessors, (64), 4 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 02:41:48,542 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 455 transitions. [2024-10-11 02:41:48,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 02:41:48,544 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:48,544 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] [2024-10-11 02:41:48,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:41:48,545 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:48,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:48,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1582730148, now seen corresponding path program 2 times [2024-10-11 02:41:48,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:48,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097246] [2024-10-11 02:41:48,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:48,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:41:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:41:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:41:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:41:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:41:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:41:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:41:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:48,764 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-11 02:41:48,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:48,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097246] [2024-10-11 02:41:48,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:48,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:48,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:41:48,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884468963] [2024-10-11 02:41:48,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:48,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:41:48,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:48,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:41:48,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:41:48,766 INFO L87 Difference]: Start difference. First operand 290 states and 455 transitions. Second operand has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 02:41:50,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:50,566 INFO L93 Difference]: Finished difference Result 680 states and 1082 transitions. [2024-10-11 02:41:50,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:41:50,567 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 102 [2024-10-11 02:41:50,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:50,570 INFO L225 Difference]: With dead ends: 680 [2024-10-11 02:41:50,570 INFO L226 Difference]: Without dead ends: 413 [2024-10-11 02:41:50,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:41:50,572 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 642 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 2975 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 3219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 2975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:50,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 1409 Invalid, 3219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 2975 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 02:41:50,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-11 02:41:50,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 292. [2024-10-11 02:41:50,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 221 states have (on average 1.5746606334841629) internal successors, (348), 226 states have internal predecessors, (348), 51 states have call successors, (51), 15 states have call predecessors, (51), 19 states have return successors, (62), 50 states have call predecessors, (62), 50 states have call successors, (62) [2024-10-11 02:41:50,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 461 transitions. [2024-10-11 02:41:50,609 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 461 transitions. Word has length 102 [2024-10-11 02:41:50,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:50,609 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 461 transitions. [2024-10-11 02:41:50,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.909090909090909) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 02:41:50,610 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 461 transitions. [2024-10-11 02:41:50,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 02:41:50,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:50,612 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] [2024-10-11 02:41:50,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:41:50,612 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:50,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:50,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1684896438, now seen corresponding path program 1 times [2024-10-11 02:41:50,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:50,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436918493] [2024-10-11 02:41:50,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:50,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:50,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:50,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:41:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:41:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:41:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:41:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:41:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:41:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:41:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:50,848 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 02:41:50,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:50,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436918493] [2024-10-11 02:41:50,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436918493] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:41:50,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185306933] [2024-10-11 02:41:50,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:50,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:41:50,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:41:50,851 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:41:50,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 02:41:51,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:51,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:41:51,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:41:51,128 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-11 02:41:51,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:41:51,212 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-11 02:41:51,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185306933] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:41:51,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:41:51,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-10-11 02:41:51,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961315815] [2024-10-11 02:41:51,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:41:51,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 02:41:51,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:51,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 02:41:51,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:41:51,217 INFO L87 Difference]: Start difference. First operand 292 states and 461 transitions. Second operand has 15 states, 14 states have (on average 7.5) internal successors, (105), 11 states have internal predecessors, (105), 4 states have call successors, (30), 6 states have call predecessors, (30), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2024-10-11 02:41:53,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:53,520 INFO L93 Difference]: Finished difference Result 1029 states and 1728 transitions. [2024-10-11 02:41:53,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 02:41:53,521 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.5) internal successors, (105), 11 states have internal predecessors, (105), 4 states have call successors, (30), 6 states have call predecessors, (30), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 103 [2024-10-11 02:41:53,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:53,526 INFO L225 Difference]: With dead ends: 1029 [2024-10-11 02:41:53,526 INFO L226 Difference]: Without dead ends: 763 [2024-10-11 02:41:53,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2024-10-11 02:41:53,529 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1575 mSDsluCounter, 1520 mSDsCounter, 0 mSdLazyCounter, 3428 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1593 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 3958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 3428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:53,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1593 Valid, 1685 Invalid, 3958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 3428 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 02:41:53,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2024-10-11 02:41:53,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 627. [2024-10-11 02:41:53,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 492 states have (on average 1.6280487804878048) internal successors, (801), 497 states have internal predecessors, (801), 115 states have call successors, (115), 15 states have call predecessors, (115), 19 states have return successors, (136), 114 states have call predecessors, (136), 114 states have call successors, (136) [2024-10-11 02:41:53,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 1052 transitions. [2024-10-11 02:41:53,566 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 1052 transitions. Word has length 103 [2024-10-11 02:41:53,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:53,566 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 1052 transitions. [2024-10-11 02:41:53,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.5) internal successors, (105), 11 states have internal predecessors, (105), 4 states have call successors, (30), 6 states have call predecessors, (30), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2024-10-11 02:41:53,567 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 1052 transitions. [2024-10-11 02:41:53,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 02:41:53,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:53,570 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] [2024-10-11 02:41:53,589 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 02:41:53,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 02:41:53,771 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:53,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:53,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1339410134, now seen corresponding path program 1 times [2024-10-11 02:41:53,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:53,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111451777] [2024-10-11 02:41:53,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:53,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:53,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:53,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:53,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:53,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:53,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:53,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:53,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:53,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:41:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:53,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:41:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:53,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:41:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:53,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:41:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:53,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:41:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:53,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:41:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:53,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:41:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:53,884 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-11 02:41:53,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:53,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111451777] [2024-10-11 02:41:53,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111451777] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:53,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:53,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:41:53,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633701879] [2024-10-11 02:41:53,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:53,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:41:53,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:53,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:41:53,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:41:53,886 INFO L87 Difference]: Start difference. First operand 627 states and 1052 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:41:54,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:54,985 INFO L93 Difference]: Finished difference Result 1624 states and 2787 transitions. [2024-10-11 02:41:54,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:41:54,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2024-10-11 02:41:54,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:54,993 INFO L225 Difference]: With dead ends: 1624 [2024-10-11 02:41:54,996 INFO L226 Difference]: Without dead ends: 1065 [2024-10-11 02:41:54,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:41:54,999 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 748 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 764 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:54,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [764 Valid, 783 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:41:55,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2024-10-11 02:41:55,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 939. [2024-10-11 02:41:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 939 states, 740 states have (on average 1.6391891891891892) internal successors, (1213), 745 states have internal predecessors, (1213), 179 states have call successors, (179), 15 states have call predecessors, (179), 19 states have return successors, (210), 178 states have call predecessors, (210), 178 states have call successors, (210) [2024-10-11 02:41:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 939 states to 939 states and 1602 transitions. [2024-10-11 02:41:55,059 INFO L78 Accepts]: Start accepts. Automaton has 939 states and 1602 transitions. Word has length 107 [2024-10-11 02:41:55,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:55,059 INFO L471 AbstractCegarLoop]: Abstraction has 939 states and 1602 transitions. [2024-10-11 02:41:55,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:41:55,059 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states and 1602 transitions. [2024-10-11 02:41:55,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 02:41:55,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:55,064 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] [2024-10-11 02:41:55,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:41:55,064 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:55,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:55,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1124666228, now seen corresponding path program 1 times [2024-10-11 02:41:55,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:55,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633856411] [2024-10-11 02:41:55,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:55,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:55,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:55,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:55,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:55,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:55,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:55,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:41:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:55,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:41:55,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:55,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:41:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:55,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:41:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:55,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:41:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:55,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:41:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:55,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:41:55,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:55,167 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-11 02:41:55,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:55,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633856411] [2024-10-11 02:41:55,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633856411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:55,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:55,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:41:55,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651988698] [2024-10-11 02:41:55,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:55,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:41:55,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:55,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:41:55,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:41:55,170 INFO L87 Difference]: Start difference. First operand 939 states and 1602 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:41:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:56,389 INFO L93 Difference]: Finished difference Result 2393 states and 4135 transitions. [2024-10-11 02:41:56,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:41:56,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-10-11 02:41:56,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:56,403 INFO L225 Difference]: With dead ends: 2393 [2024-10-11 02:41:56,404 INFO L226 Difference]: Without dead ends: 1572 [2024-10-11 02:41:56,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:41:56,409 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 744 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:56,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [759 Valid, 745 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:41:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2024-10-11 02:41:56,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1446. [2024-10-11 02:41:56,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1446 states, 1152 states have (on average 1.6432291666666667) internal successors, (1893), 1157 states have internal predecessors, (1893), 274 states have call successors, (274), 15 states have call predecessors, (274), 19 states have return successors, (305), 273 states have call predecessors, (305), 273 states have call successors, (305) [2024-10-11 02:41:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 2472 transitions. [2024-10-11 02:41:56,525 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 2472 transitions. Word has length 108 [2024-10-11 02:41:56,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:56,526 INFO L471 AbstractCegarLoop]: Abstraction has 1446 states and 2472 transitions. [2024-10-11 02:41:56,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:41:56,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 2472 transitions. [2024-10-11 02:41:56,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 02:41:56,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:56,534 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] [2024-10-11 02:41:56,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:41:56,535 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:56,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:56,535 INFO L85 PathProgramCache]: Analyzing trace with hash -2103438152, now seen corresponding path program 1 times [2024-10-11 02:41:56,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:56,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779584633] [2024-10-11 02:41:56,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:56,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:56,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:56,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:56,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:56,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:56,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:56,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:41:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:56,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:41:56,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:56,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:41:56,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:56,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:41:56,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:56,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:41:56,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:56,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:41:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:56,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:41:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:56,663 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-11 02:41:56,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:56,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779584633] [2024-10-11 02:41:56,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779584633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:56,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:56,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:41:56,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627481964] [2024-10-11 02:41:56,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:56,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:41:56,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:56,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:41:56,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:41:56,667 INFO L87 Difference]: Start difference. First operand 1446 states and 2472 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:41:57,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:57,796 INFO L93 Difference]: Finished difference Result 3539 states and 6160 transitions. [2024-10-11 02:41:57,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:41:57,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 109 [2024-10-11 02:41:57,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:57,812 INFO L225 Difference]: With dead ends: 3539 [2024-10-11 02:41:57,812 INFO L226 Difference]: Without dead ends: 2339 [2024-10-11 02:41:57,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:41:57,819 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 745 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 761 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:57,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [761 Valid, 736 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:41:57,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2339 states. [2024-10-11 02:41:57,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2339 to 2213. [2024-10-11 02:41:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2213 states, 1796 states have (on average 1.6469933184855234) internal successors, (2958), 1801 states have internal predecessors, (2958), 397 states have call successors, (397), 15 states have call predecessors, (397), 19 states have return successors, (444), 396 states have call predecessors, (444), 396 states have call successors, (444) [2024-10-11 02:41:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2213 states to 2213 states and 3799 transitions. [2024-10-11 02:41:57,940 INFO L78 Accepts]: Start accepts. Automaton has 2213 states and 3799 transitions. Word has length 109 [2024-10-11 02:41:57,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:57,941 INFO L471 AbstractCegarLoop]: Abstraction has 2213 states and 3799 transitions. [2024-10-11 02:41:57,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:41:57,941 INFO L276 IsEmpty]: Start isEmpty. Operand 2213 states and 3799 transitions. [2024-10-11 02:41:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 02:41:57,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:57,950 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] [2024-10-11 02:41:57,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:41:57,950 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:57,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:57,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1467582229, now seen corresponding path program 1 times [2024-10-11 02:41:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:57,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544236905] [2024-10-11 02:41:57,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:57,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:58,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:58,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:58,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:58,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:58,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:58,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:41:58,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:58,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:41:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:58,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:41:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:58,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:41:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:58,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:41:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:58,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:41:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:58,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:41:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:58,058 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-11 02:41:58,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:58,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544236905] [2024-10-11 02:41:58,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544236905] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:58,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:58,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:41:58,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587305712] [2024-10-11 02:41:58,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:58,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:41:58,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:58,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:41:58,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:41:58,060 INFO L87 Difference]: Start difference. First operand 2213 states and 3799 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:41:59,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:41:59,109 INFO L93 Difference]: Finished difference Result 5321 states and 9318 transitions. [2024-10-11 02:41:59,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:41:59,110 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-10-11 02:41:59,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:41:59,131 INFO L225 Difference]: With dead ends: 5321 [2024-10-11 02:41:59,132 INFO L226 Difference]: Without dead ends: 3563 [2024-10-11 02:41:59,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:41:59,141 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 740 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:41:59,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 737 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 02:41:59,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3563 states. [2024-10-11 02:41:59,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3563 to 3437. [2024-10-11 02:41:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3437 states, 2841 states have (on average 1.6494192185850052) internal successors, (4686), 2846 states have internal predecessors, (4686), 576 states have call successors, (576), 15 states have call predecessors, (576), 19 states have return successors, (649), 575 states have call predecessors, (649), 575 states have call successors, (649) [2024-10-11 02:41:59,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3437 states to 3437 states and 5911 transitions. [2024-10-11 02:41:59,345 INFO L78 Accepts]: Start accepts. Automaton has 3437 states and 5911 transitions. Word has length 110 [2024-10-11 02:41:59,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:41:59,346 INFO L471 AbstractCegarLoop]: Abstraction has 3437 states and 5911 transitions. [2024-10-11 02:41:59,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:41:59,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3437 states and 5911 transitions. [2024-10-11 02:41:59,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 02:41:59,357 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:41:59,357 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] [2024-10-11 02:41:59,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:41:59,358 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:41:59,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:41:59,358 INFO L85 PathProgramCache]: Analyzing trace with hash -701568396, now seen corresponding path program 1 times [2024-10-11 02:41:59,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:41:59,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522243798] [2024-10-11 02:41:59,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:41:59,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:41:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:41:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:41:59,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:41:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:41:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:41:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:41:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:41:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:41:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:41:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:41:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:41:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:41:59,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:41:59,466 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-11 02:41:59,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:41:59,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522243798] [2024-10-11 02:41:59,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522243798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:41:59,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:41:59,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:41:59,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038180226] [2024-10-11 02:41:59,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:41:59,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:41:59,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:41:59,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:41:59,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:41:59,468 INFO L87 Difference]: Start difference. First operand 3437 states and 5911 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:42:00,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:42:00,694 INFO L93 Difference]: Finished difference Result 8300 states and 14558 transitions. [2024-10-11 02:42:00,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:42:00,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 111 [2024-10-11 02:42:00,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:42:00,730 INFO L225 Difference]: With dead ends: 8300 [2024-10-11 02:42:00,730 INFO L226 Difference]: Without dead ends: 5621 [2024-10-11 02:42:00,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:42:00,745 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 739 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 755 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:42:00,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [755 Valid, 770 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:42:00,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5621 states. [2024-10-11 02:42:01,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5621 to 5495. [2024-10-11 02:42:01,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5495 states, 4523 states have (on average 1.6380720760557153) internal successors, (7409), 4528 states have internal predecessors, (7409), 952 states have call successors, (952), 15 states have call predecessors, (952), 19 states have return successors, (1069), 951 states have call predecessors, (1069), 951 states have call successors, (1069) [2024-10-11 02:42:01,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5495 states to 5495 states and 9430 transitions. [2024-10-11 02:42:01,058 INFO L78 Accepts]: Start accepts. Automaton has 5495 states and 9430 transitions. Word has length 111 [2024-10-11 02:42:01,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:42:01,059 INFO L471 AbstractCegarLoop]: Abstraction has 5495 states and 9430 transitions. [2024-10-11 02:42:01,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:42:01,059 INFO L276 IsEmpty]: Start isEmpty. Operand 5495 states and 9430 transitions. [2024-10-11 02:42:01,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 02:42:01,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:42:01,072 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] [2024-10-11 02:42:01,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:42:01,072 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:42:01,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:42:01,072 INFO L85 PathProgramCache]: Analyzing trace with hash -927091367, now seen corresponding path program 1 times [2024-10-11 02:42:01,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:42:01,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124573181] [2024-10-11 02:42:01,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:42:01,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:42:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:01,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:42:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:01,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:42:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:01,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:42:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:01,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:42:01,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:01,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:42:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:01,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:42:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:01,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:42:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:01,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:42:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:01,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:42:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:01,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:42:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:01,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:42:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:01,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:42:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:01,174 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-11 02:42:01,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:42:01,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124573181] [2024-10-11 02:42:01,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124573181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:42:01,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:42:01,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:42:01,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530445305] [2024-10-11 02:42:01,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:42:01,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:42:01,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:42:01,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:42:01,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:42:01,176 INFO L87 Difference]: Start difference. First operand 5495 states and 9430 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:42:02,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:42:02,296 INFO L93 Difference]: Finished difference Result 13661 states and 23915 transitions. [2024-10-11 02:42:02,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:42:02,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2024-10-11 02:42:02,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:42:02,396 INFO L225 Difference]: With dead ends: 13661 [2024-10-11 02:42:02,396 INFO L226 Difference]: Without dead ends: 9310 [2024-10-11 02:42:02,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:42:02,413 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 736 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 1065 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:42:02,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 744 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1065 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 02:42:02,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9310 states. [2024-10-11 02:42:02,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9310 to 9184. [2024-10-11 02:42:02,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9184 states, 7606 states have (on average 1.6354194057323166) internal successors, (12439), 7611 states have internal predecessors, (12439), 1558 states have call successors, (1558), 15 states have call predecessors, (1558), 19 states have return successors, (1753), 1557 states have call predecessors, (1753), 1557 states have call successors, (1753) [2024-10-11 02:42:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9184 states to 9184 states and 15750 transitions. [2024-10-11 02:42:02,918 INFO L78 Accepts]: Start accepts. Automaton has 9184 states and 15750 transitions. Word has length 112 [2024-10-11 02:42:02,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:42:02,919 INFO L471 AbstractCegarLoop]: Abstraction has 9184 states and 15750 transitions. [2024-10-11 02:42:02,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:42:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 9184 states and 15750 transitions. [2024-10-11 02:42:02,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 02:42:02,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:42:02,939 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] [2024-10-11 02:42:02,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:42:02,939 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:42:02,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:42:02,940 INFO L85 PathProgramCache]: Analyzing trace with hash 485830754, now seen corresponding path program 1 times [2024-10-11 02:42:02,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:42:02,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226837198] [2024-10-11 02:42:02,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:42:02,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:42:02,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:03,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:42:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:03,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:42:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:03,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:42:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:03,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:42:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:03,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:42:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:03,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:42:03,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:03,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:42:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:03,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:42:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:03,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:42:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:03,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:42:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:03,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:42:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:03,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:42:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:03,056 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-11 02:42:03,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:42:03,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226837198] [2024-10-11 02:42:03,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226837198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:42:03,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:42:03,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:42:03,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318556620] [2024-10-11 02:42:03,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:42:03,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:42:03,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:42:03,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:42:03,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:42:03,059 INFO L87 Difference]: Start difference. First operand 9184 states and 15750 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:42:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:42:04,276 INFO L93 Difference]: Finished difference Result 23853 states and 41679 transitions. [2024-10-11 02:42:04,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:42:04,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2024-10-11 02:42:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:42:04,356 INFO L225 Difference]: With dead ends: 23853 [2024-10-11 02:42:04,356 INFO L226 Difference]: Without dead ends: 16270 [2024-10-11 02:42:04,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:42:04,477 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 735 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 1070 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 750 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 1070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:42:04,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [750 Valid, 760 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 1070 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 02:42:04,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16270 states. [2024-10-11 02:42:05,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16270 to 16144. [2024-10-11 02:42:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16144 states, 13363 states have (on average 1.626281523609968) internal successors, (21732), 13368 states have internal predecessors, (21732), 2761 states have call successors, (2761), 15 states have call predecessors, (2761), 19 states have return successors, (3100), 2760 states have call predecessors, (3100), 2760 states have call successors, (3100) [2024-10-11 02:42:05,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16144 states to 16144 states and 27593 transitions. [2024-10-11 02:42:05,196 INFO L78 Accepts]: Start accepts. Automaton has 16144 states and 27593 transitions. Word has length 113 [2024-10-11 02:42:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:42:05,197 INFO L471 AbstractCegarLoop]: Abstraction has 16144 states and 27593 transitions. [2024-10-11 02:42:05,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:42:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 16144 states and 27593 transitions. [2024-10-11 02:42:05,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 02:42:05,219 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:42:05,219 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] [2024-10-11 02:42:05,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 02:42:05,219 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:42:05,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:42:05,220 INFO L85 PathProgramCache]: Analyzing trace with hash 626860570, now seen corresponding path program 1 times [2024-10-11 02:42:05,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:42:05,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910874442] [2024-10-11 02:42:05,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:42:05,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:42:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:05,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:42:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:05,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:42:05,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:05,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:42:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:05,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:42:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:05,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:42:05,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:05,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:42:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:05,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:42:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:05,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:42:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:05,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:42:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:05,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:42:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:05,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:42:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:05,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:42:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:05,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-11 02:42:05,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:42:05,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910874442] [2024-10-11 02:42:05,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910874442] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:42:05,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:42:05,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:42:05,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811768940] [2024-10-11 02:42:05,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:42:05,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:42:05,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:42:05,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:42:05,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:42:05,331 INFO L87 Difference]: Start difference. First operand 16144 states and 27593 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:42:07,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:42:07,118 INFO L93 Difference]: Finished difference Result 42828 states and 74691 transitions. [2024-10-11 02:42:07,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:42:07,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2024-10-11 02:42:07,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:42:07,263 INFO L225 Difference]: With dead ends: 42828 [2024-10-11 02:42:07,263 INFO L226 Difference]: Without dead ends: 28933 [2024-10-11 02:42:07,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:42:07,321 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 733 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:42:07,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 738 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:42:07,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28933 states. [2024-10-11 02:42:08,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28933 to 28807. [2024-10-11 02:42:08,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28807 states, 23987 states have (on average 1.6224621670071289) internal successors, (38918), 23992 states have internal predecessors, (38918), 4800 states have call successors, (4800), 15 states have call predecessors, (4800), 19 states have return successors, (5413), 4799 states have call predecessors, (5413), 4799 states have call successors, (5413) [2024-10-11 02:42:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28807 states to 28807 states and 49131 transitions. [2024-10-11 02:42:08,719 INFO L78 Accepts]: Start accepts. Automaton has 28807 states and 49131 transitions. Word has length 114 [2024-10-11 02:42:08,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:42:08,721 INFO L471 AbstractCegarLoop]: Abstraction has 28807 states and 49131 transitions. [2024-10-11 02:42:08,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:42:08,721 INFO L276 IsEmpty]: Start isEmpty. Operand 28807 states and 49131 transitions. [2024-10-11 02:42:08,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 02:42:08,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:42:08,749 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] [2024-10-11 02:42:08,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 02:42:08,749 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:42:08,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:42:08,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1306552260, now seen corresponding path program 1 times [2024-10-11 02:42:08,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:42:08,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553201449] [2024-10-11 02:42:08,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:42:08,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:42:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:08,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:42:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:08,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:42:08,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:08,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:42:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:08,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:42:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:08,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:42:08,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:08,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:42:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:08,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:42:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:08,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:42:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:08,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:42:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:08,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:42:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:08,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:42:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:08,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:42:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:08,869 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-11 02:42:08,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:42:08,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553201449] [2024-10-11 02:42:08,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553201449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:42:08,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:42:08,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:42:08,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620180873] [2024-10-11 02:42:08,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:42:08,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:42:08,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:42:08,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:42:08,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:42:08,873 INFO L87 Difference]: Start difference. First operand 28807 states and 49131 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:42:11,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:42:11,250 INFO L93 Difference]: Finished difference Result 78600 states and 136250 transitions. [2024-10-11 02:42:11,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:42:11,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2024-10-11 02:42:11,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:42:11,546 INFO L225 Difference]: With dead ends: 78600 [2024-10-11 02:42:11,546 INFO L226 Difference]: Without dead ends: 52821 [2024-10-11 02:42:11,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:42:11,639 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 733 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:42:11,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 737 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 02:42:11,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52821 states. [2024-10-11 02:42:13,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52821 to 52695. [2024-10-11 02:42:14,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52695 states, 44160 states have (on average 1.617481884057971) internal successors, (71428), 44165 states have internal predecessors, (71428), 8515 states have call successors, (8515), 15 states have call predecessors, (8515), 19 states have return successors, (9660), 8514 states have call predecessors, (9660), 8514 states have call successors, (9660) [2024-10-11 02:42:14,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52695 states to 52695 states and 89603 transitions. [2024-10-11 02:42:14,268 INFO L78 Accepts]: Start accepts. Automaton has 52695 states and 89603 transitions. Word has length 115 [2024-10-11 02:42:14,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:42:14,269 INFO L471 AbstractCegarLoop]: Abstraction has 52695 states and 89603 transitions. [2024-10-11 02:42:14,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:42:14,270 INFO L276 IsEmpty]: Start isEmpty. Operand 52695 states and 89603 transitions. [2024-10-11 02:42:14,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 02:42:14,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:42:14,302 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] [2024-10-11 02:42:14,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 02:42:14,303 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:42:14,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:42:14,303 INFO L85 PathProgramCache]: Analyzing trace with hash 811312570, now seen corresponding path program 1 times [2024-10-11 02:42:14,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:42:14,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974483819] [2024-10-11 02:42:14,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:42:14,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:42:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:14,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:42:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:14,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:42:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:14,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:42:14,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:14,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:42:14,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:14,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:42:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:14,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:42:14,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:14,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:42:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:14,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:42:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:14,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:42:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:14,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:42:14,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:14,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:42:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:14,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:42:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:14,757 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-11 02:42:14,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:42:14,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974483819] [2024-10-11 02:42:14,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974483819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:42:14,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:42:14,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:42:14,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488841757] [2024-10-11 02:42:14,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:42:14,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:42:14,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:42:14,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:42:14,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:42:14,759 INFO L87 Difference]: Start difference. First operand 52695 states and 89603 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:42:17,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:42:17,930 INFO L93 Difference]: Finished difference Result 98375 states and 170955 transitions. [2024-10-11 02:42:17,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:42:17,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2024-10-11 02:42:17,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:42:18,408 INFO L225 Difference]: With dead ends: 98375 [2024-10-11 02:42:18,408 INFO L226 Difference]: Without dead ends: 98293 [2024-10-11 02:42:18,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:42:18,475 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 726 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:42:18,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 747 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:42:18,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98293 states. [2024-10-11 02:42:21,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98293 to 98167. [2024-10-11 02:42:22,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98167 states, 82833 states have (on average 1.611157388963336) internal successors, (133457), 82838 states have internal predecessors, (133457), 15314 states have call successors, (15314), 15 states have call predecessors, (15314), 19 states have return successors, (17505), 15313 states have call predecessors, (17505), 15313 states have call successors, (17505) [2024-10-11 02:42:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98167 states to 98167 states and 166276 transitions. [2024-10-11 02:42:23,141 INFO L78 Accepts]: Start accepts. Automaton has 98167 states and 166276 transitions. Word has length 116 [2024-10-11 02:42:23,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:42:23,142 INFO L471 AbstractCegarLoop]: Abstraction has 98167 states and 166276 transitions. [2024-10-11 02:42:23,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (14), 6 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 02:42:23,142 INFO L276 IsEmpty]: Start isEmpty. Operand 98167 states and 166276 transitions. [2024-10-11 02:42:23,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 02:42:23,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:42:23,177 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-11 02:42:23,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 02:42:23,177 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:42:23,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:42:23,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1721260413, now seen corresponding path program 1 times [2024-10-11 02:42:23,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:42:23,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589994516] [2024-10-11 02:42:23,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:42:23,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:42:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:23,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:42:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:23,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:42:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:23,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:42:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:23,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:42:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:23,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:42:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:23,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:42:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:23,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:42:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:23,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:42:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:23,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:42:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:23,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:42:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:23,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:42:23,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:23,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 02:42:23,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:42:23,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:42:23,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589994516] [2024-10-11 02:42:23,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589994516] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:42:23,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73852359] [2024-10-11 02:42:23,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:42:23,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:42:23,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:42:23,650 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:42:23,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 02:42:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:23,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 943 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 02:42:23,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:42:24,179 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 02:42:24,180 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:42:24,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73852359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:42:24,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:42:24,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18] total 27 [2024-10-11 02:42:24,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445020456] [2024-10-11 02:42:24,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:42:24,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:42:24,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:42:24,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:42:24,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2024-10-11 02:42:24,182 INFO L87 Difference]: Start difference. First operand 98167 states and 166276 transitions. Second operand has 11 states, 10 states have (on average 8.5) internal successors, (85), 9 states have internal predecessors, (85), 5 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-11 02:42:26,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:42:26,859 INFO L93 Difference]: Finished difference Result 98351 states and 166524 transitions. [2024-10-11 02:42:26,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:42:26,859 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 9 states have internal predecessors, (85), 5 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 117 [2024-10-11 02:42:26,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:42:27,297 INFO L225 Difference]: With dead ends: 98351 [2024-10-11 02:42:27,298 INFO L226 Difference]: Without dead ends: 98274 [2024-10-11 02:42:27,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=1246, Unknown=0, NotChecked=0, Total=1406 [2024-10-11 02:42:27,339 INFO L432 NwaCegarLoop]: 358 mSDtfsCounter, 443 mSDsluCounter, 2751 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 3109 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:42:27,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 3109 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 02:42:27,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98274 states. [2024-10-11 02:42:30,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98274 to 98258. [2024-10-11 02:42:30,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98258 states, 82900 states have (on average 1.6109891435464414) internal successors, (133551), 82905 states have internal predecessors, (133551), 15327 states have call successors, (15327), 24 states have call predecessors, (15327), 30 states have return successors, (17522), 15328 states have call predecessors, (17522), 15325 states have call successors, (17522) [2024-10-11 02:42:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98258 states to 98258 states and 166400 transitions. [2024-10-11 02:42:31,228 INFO L78 Accepts]: Start accepts. Automaton has 98258 states and 166400 transitions. Word has length 117 [2024-10-11 02:42:31,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:42:31,228 INFO L471 AbstractCegarLoop]: Abstraction has 98258 states and 166400 transitions. [2024-10-11 02:42:31,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.5) internal successors, (85), 9 states have internal predecessors, (85), 5 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-11 02:42:31,229 INFO L276 IsEmpty]: Start isEmpty. Operand 98258 states and 166400 transitions. [2024-10-11 02:42:31,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 02:42:31,265 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:42:31,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] [2024-10-11 02:42:31,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 02:42:31,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:42:31,471 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:42:31,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:42:31,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1466214566, now seen corresponding path program 1 times [2024-10-11 02:42:31,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:42:31,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017665514] [2024-10-11 02:42:31,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:42:31,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:42:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:31,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:42:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:31,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:42:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:31,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:42:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:31,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:42:31,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:31,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:42:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:31,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:42:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:31,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:42:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:31,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:42:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:31,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:42:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:31,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:42:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:31,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:42:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:31,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:42:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:42:31,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:42:31,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017665514] [2024-10-11 02:42:31,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017665514] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:42:31,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832124559] [2024-10-11 02:42:31,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:42:31,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:42:31,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:42:31,936 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:42:31,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 02:42:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:32,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 944 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-11 02:42:32,181 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:42:32,432 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-10-11 02:42:32,432 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:42:32,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832124559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:42:32,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:42:32,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [19] total 29 [2024-10-11 02:42:32,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342921990] [2024-10-11 02:42:32,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:42:32,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:42:32,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:42:32,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:42:32,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2024-10-11 02:42:32,434 INFO L87 Difference]: Start difference. First operand 98258 states and 166400 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-11 02:42:35,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:42:35,196 INFO L93 Difference]: Finished difference Result 98447 states and 166671 transitions. [2024-10-11 02:42:35,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 02:42:35,197 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 118 [2024-10-11 02:42:35,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:42:35,707 INFO L225 Difference]: With dead ends: 98447 [2024-10-11 02:42:35,707 INFO L226 Difference]: Without dead ends: 98293 [2024-10-11 02:42:35,758 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=1610, Unknown=0, NotChecked=0, Total=1806 [2024-10-11 02:42:35,759 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 489 mSDsluCounter, 3127 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 3487 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:42:35,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 3487 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:42:35,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98293 states. [2024-10-11 02:42:39,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98293 to 98273. [2024-10-11 02:42:39,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98273 states, 82911 states have (on average 1.6109442655377453) internal successors, (133565), 82915 states have internal predecessors, (133565), 15331 states have call successors, (15331), 24 states have call predecessors, (15331), 30 states have return successors, (17527), 15333 states have call predecessors, (17527), 15329 states have call successors, (17527) [2024-10-11 02:42:39,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98273 states to 98273 states and 166423 transitions. [2024-10-11 02:42:39,781 INFO L78 Accepts]: Start accepts. Automaton has 98273 states and 166423 transitions. Word has length 118 [2024-10-11 02:42:39,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:42:39,781 INFO L471 AbstractCegarLoop]: Abstraction has 98273 states and 166423 transitions. [2024-10-11 02:42:39,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 10 states have internal predecessors, (86), 5 states have call successors, (14), 5 states have call predecessors, (14), 6 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2024-10-11 02:42:39,782 INFO L276 IsEmpty]: Start isEmpty. Operand 98273 states and 166423 transitions. [2024-10-11 02:42:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 02:42:39,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:42:39,814 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-11 02:42:39,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 02:42:40,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-11 02:42:40,015 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:42:40,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:42:40,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1816707506, now seen corresponding path program 1 times [2024-10-11 02:42:40,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:42:40,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864726033] [2024-10-11 02:42:40,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:42:40,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:42:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:40,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:42:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:40,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:42:40,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:40,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:42:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:40,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:42:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:40,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:42:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:40,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:42:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:40,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:42:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:40,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:42:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:40,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:42:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:40,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:42:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:40,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:42:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:40,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:42:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:42:40,293 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-11 02:42:40,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:42:40,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864726033] [2024-10-11 02:42:40,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864726033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:42:40,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:42:40,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 02:42:40,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405284453] [2024-10-11 02:42:40,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:42:40,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 02:42:40,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:42:40,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 02:42:40,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:42:40,297 INFO L87 Difference]: Start difference. First operand 98273 states and 166423 transitions. Second operand has 13 states, 11 states have (on average 6.909090909090909) internal successors, (76), 8 states have internal predecessors, (76), 6 states have call successors, (14), 6 states have call predecessors, (14), 2 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12)