./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_spec27_product13.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_spec27_product13.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 102266cd9873aec631509424dd889c2e48b781667738cfaa50930481a41b1570 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:45:40,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:45:40,556 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:45:40,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:45:40,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:45:40,596 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:45:40,597 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:45:40,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:45:40,598 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:45:40,598 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:45:40,602 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:45:40,602 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:45:40,603 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:45:40,603 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:45:40,603 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:45:40,604 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:45:40,604 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:45:40,604 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:45:40,604 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:45:40,605 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:45:40,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:45:40,611 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:45:40,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:45:40,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:45:40,612 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:45:40,612 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:45:40,612 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:45:40,613 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:45:40,613 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:45:40,613 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:45:40,613 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:45:40,613 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:45:40,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:45:40,614 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:45:40,614 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:45:40,614 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:45:40,614 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:45:40,614 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:45:40,615 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:45:40,615 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:45:40,621 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:45:40,622 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:45:40,622 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 -> 102266cd9873aec631509424dd889c2e48b781667738cfaa50930481a41b1570 [2024-10-11 02:45:41,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:45:41,025 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:45:41,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:45:41,028 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:45:41,028 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:45:41,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product13.cil.c [2024-10-11 02:45:42,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:45:42,596 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:45:42,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product13.cil.c [2024-10-11 02:45:42,643 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8ec5a4d34/6b546caed8204978a6475a6af3b8643c/FLAG91152cf41 [2024-10-11 02:45:42,663 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8ec5a4d34/6b546caed8204978a6475a6af3b8643c [2024-10-11 02:45:42,666 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:45:42,668 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:45:42,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:45:42,672 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:45:42,678 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:45:42,679 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:45:42" (1/1) ... [2024-10-11 02:45:42,680 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3447fe24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:42, skipping insertion in model container [2024-10-11 02:45:42,680 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:45:42" (1/1) ... [2024-10-11 02:45:42,774 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:45:43,147 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_spec27_product13.cil.c[61687,61700] [2024-10-11 02:45:43,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:45:43,166 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:45:43,175 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2024-10-11 02:45:43,177 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [66] [2024-10-11 02:45:43,177 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [432] [2024-10-11 02:45:43,177 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [481] [2024-10-11 02:45:43,177 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [588] [2024-10-11 02:45:43,177 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [855] [2024-10-11 02:45:43,178 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1930] [2024-10-11 02:45:43,178 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [2204] [2024-10-11 02:45:43,178 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2236] [2024-10-11 02:45:43,178 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2637] [2024-10-11 02:45:43,179 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2850] [2024-10-11 02:45:43,301 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_spec27_product13.cil.c[61687,61700] [2024-10-11 02:45:43,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:45:43,330 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:45:43,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:43 WrapperNode [2024-10-11 02:45:43,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:45:43,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:45:43,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:45:43,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:45:43,338 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:45:43" (1/1) ... [2024-10-11 02:45:43,373 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:45:43" (1/1) ... [2024-10-11 02:45:43,423 INFO L138 Inliner]: procedures = 124, calls = 178, calls flagged for inlining = 52, calls inlined = 44, statements flattened = 825 [2024-10-11 02:45:43,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:45:43,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:45:43,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:45:43,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:45:43,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:43" (1/1) ... [2024-10-11 02:45:43,437 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:43" (1/1) ... [2024-10-11 02:45:43,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:43" (1/1) ... [2024-10-11 02:45:43,465 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:45:43,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:43" (1/1) ... [2024-10-11 02:45:43,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:43" (1/1) ... [2024-10-11 02:45:43,481 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:43" (1/1) ... [2024-10-11 02:45:43,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:43" (1/1) ... [2024-10-11 02:45:43,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:43" (1/1) ... [2024-10-11 02:45:43,495 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:43" (1/1) ... [2024-10-11 02:45:43,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:45:43,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:45:43,507 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:45:43,507 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:45:43,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:43" (1/1) ... [2024-10-11 02:45:43,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:45:43,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:45:43,547 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:45:43,550 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:45:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-11 02:45:43,597 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-11 02:45:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-11 02:45:43,597 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-11 02:45:43,597 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-11 02:45:43,597 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-11 02:45:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-11 02:45:43,598 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-11 02:45:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-11 02:45:43,598 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-11 02:45:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-11 02:45:43,598 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-11 02:45:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-11 02:45:43,598 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-11 02:45:43,598 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-11 02:45:43,599 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-11 02:45:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:45:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-11 02:45:43,599 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-11 02:45:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-11 02:45:43,599 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-11 02:45:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-11 02:45:43,599 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-11 02:45:43,599 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-11 02:45:43,599 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-11 02:45:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2024-10-11 02:45:43,600 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2024-10-11 02:45:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-11 02:45:43,600 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-11 02:45:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-11 02:45:43,600 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-11 02:45:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-11 02:45:43,600 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-11 02:45:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:45:43,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:45:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:45:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:45:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-11 02:45:43,601 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-11 02:45:43,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:45:43,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:45:43,730 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:45:43,733 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:45:44,316 INFO L? ?]: Removed 368 outVars from TransFormulas that were not future-live. [2024-10-11 02:45:44,317 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:45:44,378 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:45:44,378 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:45:44,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:45:44 BoogieIcfgContainer [2024-10-11 02:45:44,378 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:45:44,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:45:44,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:45:44,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:45:44,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:45:42" (1/3) ... [2024-10-11 02:45:44,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5efe5d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:45:44, skipping insertion in model container [2024-10-11 02:45:44,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:45:43" (2/3) ... [2024-10-11 02:45:44,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5efe5d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:45:44, skipping insertion in model container [2024-10-11 02:45:44,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:45:44" (3/3) ... [2024-10-11 02:45:44,386 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec27_product13.cil.c [2024-10-11 02:45:44,400 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:45:44,400 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:45:44,473 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:45:44,478 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;@7376ed78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:45:44,479 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:45:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 256 states, 199 states have (on average 1.6080402010050252) internal successors, (320), 201 states have internal predecessors, (320), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 02:45:44,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 02:45:44,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:45:44,502 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:45:44,502 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:45:44,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:45:44,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1386060010, now seen corresponding path program 1 times [2024-10-11 02:45:44,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:45:44,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885942005] [2024-10-11 02:45:44,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:45:44,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:45:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:45,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:45:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:45,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:45:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:45,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:45:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:45,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:45:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:45,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:45:45,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:45,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:45:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:45,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:45:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:45,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:45:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:45,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:45:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:45,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:45:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:45,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:45:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:45,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:45:45,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:45,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:45:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:45,244 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:45:45,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:45:45,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885942005] [2024-10-11 02:45:45,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885942005] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:45:45,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837542561] [2024-10-11 02:45:45,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:45:45,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:45:45,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:45:45,253 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:45:45,257 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:45:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:45,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 02:45:45,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:45:45,619 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:45:45,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:45:45,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837542561] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:45:45,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:45:45,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-10-11 02:45:45,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526184680] [2024-10-11 02:45:45,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:45:45,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:45:45,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:45:45,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:45:45,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:45:45,657 INFO L87 Difference]: Start difference. First operand has 256 states, 199 states have (on average 1.6080402010050252) internal successors, (320), 201 states have internal predecessors, (320), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:45:45,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:45:45,734 INFO L93 Difference]: Finished difference Result 371 states and 562 transitions. [2024-10-11 02:45:45,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:45:45,737 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 98 [2024-10-11 02:45:45,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:45:45,746 INFO L225 Difference]: With dead ends: 371 [2024-10-11 02:45:45,746 INFO L226 Difference]: Without dead ends: 253 [2024-10-11 02:45:45,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:45:45,752 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:45:45,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:45:45,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-11 02:45:45,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2024-10-11 02:45:45,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 197 states have (on average 1.5888324873096447) internal successors, (313), 198 states have internal predecessors, (313), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 02:45:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 388 transitions. [2024-10-11 02:45:45,800 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 388 transitions. Word has length 98 [2024-10-11 02:45:45,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:45:45,801 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 388 transitions. [2024-10-11 02:45:45,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:45:45,806 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 388 transitions. [2024-10-11 02:45:45,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 02:45:45,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:45:45,814 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:45:45,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:45:46,015 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:45:46,016 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:45:46,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:45:46,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1349726118, now seen corresponding path program 1 times [2024-10-11 02:45:46,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:45:46,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870319411] [2024-10-11 02:45:46,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:45:46,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:45:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:46,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:45:46,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:46,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:45:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:46,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:45:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:46,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:45:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:46,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:45:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:46,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:45:46,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:46,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:45:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:46,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:45:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:46,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:45:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:46,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:45:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:46,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:45:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:46,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:45:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:46,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:45:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:46,461 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:45:46,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:45:46,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870319411] [2024-10-11 02:45:46,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870319411] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:45:46,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109816756] [2024-10-11 02:45:46,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:45:46,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:45:46,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:45:46,464 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:45:46,465 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:45:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:46,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:45:46,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:45:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:45:46,710 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:45:46,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109816756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:45:46,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:45:46,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 02:45:46,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858624262] [2024-10-11 02:45:46,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:45:46,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:45:46,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:45:46,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:45:46,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:45:46,716 INFO L87 Difference]: Start difference. First operand 253 states and 388 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:45:46,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:45:46,770 INFO L93 Difference]: Finished difference Result 367 states and 549 transitions. [2024-10-11 02:45:46,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:45:46,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 99 [2024-10-11 02:45:46,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:45:46,773 INFO L225 Difference]: With dead ends: 367 [2024-10-11 02:45:46,773 INFO L226 Difference]: Without dead ends: 255 [2024-10-11 02:45:46,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:45:46,779 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 0 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:45:46,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 757 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:45:46,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-11 02:45:46,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2024-10-11 02:45:46,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 199 states have (on average 1.5829145728643217) internal successors, (315), 200 states have internal predecessors, (315), 38 states have call successors, (38), 17 states have call predecessors, (38), 17 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 02:45:46,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 390 transitions. [2024-10-11 02:45:46,794 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 390 transitions. Word has length 99 [2024-10-11 02:45:46,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:45:46,794 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 390 transitions. [2024-10-11 02:45:46,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:45:46,795 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 390 transitions. [2024-10-11 02:45:46,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 02:45:46,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:45:46,797 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:45:46,812 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:45:46,998 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:45:46,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:45:46,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:45:46,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1592724573, now seen corresponding path program 1 times [2024-10-11 02:45:47,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:45:47,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631554719] [2024-10-11 02:45:47,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:45:47,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:45:47,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:45:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:45:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:45:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:45:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:45:47,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:45:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:45:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:45:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:45:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:45:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:45:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:45:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:45:47,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:45:47,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:45:47,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631554719] [2024-10-11 02:45:47,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631554719] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:45:47,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140013552] [2024-10-11 02:45:47,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:45:47,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:45:47,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:45:47,206 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:45:47,208 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:45:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,434 INFO L255 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:45:47,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:45:47,463 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:45:47,467 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:45:47,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140013552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:45:47,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:45:47,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 02:45:47,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727396121] [2024-10-11 02:45:47,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:45:47,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:45:47,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:45:47,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:45:47,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:45:47,469 INFO L87 Difference]: Start difference. First operand 255 states and 390 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:45:47,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:45:47,528 INFO L93 Difference]: Finished difference Result 536 states and 832 transitions. [2024-10-11 02:45:47,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:45:47,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2024-10-11 02:45:47,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:45:47,533 INFO L225 Difference]: With dead ends: 536 [2024-10-11 02:45:47,533 INFO L226 Difference]: Without dead ends: 303 [2024-10-11 02:45:47,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:45:47,538 INFO L432 NwaCegarLoop]: 383 mSDtfsCounter, 95 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:45:47,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 717 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:45:47,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-10-11 02:45:47,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 298. [2024-10-11 02:45:47,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 231 states have (on average 1.593073593073593) internal successors, (368), 232 states have internal predecessors, (368), 49 states have call successors, (49), 17 states have call predecessors, (49), 17 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 02:45:47,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 465 transitions. [2024-10-11 02:45:47,565 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 465 transitions. Word has length 104 [2024-10-11 02:45:47,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:45:47,565 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 465 transitions. [2024-10-11 02:45:47,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:45:47,566 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 465 transitions. [2024-10-11 02:45:47,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 02:45:47,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:45:47,568 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:45:47,582 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:45:47,768 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:45:47,769 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:45:47,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:45:47,769 INFO L85 PathProgramCache]: Analyzing trace with hash -974450773, now seen corresponding path program 1 times [2024-10-11 02:45:47,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:45:47,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717983611] [2024-10-11 02:45:47,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:45:47,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:45:47,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:45:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:45:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:45:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:45:47,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:45:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:45:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:45:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:45:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:45:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:45:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:45:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:45:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:45:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:47,925 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:45:47,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:45:47,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717983611] [2024-10-11 02:45:47,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717983611] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:45:47,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757604358] [2024-10-11 02:45:47,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:45:47,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:45:47,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:45:47,928 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:45:47,929 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:45:48,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:48,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 02:45:48,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:45:48,185 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 02:45:48,185 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:45:48,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757604358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:45:48,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:45:48,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-10-11 02:45:48,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583698697] [2024-10-11 02:45:48,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:45:48,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:45:48,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:45:48,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:45:48,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:45:48,187 INFO L87 Difference]: Start difference. First operand 298 states and 465 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 02:45:48,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:45:48,254 INFO L93 Difference]: Finished difference Result 591 states and 924 transitions. [2024-10-11 02:45:48,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:45:48,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 105 [2024-10-11 02:45:48,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:45:48,259 INFO L225 Difference]: With dead ends: 591 [2024-10-11 02:45:48,260 INFO L226 Difference]: Without dead ends: 300 [2024-10-11 02:45:48,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:45:48,261 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 2 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:45:48,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1473 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:45:48,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-11 02:45:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2024-10-11 02:45:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 232 states have (on average 1.5905172413793103) internal successors, (369), 234 states have internal predecessors, (369), 49 states have call successors, (49), 17 states have call predecessors, (49), 18 states have return successors, (50), 48 states have call predecessors, (50), 48 states have call successors, (50) [2024-10-11 02:45:48,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 468 transitions. [2024-10-11 02:45:48,277 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 468 transitions. Word has length 105 [2024-10-11 02:45:48,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:45:48,277 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 468 transitions. [2024-10-11 02:45:48,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 02:45:48,278 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 468 transitions. [2024-10-11 02:45:48,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 02:45:48,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:45:48,279 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:45:48,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 02:45:48,480 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:45:48,480 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:45:48,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:45:48,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1949251539, now seen corresponding path program 1 times [2024-10-11 02:45:48,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:45:48,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11888328] [2024-10-11 02:45:48,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:45:48,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:45:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:48,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:45:48,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:48,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:45:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:48,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:45:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:48,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:45:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:48,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:45:48,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:48,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:45:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:48,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:45:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:48,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:45:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:48,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:45:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:48,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:45:48,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:48,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:45:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:48,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:45:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:48,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:45:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:48,693 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:45:48,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:45:48,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11888328] [2024-10-11 02:45:48,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11888328] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:45:48,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723771331] [2024-10-11 02:45:48,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:45:48,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:45:48,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:45:48,696 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:45:48,697 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:45:48,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:48,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 978 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 02:45:48,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:45:48,968 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 02:45:48,968 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:45:48,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723771331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:45:48,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:45:48,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-10-11 02:45:48,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138911209] [2024-10-11 02:45:48,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:45:48,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:45:48,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:45:48,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:45:48,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:45:48,971 INFO L87 Difference]: Start difference. First operand 300 states and 468 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 02:45:49,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:45:49,049 INFO L93 Difference]: Finished difference Result 593 states and 929 transitions. [2024-10-11 02:45:49,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:45:49,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 106 [2024-10-11 02:45:49,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:45:49,052 INFO L225 Difference]: With dead ends: 593 [2024-10-11 02:45:49,052 INFO L226 Difference]: Without dead ends: 302 [2024-10-11 02:45:49,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:45:49,054 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 2 mSDsluCounter, 1090 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:45:49,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1459 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:45:49,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-11 02:45:49,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2024-10-11 02:45:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 233 states have (on average 1.5879828326180256) internal successors, (370), 236 states have internal predecessors, (370), 49 states have call successors, (49), 17 states have call predecessors, (49), 19 states have return successors, (55), 48 states have call predecessors, (55), 48 states have call successors, (55) [2024-10-11 02:45:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 474 transitions. [2024-10-11 02:45:49,073 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 474 transitions. Word has length 106 [2024-10-11 02:45:49,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:45:49,074 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 474 transitions. [2024-10-11 02:45:49,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 02:45:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 474 transitions. [2024-10-11 02:45:49,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 02:45:49,077 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:45:49,077 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:45:49,092 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:45:49,281 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:45:49,282 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:45:49,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:45:49,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1732478352, now seen corresponding path program 1 times [2024-10-11 02:45:49,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:45:49,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959570724] [2024-10-11 02:45:49,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:45:49,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:45:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:49,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:45:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:49,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:45:49,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:49,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:45:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:49,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:45:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:49,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:45:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:49,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:45:49,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:49,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:45:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:49,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:45:49,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:49,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:45:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:49,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:45:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:49,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:45:49,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:49,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:45:49,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:49,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:45:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:45:49,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:45:49,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959570724] [2024-10-11 02:45:49,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959570724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:45:49,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:45:49,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:45:49,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586645252] [2024-10-11 02:45:49,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:45:49,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:45:49,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:45:49,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:45:49,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:45:49,447 INFO L87 Difference]: Start difference. First operand 302 states and 474 transitions. Second operand has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 02:45:50,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:45:50,474 INFO L93 Difference]: Finished difference Result 636 states and 1004 transitions. [2024-10-11 02:45:50,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:45:50,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 107 [2024-10-11 02:45:50,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:45:50,477 INFO L225 Difference]: With dead ends: 636 [2024-10-11 02:45:50,477 INFO L226 Difference]: Without dead ends: 353 [2024-10-11 02:45:50,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:45:50,478 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 614 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:45:50,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 817 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:45:50,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-10-11 02:45:50,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 302. [2024-10-11 02:45:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 233 states have (on average 1.5879828326180256) internal successors, (370), 236 states have internal predecessors, (370), 49 states have call successors, (49), 17 states have call predecessors, (49), 19 states have return successors, (54), 48 states have call predecessors, (54), 48 states have call successors, (54) [2024-10-11 02:45:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 473 transitions. [2024-10-11 02:45:50,496 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 473 transitions. Word has length 107 [2024-10-11 02:45:50,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:45:50,496 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 473 transitions. [2024-10-11 02:45:50,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.714285714285714) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 02:45:50,497 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 473 transitions. [2024-10-11 02:45:50,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 02:45:50,498 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:45:50,498 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:45:50,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:45:50,499 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:45:50,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:45:50,499 INFO L85 PathProgramCache]: Analyzing trace with hash 833067318, now seen corresponding path program 2 times [2024-10-11 02:45:50,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:45:50,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449077954] [2024-10-11 02:45:50,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:45:50,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:45:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:50,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:45:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:50,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:45:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:50,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:45:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:50,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:45:50,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:50,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:45:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:50,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:45:50,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:50,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:45:50,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:50,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:45:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:50,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:45:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:50,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:45:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:50,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:45:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:50,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:45:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:50,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:45:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:50,649 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:45:50,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:45:50,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449077954] [2024-10-11 02:45:50,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449077954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:45:50,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:45:50,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:45:50,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572405222] [2024-10-11 02:45:50,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:45:50,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:45:50,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:45:50,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:45:50,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:45:50,650 INFO L87 Difference]: Start difference. First operand 302 states and 473 transitions. Second operand has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 02:45:51,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:45:51,656 INFO L93 Difference]: Finished difference Result 638 states and 1007 transitions. [2024-10-11 02:45:51,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:45:51,657 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 108 [2024-10-11 02:45:51,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:45:51,659 INFO L225 Difference]: With dead ends: 638 [2024-10-11 02:45:51,659 INFO L226 Difference]: Without dead ends: 355 [2024-10-11 02:45:51,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:45:51,661 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 611 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:45:51,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 817 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:45:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-11 02:45:51,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 304. [2024-10-11 02:45:51,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 234 states have (on average 1.5854700854700854) internal successors, (371), 238 states have internal predecessors, (371), 49 states have call successors, (49), 17 states have call predecessors, (49), 20 states have return successors, (56), 48 states have call predecessors, (56), 48 states have call successors, (56) [2024-10-11 02:45:51,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 476 transitions. [2024-10-11 02:45:51,678 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 476 transitions. Word has length 108 [2024-10-11 02:45:51,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:45:51,678 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 476 transitions. [2024-10-11 02:45:51,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 02:45:51,678 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 476 transitions. [2024-10-11 02:45:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 02:45:51,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:45:51,680 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:45:51,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:45:51,680 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:45:51,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:45:51,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1171731531, now seen corresponding path program 1 times [2024-10-11 02:45:51,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:45:51,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801285277] [2024-10-11 02:45:51,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:45:51,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:45:51,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:51,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:45:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:51,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:45:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:51,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:45:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:51,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:45:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:51,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:45:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:51,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:45:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:51,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:45:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:51,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:45:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:51,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:45:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:51,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:45:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:51,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:45:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:51,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:45:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:51,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:45:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:51,854 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:45:51,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:45:51,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801285277] [2024-10-11 02:45:51,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801285277] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:45:51,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:45:51,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 02:45:51,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675109886] [2024-10-11 02:45:51,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:45:51,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:45:51,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:45:51,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:45:51,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:45:51,856 INFO L87 Difference]: Start difference. First operand 304 states and 476 transitions. Second operand has 11 states, 10 states have (on average 7.3) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 02:45:53,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:45:53,208 INFO L93 Difference]: Finished difference Result 636 states and 1002 transitions. [2024-10-11 02:45:53,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:45:53,209 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.3) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 109 [2024-10-11 02:45:53,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:45:53,211 INFO L225 Difference]: With dead ends: 636 [2024-10-11 02:45:53,211 INFO L226 Difference]: Without dead ends: 355 [2024-10-11 02:45:53,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-11 02:45:53,213 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 614 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2588 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 2750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 2588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:45:53,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1174 Invalid, 2750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 2588 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:45:53,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-10-11 02:45:53,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 304. [2024-10-11 02:45:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 234 states have (on average 1.5854700854700854) internal successors, (371), 238 states have internal predecessors, (371), 49 states have call successors, (49), 17 states have call predecessors, (49), 20 states have return successors, (55), 48 states have call predecessors, (55), 48 states have call successors, (55) [2024-10-11 02:45:53,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 475 transitions. [2024-10-11 02:45:53,227 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 475 transitions. Word has length 109 [2024-10-11 02:45:53,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:45:53,228 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 475 transitions. [2024-10-11 02:45:53,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.3) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 02:45:53,228 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 475 transitions. [2024-10-11 02:45:53,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 02:45:53,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:45:53,229 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:45:53,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:45:53,230 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:45:53,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:45:53,230 INFO L85 PathProgramCache]: Analyzing trace with hash 637014674, now seen corresponding path program 2 times [2024-10-11 02:45:53,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:45:53,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820017486] [2024-10-11 02:45:53,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:45:53,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:45:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:53,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:45:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:53,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:45:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:53,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:45:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:53,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:45:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:53,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:45:53,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:53,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:45:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:53,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:45:53,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:53,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:45:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:53,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:45:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:53,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:45:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:53,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:45:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:53,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:45:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:53,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:45:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:45:53,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:45:53,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820017486] [2024-10-11 02:45:53,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820017486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:45:53,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:45:53,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 02:45:53,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439486183] [2024-10-11 02:45:53,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:45:53,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:45:53,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:45:53,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:45:53,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:45:53,417 INFO L87 Difference]: Start difference. First operand 304 states and 475 transitions. Second operand has 11 states, 10 states have (on average 7.4) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 02:45:54,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:45:54,930 INFO L93 Difference]: Finished difference Result 638 states and 1008 transitions. [2024-10-11 02:45:54,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:45:54,930 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.4) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 110 [2024-10-11 02:45:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:45:54,932 INFO L225 Difference]: With dead ends: 638 [2024-10-11 02:45:54,932 INFO L226 Difference]: Without dead ends: 357 [2024-10-11 02:45:54,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-11 02:45:54,934 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 611 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2622 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 2782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 2622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:45:54,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 1175 Invalid, 2782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 2622 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:45:54,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-11 02:45:54,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 306. [2024-10-11 02:45:54,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 235 states have (on average 1.5829787234042554) internal successors, (372), 240 states have internal predecessors, (372), 49 states have call successors, (49), 17 states have call predecessors, (49), 21 states have return successors, (60), 48 states have call predecessors, (60), 48 states have call successors, (60) [2024-10-11 02:45:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 481 transitions. [2024-10-11 02:45:54,948 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 481 transitions. Word has length 110 [2024-10-11 02:45:54,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:45:54,949 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 481 transitions. [2024-10-11 02:45:54,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.4) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 02:45:54,949 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 481 transitions. [2024-10-11 02:45:54,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 02:45:54,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:45:54,950 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:45:54,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:45:54,951 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:45:54,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:45:54,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1544804454, now seen corresponding path program 1 times [2024-10-11 02:45:54,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:45:54,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728168368] [2024-10-11 02:45:54,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:45:54,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:45:54,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:55,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:45:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:55,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:45:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:55,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:45:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:55,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:45:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:55,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:45:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:55,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:45:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:55,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:45:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:55,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:45:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:55,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:45:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:55,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:45:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:55,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:45:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:55,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:45:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:55,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:45:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:45:55,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:45:55,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728168368] [2024-10-11 02:45:55,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728168368] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:45:55,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794213731] [2024-10-11 02:45:55,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:45:55,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:45:55,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:45:55,068 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:45:55,069 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:45:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:55,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:45:55,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:45:55,350 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:45:55,351 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:45:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:45:55,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794213731] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:45:55,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:45:55,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-10-11 02:45:55,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101959973] [2024-10-11 02:45:55,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:45:55,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:45:55,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:45:55,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:45:55,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:45:55,430 INFO L87 Difference]: Start difference. First operand 306 states and 481 transitions. Second operand has 10 states, 10 states have (on average 10.2) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (30), 5 states have call predecessors, (30), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 02:45:56,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:45:56,538 INFO L93 Difference]: Finished difference Result 779 states and 1293 transitions. [2024-10-11 02:45:56,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:45:56,539 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (30), 5 states have call predecessors, (30), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 111 [2024-10-11 02:45:56,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:45:56,542 INFO L225 Difference]: With dead ends: 779 [2024-10-11 02:45:56,542 INFO L226 Difference]: Without dead ends: 667 [2024-10-11 02:45:56,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:45:56,543 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 975 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 1898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:45:56,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 1007 Invalid, 1898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:45:56,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2024-10-11 02:45:56,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 601. [2024-10-11 02:45:56,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 466 states have (on average 1.6351931330472103) internal successors, (762), 471 states have internal predecessors, (762), 113 states have call successors, (113), 17 states have call predecessors, (113), 21 states have return successors, (134), 112 states have call predecessors, (134), 112 states have call successors, (134) [2024-10-11 02:45:56,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1009 transitions. [2024-10-11 02:45:56,573 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1009 transitions. Word has length 111 [2024-10-11 02:45:56,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:45:56,574 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 1009 transitions. [2024-10-11 02:45:56,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 7 states have internal predecessors, (102), 2 states have call successors, (30), 5 states have call predecessors, (30), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-11 02:45:56,574 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1009 transitions. [2024-10-11 02:45:56,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 02:45:56,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:45:56,577 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:45:56,592 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:45:56,777 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:45:56,778 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:45:56,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:45:56,779 INFO L85 PathProgramCache]: Analyzing trace with hash -392639081, now seen corresponding path program 1 times [2024-10-11 02:45:56,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:45:56,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596276771] [2024-10-11 02:45:56,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:45:56,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:45:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:56,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:45:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:56,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:45:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:56,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:45:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:56,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:45:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:56,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:45:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:56,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:45:56,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:56,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:45:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:56,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:45:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:56,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:45:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:56,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:45:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:56,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:45:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:56,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:45:56,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:56,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:45:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:45:56,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:45:56,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596276771] [2024-10-11 02:45:56,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596276771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:45:56,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:45:56,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:45:56,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434336772] [2024-10-11 02:45:56,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:45:56,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:45:56,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:45:56,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:45:56,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:45:56,855 INFO L87 Difference]: Start difference. First operand 601 states and 1009 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:45:57,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:45:57,621 INFO L93 Difference]: Finished difference Result 1490 states and 2562 transitions. [2024-10-11 02:45:57,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:45:57,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2024-10-11 02:45:57,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:45:57,626 INFO L225 Difference]: With dead ends: 1490 [2024-10-11 02:45:57,626 INFO L226 Difference]: Without dead ends: 949 [2024-10-11 02:45:57,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:45:57,628 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 703 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:45:57,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 594 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:45:57,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-10-11 02:45:57,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 893. [2024-10-11 02:45:57,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 694 states have (on average 1.6412103746397695) internal successors, (1139), 699 states have internal predecessors, (1139), 177 states have call successors, (177), 17 states have call predecessors, (177), 21 states have return successors, (208), 176 states have call predecessors, (208), 176 states have call successors, (208) [2024-10-11 02:45:57,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1524 transitions. [2024-10-11 02:45:57,656 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1524 transitions. Word has length 117 [2024-10-11 02:45:57,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:45:57,656 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1524 transitions. [2024-10-11 02:45:57,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:45:57,657 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1524 transitions. [2024-10-11 02:45:57,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 02:45:57,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:45:57,660 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:45:57,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:45:57,660 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:45:57,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:45:57,661 INFO L85 PathProgramCache]: Analyzing trace with hash -405494380, now seen corresponding path program 1 times [2024-10-11 02:45:57,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:45:57,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672664607] [2024-10-11 02:45:57,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:45:57,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:45:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:57,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:45:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:57,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:45:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:57,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:45:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:57,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:45:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:57,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:45:57,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:57,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:45:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:57,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:45:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:57,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:45:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:57,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:45:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:57,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:45:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:57,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:45:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:57,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:45:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:57,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:45:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:45:57,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:45:57,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672664607] [2024-10-11 02:45:57,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672664607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:45:57,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:45:57,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:45:57,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280069111] [2024-10-11 02:45:57,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:45:57,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:45:57,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:45:57,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:45:57,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:45:57,735 INFO L87 Difference]: Start difference. First operand 893 states and 1524 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:45:58,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:45:58,453 INFO L93 Difference]: Finished difference Result 2187 states and 3789 transitions. [2024-10-11 02:45:58,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:45:58,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2024-10-11 02:45:58,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:45:58,460 INFO L225 Difference]: With dead ends: 2187 [2024-10-11 02:45:58,460 INFO L226 Difference]: Without dead ends: 1404 [2024-10-11 02:45:58,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:45:58,463 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 701 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:45:58,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 571 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 02:45:58,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2024-10-11 02:45:58,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1348. [2024-10-11 02:45:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1054 states have (on average 1.6442125237191652) internal successors, (1733), 1059 states have internal predecessors, (1733), 272 states have call successors, (272), 17 states have call predecessors, (272), 21 states have return successors, (303), 271 states have call predecessors, (303), 271 states have call successors, (303) [2024-10-11 02:45:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2308 transitions. [2024-10-11 02:45:58,506 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2308 transitions. Word has length 118 [2024-10-11 02:45:58,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:45:58,506 INFO L471 AbstractCegarLoop]: Abstraction has 1348 states and 2308 transitions. [2024-10-11 02:45:58,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:45:58,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2308 transitions. [2024-10-11 02:45:58,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 02:45:58,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:45:58,511 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:45:58,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:45:58,512 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:45:58,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:45:58,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1527237017, now seen corresponding path program 1 times [2024-10-11 02:45:58,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:45:58,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466263531] [2024-10-11 02:45:58,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:45:58,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:45:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:58,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:45:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:58,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:45:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:58,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:45:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:58,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:45:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:58,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:45:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:58,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:45:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:58,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:45:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:58,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:45:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:58,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:45:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:58,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:45:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:58,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:45:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:58,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:45:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:58,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:45:58,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:58,580 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:45:58,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:45:58,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466263531] [2024-10-11 02:45:58,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466263531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:45:58,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:45:58,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:45:58,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155927774] [2024-10-11 02:45:58,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:45:58,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:45:58,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:45:58,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:45:58,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:45:58,582 INFO L87 Difference]: Start difference. First operand 1348 states and 2308 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:45:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:45:59,360 INFO L93 Difference]: Finished difference Result 3205 states and 5601 transitions. [2024-10-11 02:45:59,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:45:59,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2024-10-11 02:45:59,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:45:59,371 INFO L225 Difference]: With dead ends: 3205 [2024-10-11 02:45:59,372 INFO L226 Difference]: Without dead ends: 2087 [2024-10-11 02:45:59,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:45:59,378 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 699 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:45:59,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 570 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:45:59,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2024-10-11 02:45:59,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 2031. [2024-10-11 02:45:59,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2031 states, 1614 states have (on average 1.647459727385378) internal successors, (2659), 1619 states have internal predecessors, (2659), 395 states have call successors, (395), 17 states have call predecessors, (395), 21 states have return successors, (442), 394 states have call predecessors, (442), 394 states have call successors, (442) [2024-10-11 02:45:59,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2031 states to 2031 states and 3496 transitions. [2024-10-11 02:45:59,447 INFO L78 Accepts]: Start accepts. Automaton has 2031 states and 3496 transitions. Word has length 119 [2024-10-11 02:45:59,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:45:59,448 INFO L471 AbstractCegarLoop]: Abstraction has 2031 states and 3496 transitions. [2024-10-11 02:45:59,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:45:59,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2031 states and 3496 transitions. [2024-10-11 02:45:59,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 02:45:59,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:45:59,455 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:45:59,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:45:59,456 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:45:59,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:45:59,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1618461717, now seen corresponding path program 1 times [2024-10-11 02:45:59,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:45:59,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784076162] [2024-10-11 02:45:59,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:45:59,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:45:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:59,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:45:59,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:59,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:45:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:59,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:45:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:59,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:45:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:59,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:45:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:59,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:45:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:59,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:45:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:59,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:45:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:59,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:45:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:59,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:45:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:59,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:45:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:59,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:45:59,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:59,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 02:45:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:45:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:45:59,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:45:59,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784076162] [2024-10-11 02:45:59,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784076162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:45:59,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:45:59,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:45:59,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365147197] [2024-10-11 02:45:59,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:45:59,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:45:59,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:45:59,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:45:59,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:45:59,561 INFO L87 Difference]: Start difference. First operand 2031 states and 3496 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:46:00,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:46:00,595 INFO L93 Difference]: Finished difference Result 4775 states and 8406 transitions. [2024-10-11 02:46:00,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:46:00,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2024-10-11 02:46:00,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:46:00,610 INFO L225 Difference]: With dead ends: 4775 [2024-10-11 02:46:00,610 INFO L226 Difference]: Without dead ends: 3171 [2024-10-11 02:46:00,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:46:00,616 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 697 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:46:00,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 570 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:46:00,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3171 states. [2024-10-11 02:46:00,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3171 to 3115. [2024-10-11 02:46:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3115 states, 2519 states have (on average 1.649464073044859) internal successors, (4155), 2524 states have internal predecessors, (4155), 574 states have call successors, (574), 17 states have call predecessors, (574), 21 states have return successors, (647), 573 states have call predecessors, (647), 573 states have call successors, (647) [2024-10-11 02:46:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 5376 transitions. [2024-10-11 02:46:00,716 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 5376 transitions. Word has length 120 [2024-10-11 02:46:00,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:46:00,716 INFO L471 AbstractCegarLoop]: Abstraction has 3115 states and 5376 transitions. [2024-10-11 02:46:00,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:46:00,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 5376 transitions. [2024-10-11 02:46:00,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 02:46:00,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:46:00,728 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:46:00,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:46:00,728 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:46:00,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:46:00,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1522970677, now seen corresponding path program 1 times [2024-10-11 02:46:00,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:46:00,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352350804] [2024-10-11 02:46:00,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:46:00,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:46:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:00,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:46:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:00,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:46:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:00,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:46:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:00,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:46:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:00,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:46:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:00,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:46:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:00,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:46:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:00,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:46:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:00,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:46:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:00,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:46:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:00,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:46:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:00,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:46:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:00,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:46:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:00,823 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:46:00,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:46:00,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352350804] [2024-10-11 02:46:00,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352350804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:46:00,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:46:00,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:46:00,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449575698] [2024-10-11 02:46:00,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:46:00,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:46:00,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:46:00,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:46:00,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:46:00,825 INFO L87 Difference]: Start difference. First operand 3115 states and 5376 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:46:01,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:46:01,703 INFO L93 Difference]: Finished difference Result 7606 states and 13418 transitions. [2024-10-11 02:46:01,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:46:01,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2024-10-11 02:46:01,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:46:01,758 INFO L225 Difference]: With dead ends: 7606 [2024-10-11 02:46:01,762 INFO L226 Difference]: Without dead ends: 5141 [2024-10-11 02:46:01,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:46:01,779 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 695 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:46:01,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 596 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:46:01,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5141 states. [2024-10-11 02:46:02,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5141 to 5085. [2024-10-11 02:46:02,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5085 states, 4113 states have (on average 1.6401653294432288) internal successors, (6746), 4118 states have internal predecessors, (6746), 950 states have call successors, (950), 17 states have call predecessors, (950), 21 states have return successors, (1067), 949 states have call predecessors, (1067), 949 states have call successors, (1067) [2024-10-11 02:46:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5085 states to 5085 states and 8763 transitions. [2024-10-11 02:46:02,239 INFO L78 Accepts]: Start accepts. Automaton has 5085 states and 8763 transitions. Word has length 121 [2024-10-11 02:46:02,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:46:02,240 INFO L471 AbstractCegarLoop]: Abstraction has 5085 states and 8763 transitions. [2024-10-11 02:46:02,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:46:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 5085 states and 8763 transitions. [2024-10-11 02:46:02,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 02:46:02,270 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:46:02,270 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:46:02,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:46:02,271 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:46:02,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:46:02,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1393009287, now seen corresponding path program 1 times [2024-10-11 02:46:02,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:46:02,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959728876] [2024-10-11 02:46:02,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:46:02,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:46:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:02,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:46:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:02,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:46:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:02,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:46:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:02,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:46:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:02,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:46:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:02,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:46:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:02,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:46:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:02,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:46:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:02,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:46:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:02,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:46:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:02,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:46:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:02,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:46:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:02,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 02:46:02,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:02,361 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:46:02,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:46:02,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959728876] [2024-10-11 02:46:02,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959728876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:46:02,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:46:02,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:46:02,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925193872] [2024-10-11 02:46:02,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:46:02,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:46:02,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:46:02,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:46:02,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:46:02,363 INFO L87 Difference]: Start difference. First operand 5085 states and 8763 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:46:03,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:46:03,196 INFO L93 Difference]: Finished difference Result 12587 states and 22166 transitions. [2024-10-11 02:46:03,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:46:03,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2024-10-11 02:46:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:46:03,232 INFO L225 Difference]: With dead ends: 12587 [2024-10-11 02:46:03,233 INFO L226 Difference]: Without dead ends: 8518 [2024-10-11 02:46:03,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:46:03,246 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 693 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:46:03,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 581 Invalid, 1047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 02:46:03,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8518 states. [2024-10-11 02:46:03,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8518 to 8462. [2024-10-11 02:46:03,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8462 states, 6884 states have (on average 1.6369843114468332) internal successors, (11269), 6889 states have internal predecessors, (11269), 1556 states have call successors, (1556), 17 states have call predecessors, (1556), 21 states have return successors, (1751), 1555 states have call predecessors, (1751), 1555 states have call successors, (1751) [2024-10-11 02:46:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8462 states to 8462 states and 14576 transitions. [2024-10-11 02:46:03,548 INFO L78 Accepts]: Start accepts. Automaton has 8462 states and 14576 transitions. Word has length 122 [2024-10-11 02:46:03,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:46:03,549 INFO L471 AbstractCegarLoop]: Abstraction has 8462 states and 14576 transitions. [2024-10-11 02:46:03,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:46:03,549 INFO L276 IsEmpty]: Start isEmpty. Operand 8462 states and 14576 transitions. [2024-10-11 02:46:03,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 02:46:03,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:46:03,571 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:46:03,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:46:03,571 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:46:03,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:46:03,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1752050153, now seen corresponding path program 1 times [2024-10-11 02:46:03,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:46:03,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395840298] [2024-10-11 02:46:03,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:46:03,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:46:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:03,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:46:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:03,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:46:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:03,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:46:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:03,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:46:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:03,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:46:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:03,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:46:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:03,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:46:03,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:03,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:46:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:03,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:46:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:03,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:46:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:03,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:46:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:03,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:46:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:03,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 02:46:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:03,647 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:46:03,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:46:03,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395840298] [2024-10-11 02:46:03,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395840298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:46:03,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:46:03,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:46:03,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308751407] [2024-10-11 02:46:03,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:46:03,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:46:03,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:46:03,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:46:03,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:46:03,653 INFO L87 Difference]: Start difference. First operand 8462 states and 14576 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:46:04,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:46:04,682 INFO L93 Difference]: Finished difference Result 21939 states and 38565 transitions. [2024-10-11 02:46:04,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:46:04,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2024-10-11 02:46:04,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:46:04,743 INFO L225 Difference]: With dead ends: 21939 [2024-10-11 02:46:04,743 INFO L226 Difference]: Without dead ends: 14902 [2024-10-11 02:46:04,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:46:04,768 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 691 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:46:04,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 597 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:46:04,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14902 states. [2024-10-11 02:46:05,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14902 to 14846. [2024-10-11 02:46:05,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14846 states, 12065 states have (on average 1.626688769167012) internal successors, (19626), 12070 states have internal predecessors, (19626), 2759 states have call successors, (2759), 17 states have call predecessors, (2759), 21 states have return successors, (3098), 2758 states have call predecessors, (3098), 2758 states have call successors, (3098) [2024-10-11 02:46:05,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14846 states to 14846 states and 25483 transitions. [2024-10-11 02:46:05,539 INFO L78 Accepts]: Start accepts. Automaton has 14846 states and 25483 transitions. Word has length 123 [2024-10-11 02:46:05,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:46:05,540 INFO L471 AbstractCegarLoop]: Abstraction has 14846 states and 25483 transitions. [2024-10-11 02:46:05,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:46:05,541 INFO L276 IsEmpty]: Start isEmpty. Operand 14846 states and 25483 transitions. [2024-10-11 02:46:05,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 02:46:05,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:46:05,573 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:46:05,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 02:46:05,573 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:46:05,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:46:05,573 INFO L85 PathProgramCache]: Analyzing trace with hash -245749862, now seen corresponding path program 1 times [2024-10-11 02:46:05,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:46:05,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519807471] [2024-10-11 02:46:05,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:46:05,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:46:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:05,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:46:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:05,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:46:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:05,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:46:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:05,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:46:05,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:05,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:46:05,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:05,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:46:05,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:05,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:46:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:05,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:46:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:05,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:46:05,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:05,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:46:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:05,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:46:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:05,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:46:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:05,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:46:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:46:05,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:46:05,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519807471] [2024-10-11 02:46:05,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519807471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:46:05,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:46:05,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:46:05,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983623538] [2024-10-11 02:46:05,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:46:05,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:46:05,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:46:05,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:46:05,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:46:05,662 INFO L87 Difference]: Start difference. First operand 14846 states and 25483 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:46:06,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:46:06,797 INFO L93 Difference]: Finished difference Result 39298 states and 68951 transitions. [2024-10-11 02:46:06,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:46:06,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2024-10-11 02:46:06,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:46:07,110 INFO L225 Difference]: With dead ends: 39298 [2024-10-11 02:46:07,111 INFO L226 Difference]: Without dead ends: 26469 [2024-10-11 02:46:07,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:46:07,142 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 689 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1041 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:46:07,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 571 Invalid, 1041 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 02:46:07,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26469 states. [2024-10-11 02:46:07,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26469 to 26413. [2024-10-11 02:46:07,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26413 states, 21593 states have (on average 1.6223313110730329) internal successors, (35031), 21598 states have internal predecessors, (35031), 4798 states have call successors, (4798), 17 states have call predecessors, (4798), 21 states have return successors, (5411), 4797 states have call predecessors, (5411), 4797 states have call successors, (5411) [2024-10-11 02:46:07,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26413 states to 26413 states and 45240 transitions. [2024-10-11 02:46:07,964 INFO L78 Accepts]: Start accepts. Automaton has 26413 states and 45240 transitions. Word has length 124 [2024-10-11 02:46:07,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:46:07,965 INFO L471 AbstractCegarLoop]: Abstraction has 26413 states and 45240 transitions. [2024-10-11 02:46:07,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:46:07,965 INFO L276 IsEmpty]: Start isEmpty. Operand 26413 states and 45240 transitions. [2024-10-11 02:46:07,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 02:46:07,994 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:46:07,995 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:46:07,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 02:46:07,995 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:46:07,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:46:07,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1344965543, now seen corresponding path program 1 times [2024-10-11 02:46:07,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:46:07,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745280507] [2024-10-11 02:46:07,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:46:07,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:46:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:08,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:46:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:08,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:46:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:08,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:46:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:08,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:46:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:08,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:46:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:08,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:46:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:08,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:46:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:08,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:46:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:08,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:46:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:08,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:46:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:08,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:46:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:08,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:46:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:08,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 02:46:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:08,087 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:46:08,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:46:08,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745280507] [2024-10-11 02:46:08,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745280507] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:46:08,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:46:08,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:46:08,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797541775] [2024-10-11 02:46:08,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:46:08,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:46:08,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:46:08,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:46:08,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:46:08,090 INFO L87 Difference]: Start difference. First operand 26413 states and 45240 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:46:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:46:10,328 INFO L93 Difference]: Finished difference Result 71910 states and 125375 transitions. [2024-10-11 02:46:10,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:46:10,329 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2024-10-11 02:46:10,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:46:10,501 INFO L225 Difference]: With dead ends: 71910 [2024-10-11 02:46:10,501 INFO L226 Difference]: Without dead ends: 48229 [2024-10-11 02:46:10,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:46:10,558 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 687 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:46:10,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 581 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:46:10,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48229 states. [2024-10-11 02:46:12,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48229 to 48173. [2024-10-11 02:46:12,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48173 states, 39638 states have (on average 1.6167061910288107) internal successors, (64083), 39643 states have internal predecessors, (64083), 8513 states have call successors, (8513), 17 states have call predecessors, (8513), 21 states have return successors, (9658), 8512 states have call predecessors, (9658), 8512 states have call successors, (9658) [2024-10-11 02:46:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48173 states to 48173 states and 82254 transitions. [2024-10-11 02:46:12,892 INFO L78 Accepts]: Start accepts. Automaton has 48173 states and 82254 transitions. Word has length 125 [2024-10-11 02:46:12,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:46:12,893 INFO L471 AbstractCegarLoop]: Abstraction has 48173 states and 82254 transitions. [2024-10-11 02:46:12,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:46:12,893 INFO L276 IsEmpty]: Start isEmpty. Operand 48173 states and 82254 transitions. [2024-10-11 02:46:12,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 02:46:12,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:46:12,926 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:46:12,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 02:46:12,926 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:46:12,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:46:12,927 INFO L85 PathProgramCache]: Analyzing trace with hash 582161882, now seen corresponding path program 1 times [2024-10-11 02:46:12,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:46:12,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513903674] [2024-10-11 02:46:12,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:46:12,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:46:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:13,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:46:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:13,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:46:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:13,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:46:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:13,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:46:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:13,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:46:13,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:13,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:46:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:13,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:46:13,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:13,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:46:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:13,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:46:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:13,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:46:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:13,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:46:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:13,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 02:46:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:13,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 02:46:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:13,320 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:46:13,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:46:13,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513903674] [2024-10-11 02:46:13,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513903674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:46:13,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:46:13,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:46:13,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303264084] [2024-10-11 02:46:13,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:46:13,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:46:13,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:46:13,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:46:13,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:46:13,321 INFO L87 Difference]: Start difference. First operand 48173 states and 82254 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:46:15,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:46:15,645 INFO L93 Difference]: Finished difference Result 89629 states and 156739 transitions. [2024-10-11 02:46:15,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:46:15,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2024-10-11 02:46:15,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:46:15,952 INFO L225 Difference]: With dead ends: 89629 [2024-10-11 02:46:15,952 INFO L226 Difference]: Without dead ends: 89517 [2024-10-11 02:46:15,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:46:15,996 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 682 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1052 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:46:15,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 583 Invalid, 1052 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:46:16,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89517 states. [2024-10-11 02:46:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89517 to 89461. [2024-10-11 02:46:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89461 states, 74127 states have (on average 1.6095754583350197) internal successors, (119313), 74132 states have internal predecessors, (119313), 15312 states have call successors, (15312), 17 states have call predecessors, (15312), 21 states have return successors, (17503), 15311 states have call predecessors, (17503), 15311 states have call successors, (17503) [2024-10-11 02:46:19,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89461 states to 89461 states and 152128 transitions. [2024-10-11 02:46:19,537 INFO L78 Accepts]: Start accepts. Automaton has 89461 states and 152128 transitions. Word has length 126 [2024-10-11 02:46:19,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:46:19,538 INFO L471 AbstractCegarLoop]: Abstraction has 89461 states and 152128 transitions. [2024-10-11 02:46:19,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:46:19,538 INFO L276 IsEmpty]: Start isEmpty. Operand 89461 states and 152128 transitions. [2024-10-11 02:46:19,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 02:46:19,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:46:19,591 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:46:19,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 02:46:19,591 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:46:19,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:46:19,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1902408120, now seen corresponding path program 1 times [2024-10-11 02:46:19,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:46:19,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931326289] [2024-10-11 02:46:19,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:46:19,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:46:19,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:19,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:46:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:19,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:46:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:19,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:46:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:19,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:46:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:19,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:46:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:19,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:46:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:19,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:46:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:19,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:46:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:19,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:46:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:19,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:46:19,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:19,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:46:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:19,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:46:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:19,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 02:46:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:19,709 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:46:19,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:46:19,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931326289] [2024-10-11 02:46:19,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931326289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:46:19,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:46:19,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:46:19,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982309372] [2024-10-11 02:46:19,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:46:19,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:46:19,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:46:19,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:46:19,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:46:19,711 INFO L87 Difference]: Start difference. First operand 89461 states and 152128 transitions. Second operand has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:46:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:46:22,539 INFO L93 Difference]: Finished difference Result 89615 states and 155629 transitions. [2024-10-11 02:46:22,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:46:22,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2024-10-11 02:46:22,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:46:22,856 INFO L225 Difference]: With dead ends: 89615 [2024-10-11 02:46:22,856 INFO L226 Difference]: Without dead ends: 89512 [2024-10-11 02:46:22,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:46:22,902 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 607 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 1511 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:46:22,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 826 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1511 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 02:46:22,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89512 states. [2024-10-11 02:46:25,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89512 to 89461. [2024-10-11 02:46:25,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89461 states, 74127 states have (on average 1.6095619679738826) internal successors, (119312), 74132 states have internal predecessors, (119312), 15312 states have call successors, (15312), 17 states have call predecessors, (15312), 21 states have return successors, (17503), 15311 states have call predecessors, (17503), 15311 states have call successors, (17503) [2024-10-11 02:46:27,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89461 states to 89461 states and 152127 transitions. [2024-10-11 02:46:27,102 INFO L78 Accepts]: Start accepts. Automaton has 89461 states and 152127 transitions. Word has length 127 [2024-10-11 02:46:27,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:46:27,103 INFO L471 AbstractCegarLoop]: Abstraction has 89461 states and 152127 transitions. [2024-10-11 02:46:27,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.285714285714286) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:46:27,103 INFO L276 IsEmpty]: Start isEmpty. Operand 89461 states and 152127 transitions. [2024-10-11 02:46:27,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 02:46:27,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:46:27,244 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:46:27,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 02:46:27,244 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:46:27,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:46:27,245 INFO L85 PathProgramCache]: Analyzing trace with hash 698040247, now seen corresponding path program 1 times [2024-10-11 02:46:27,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:46:27,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123226852] [2024-10-11 02:46:27,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:46:27,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:46:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:27,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:46:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:27,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:46:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:27,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:46:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:27,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:46:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:27,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:46:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:27,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:46:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:27,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:46:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:27,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:46:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:27,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:46:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:27,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:46:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:27,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:46:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:27,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:46:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:27,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 02:46:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:27,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 02:46:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:27,416 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:46:27,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:46:27,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123226852] [2024-10-11 02:46:27,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123226852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:46:27,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:46:27,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:46:27,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748561779] [2024-10-11 02:46:27,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:46:27,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:46:27,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:46:27,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:46:27,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:46:27,419 INFO L87 Difference]: Start difference. First operand 89461 states and 152127 transitions. Second operand has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:46:30,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:46:30,848 INFO L93 Difference]: Finished difference Result 89766 states and 155842 transitions. [2024-10-11 02:46:30,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 02:46:30,849 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 134 [2024-10-11 02:46:30,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:46:31,255 INFO L225 Difference]: With dead ends: 89766 [2024-10-11 02:46:31,256 INFO L226 Difference]: Without dead ends: 89663 [2024-10-11 02:46:31,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:46:31,306 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1213 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 1997 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:46:31,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 805 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1997 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 02:46:31,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89663 states. [2024-10-11 02:46:34,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89663 to 89566. [2024-10-11 02:46:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89566 states, 74210 states have (on average 1.609432691011993) internal successors, (119436), 74215 states have internal predecessors, (119436), 15323 states have call successors, (15323), 26 states have call predecessors, (15323), 32 states have return successors, (17516), 15324 states have call predecessors, (17516), 15321 states have call successors, (17516) [2024-10-11 02:46:34,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89566 states to 89566 states and 152275 transitions. [2024-10-11 02:46:34,538 INFO L78 Accepts]: Start accepts. Automaton has 89566 states and 152275 transitions. Word has length 134 [2024-10-11 02:46:34,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:46:34,538 INFO L471 AbstractCegarLoop]: Abstraction has 89566 states and 152275 transitions. [2024-10-11 02:46:34,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.11111111111111) internal successors, (91), 5 states have internal predecessors, (91), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:46:34,539 INFO L276 IsEmpty]: Start isEmpty. Operand 89566 states and 152275 transitions. [2024-10-11 02:46:34,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-11 02:46:34,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:46:34,595 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:46:34,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 02:46:34,595 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:46:34,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:46:34,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1168196839, now seen corresponding path program 1 times [2024-10-11 02:46:34,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:46:34,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322170543] [2024-10-11 02:46:34,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:46:34,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:46:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:34,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:46:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:34,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:46:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:34,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:46:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:34,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:46:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:34,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:46:34,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:34,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:46:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:34,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:46:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:34,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:46:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:34,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:46:34,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:34,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:46:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:34,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:46:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:34,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:46:34,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:34,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 02:46:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:34,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 02:46:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:46:34,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:46:34,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322170543] [2024-10-11 02:46:34,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322170543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:46:34,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:46:34,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 02:46:34,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595982638] [2024-10-11 02:46:34,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:46:34,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 02:46:34,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:46:34,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 02:46:34,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:46:34,840 INFO L87 Difference]: Start difference. First operand 89566 states and 152275 transitions. Second operand has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 11 states have internal predecessors, (92), 8 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-11 02:46:39,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:46:39,335 INFO L93 Difference]: Finished difference Result 89973 states and 156145 transitions. [2024-10-11 02:46:39,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 02:46:39,335 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 11 states have internal predecessors, (92), 8 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 135 [2024-10-11 02:46:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:46:39,684 INFO L225 Difference]: With dead ends: 89973 [2024-10-11 02:46:39,685 INFO L226 Difference]: Without dead ends: 89751 [2024-10-11 02:46:39,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=1100, Unknown=0, NotChecked=0, Total=1332 [2024-10-11 02:46:39,732 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 874 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 4414 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 1686 SdHoareTripleChecker+Invalid, 4635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 4414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:46:39,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 1686 Invalid, 4635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 4414 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 02:46:39,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89751 states. [2024-10-11 02:46:42,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89751 to 89619. [2024-10-11 02:46:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89619 states, 74251 states have (on average 1.6092981912701512) internal successors, (119492), 74258 states have internal predecessors, (119492), 15334 states have call successors, (15334), 27 states have call predecessors, (15334), 33 states have return successors, (17527), 15333 states have call predecessors, (17527), 15332 states have call successors, (17527) [2024-10-11 02:46:43,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89619 states to 89619 states and 152353 transitions. [2024-10-11 02:46:43,306 INFO L78 Accepts]: Start accepts. Automaton has 89619 states and 152353 transitions. Word has length 135 [2024-10-11 02:46:43,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:46:43,307 INFO L471 AbstractCegarLoop]: Abstraction has 89619 states and 152353 transitions. [2024-10-11 02:46:43,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 11 states have internal predecessors, (92), 8 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2024-10-11 02:46:43,307 INFO L276 IsEmpty]: Start isEmpty. Operand 89619 states and 152353 transitions. [2024-10-11 02:46:43,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-11 02:46:43,433 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:46:43,433 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:43,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 02:46:43,434 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:46:43,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:46:43,434 INFO L85 PathProgramCache]: Analyzing trace with hash -342323313, now seen corresponding path program 1 times [2024-10-11 02:46:43,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:46:43,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312317877] [2024-10-11 02:46:43,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:46:43,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:46:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:43,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:46:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:43,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:46:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:43,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:46:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:43,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:46:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:43,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:46:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:43,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:46:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:43,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:46:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:43,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:46:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:43,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:46:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:43,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:46:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:43,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:46:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:43,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 02:46:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:43,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 02:46:43,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:43,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 02:46:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:43,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 02:46:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:43,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 02:46:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:43,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 02:46:43,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:43,615 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-11 02:46:43,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:46:43,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312317877] [2024-10-11 02:46:43,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312317877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:46:43,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:46:43,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:46:43,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834661174] [2024-10-11 02:46:43,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:46:43,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:46:43,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:46:43,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:46:43,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:46:43,617 INFO L87 Difference]: Start difference. First operand 89619 states and 152353 transitions. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 02:46:47,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:46:47,301 INFO L93 Difference]: Finished difference Result 90363 states and 156706 transitions. [2024-10-11 02:46:47,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 02:46:47,302 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 159 [2024-10-11 02:46:47,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:46:47,579 INFO L225 Difference]: With dead ends: 90363 [2024-10-11 02:46:47,579 INFO L226 Difference]: Without dead ends: 90129 [2024-10-11 02:46:47,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:46:47,608 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 980 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 2663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:46:47,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 810 Invalid, 2663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 02:46:47,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90129 states. [2024-10-11 02:46:50,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90129 to 89878. [2024-10-11 02:46:50,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89878 states, 74453 states have (on average 1.6088673391266974) internal successors, (119785), 74463 states have internal predecessors, (119785), 15367 states have call successors, (15367), 45 states have call predecessors, (15367), 57 states have return successors, (17566), 15369 states have call predecessors, (17566), 15363 states have call successors, (17566) [2024-10-11 02:46:50,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89878 states to 89878 states and 152718 transitions. [2024-10-11 02:46:50,861 INFO L78 Accepts]: Start accepts. Automaton has 89878 states and 152718 transitions. Word has length 159 [2024-10-11 02:46:50,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:46:50,862 INFO L471 AbstractCegarLoop]: Abstraction has 89878 states and 152718 transitions. [2024-10-11 02:46:50,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-11 02:46:50,862 INFO L276 IsEmpty]: Start isEmpty. Operand 89878 states and 152718 transitions. [2024-10-11 02:46:50,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-10-11 02:46:50,986 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:46:50,986 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:50,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 02:46:50,986 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:46:50,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:46:50,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1673574340, now seen corresponding path program 1 times [2024-10-11 02:46:50,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:46:50,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716919253] [2024-10-11 02:46:50,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:46:50,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:46:51,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:51,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:46:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:51,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:46:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:51,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:46:51,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:51,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:46:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:51,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:46:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:51,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:46:51,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:51,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:46:51,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:51,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:46:51,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:51,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:46:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:51,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:46:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:51,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:46:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:51,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:46:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:51,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 02:46:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:51,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 02:46:51,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:51,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-11 02:46:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:51,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 02:46:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:51,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 02:46:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:46:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-11 02:46:51,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:46:51,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716919253] [2024-10-11 02:46:51,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716919253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:46:51,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:46:51,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 02:46:51,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545139853] [2024-10-11 02:46:51,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:46:51,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 02:46:51,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:46:51,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 02:46:51,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:46:51,233 INFO L87 Difference]: Start difference. First operand 89878 states and 152718 transitions. Second operand has 14 states, 13 states have (on average 8.0) internal successors, (104), 10 states have internal predecessors, (104), 7 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2024-10-11 02:46:54,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:46:54,863 INFO L93 Difference]: Finished difference Result 90452 states and 156817 transitions. [2024-10-11 02:46:54,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 02:46:54,863 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 8.0) internal successors, (104), 10 states have internal predecessors, (104), 7 states have call successors, (19), 5 states have call predecessors, (19), 2 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 160 [2024-10-11 02:46:54,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:46:55,204 INFO L225 Difference]: With dead ends: 90452 [2024-10-11 02:46:55,205 INFO L226 Difference]: Without dead ends: 89974 [2024-10-11 02:46:55,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=914, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 02:46:55,251 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 885 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 3659 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 3886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 3659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:46:55,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 1563 Invalid, 3886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 3659 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 02:46:55,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89974 states.