./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_spec7_product19.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product19.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7a4e3d1ef75cde0243f57ce4bcedb5827704adb835017a69deaa6c50c3201720 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 21:59:09,613 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 21:59:09,686 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 21:59:09,690 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 21:59:09,691 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 21:59:09,749 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 21:59:09,750 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 21:59:09,750 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 21:59:09,751 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 21:59:09,754 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 21:59:09,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 21:59:09,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 21:59:09,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 21:59:09,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 21:59:09,756 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 21:59:09,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 21:59:09,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 21:59:09,756 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 21:59:09,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 21:59:09,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 21:59:09,757 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 21:59:09,757 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 21:59:09,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 21:59:09,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 21:59:09,758 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 21:59:09,758 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 21:59:09,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 21:59:09,758 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 21:59:09,759 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 21:59:09,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 21:59:09,760 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 21:59:09,760 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 21:59:09,760 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:59:09,760 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 21:59:09,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 21:59:09,760 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 21:59:09,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 21:59:09,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 21:59:09,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 21:59:09,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 21:59:09,761 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 21:59:09,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 21:59:09,762 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7a4e3d1ef75cde0243f57ce4bcedb5827704adb835017a69deaa6c50c3201720 [2024-11-19 21:59:09,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 21:59:09,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 21:59:09,998 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 21:59:09,999 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 21:59:09,999 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 21:59:10,000 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product19.cil.c [2024-11-19 21:59:11,324 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 21:59:11,573 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 21:59:11,574 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product19.cil.c [2024-11-19 21:59:11,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a357c804a/2e6756ffd40644aea3d1b01c5354fead/FLAGd968435a6 [2024-11-19 21:59:11,599 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a357c804a/2e6756ffd40644aea3d1b01c5354fead [2024-11-19 21:59:11,601 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 21:59:11,602 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 21:59:11,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 21:59:11,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 21:59:11,609 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 21:59:11,610 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:59:11" (1/1) ... [2024-11-19 21:59:11,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@391c00b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:11, skipping insertion in model container [2024-11-19 21:59:11,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:59:11" (1/1) ... [2024-11-19 21:59:11,660 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 21:59:12,033 WARN L250 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_spec7_product19.cil.c[37206,37219] [2024-11-19 21:59:12,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:59:12,123 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 21:59:12,131 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [48] [2024-11-19 21:59:12,132 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [79] [2024-11-19 21:59:12,132 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [97] [2024-11-19 21:59:12,132 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [509] [2024-11-19 21:59:12,132 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [547] [2024-11-19 21:59:12,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [913] [2024-11-19 21:59:12,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1138] [2024-11-19 21:59:12,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1236] [2024-11-19 21:59:12,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1533] [2024-11-19 21:59:12,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1815] [2024-11-19 21:59:12,133 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1824] [2024-11-19 21:59:12,209 WARN L250 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_spec7_product19.cil.c[37206,37219] [2024-11-19 21:59:12,225 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:59:12,253 INFO L204 MainTranslator]: Completed translation [2024-11-19 21:59:12,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12 WrapperNode [2024-11-19 21:59:12,253 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 21:59:12,254 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 21:59:12,254 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 21:59:12,254 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 21:59:12,260 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... [2024-11-19 21:59:12,284 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... [2024-11-19 21:59:12,331 INFO L138 Inliner]: procedures = 127, calls = 184, calls flagged for inlining = 60, calls inlined = 55, statements flattened = 1003 [2024-11-19 21:59:12,332 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 21:59:12,332 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 21:59:12,332 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 21:59:12,332 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 21:59:12,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... [2024-11-19 21:59:12,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... [2024-11-19 21:59:12,347 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... [2024-11-19 21:59:12,366 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-11-19 21:59:12,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... [2024-11-19 21:59:12,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... [2024-11-19 21:59:12,377 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... [2024-11-19 21:59:12,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... [2024-11-19 21:59:12,387 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... [2024-11-19 21:59:12,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... [2024-11-19 21:59:12,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 21:59:12,407 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 21:59:12,407 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 21:59:12,407 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 21:59:12,408 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... [2024-11-19 21:59:12,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:59:12,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:59:12,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 21:59:12,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 21:59:12,487 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-19 21:59:12,488 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-19 21:59:12,488 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-19 21:59:12,488 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-19 21:59:12,488 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-19 21:59:12,488 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-19 21:59:12,488 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-19 21:59:12,489 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-19 21:59:12,489 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-19 21:59:12,489 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-19 21:59:12,489 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-19 21:59:12,489 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-19 21:59:12,489 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-19 21:59:12,489 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-19 21:59:12,490 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-19 21:59:12,490 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-19 21:59:12,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 21:59:12,490 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-19 21:59:12,490 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-19 21:59:12,491 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-19 21:59:12,491 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-19 21:59:12,491 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-19 21:59:12,491 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-19 21:59:12,491 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-19 21:59:12,492 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-19 21:59:12,492 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-19 21:59:12,492 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-19 21:59:12,492 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-19 21:59:12,492 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-19 21:59:12,492 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-19 21:59:12,493 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-19 21:59:12,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 21:59:12,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 21:59:12,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 21:59:12,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 21:59:12,493 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-19 21:59:12,493 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-19 21:59:12,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 21:59:12,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 21:59:12,640 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 21:59:12,642 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 21:59:13,338 INFO L? ?]: Removed 433 outVars from TransFormulas that were not future-live. [2024-11-19 21:59:13,338 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 21:59:13,396 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 21:59:13,396 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 21:59:13,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:59:13 BoogieIcfgContainer [2024-11-19 21:59:13,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 21:59:13,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 21:59:13,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 21:59:13,407 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 21:59:13,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:59:11" (1/3) ... [2024-11-19 21:59:13,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe742c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:59:13, skipping insertion in model container [2024-11-19 21:59:13,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (2/3) ... [2024-11-19 21:59:13,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe742c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:59:13, skipping insertion in model container [2024-11-19 21:59:13,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:59:13" (3/3) ... [2024-11-19 21:59:13,410 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec7_product19.cil.c [2024-11-19 21:59:13,423 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 21:59:13,424 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 21:59:13,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 21:59:13,509 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;@12787b63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 21:59:13,510 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 21:59:13,515 INFO L276 IsEmpty]: Start isEmpty. Operand has 301 states, 241 states have (on average 1.5352697095435686) internal successors, (370), 243 states have internal predecessors, (370), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-19 21:59:13,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-19 21:59:13,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:13,530 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] [2024-11-19 21:59:13,530 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:13,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:13,535 INFO L85 PathProgramCache]: Analyzing trace with hash 656283880, now seen corresponding path program 1 times [2024-11-19 21:59:13,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:13,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653408738] [2024-11-19 21:59:13,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:13,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:13,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:59:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:59:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:59:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:59:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-19 21:59:14,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-19 21:59:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:59:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:59:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,124 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 21:59:14,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:14,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653408738] [2024-11-19 21:59:14,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653408738] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:59:14,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801758030] [2024-11-19 21:59:14,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:14,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:59:14,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:59:14,131 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:59:14,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 21:59:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 21:59:14,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:59:14,387 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:59:14,387 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:59:14,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801758030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:14,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:59:14,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-19 21:59:14,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442169743] [2024-11-19 21:59:14,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:14,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 21:59:14,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:14,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 21:59:14,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:59:14,429 INFO L87 Difference]: Start difference. First operand has 301 states, 241 states have (on average 1.5352697095435686) internal successors, (370), 243 states have internal predecessors, (370), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:14,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:14,472 INFO L93 Difference]: Finished difference Result 448 states and 662 transitions. [2024-11-19 21:59:14,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 21:59:14,475 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 86 [2024-11-19 21:59:14,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:14,485 INFO L225 Difference]: With dead ends: 448 [2024-11-19 21:59:14,485 INFO L226 Difference]: Without dead ends: 294 [2024-11-19 21:59:14,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:59:14,491 INFO L432 NwaCegarLoop]: 450 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:14,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:59:14,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-19 21:59:14,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-11-19 21:59:14,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 235 states have (on average 1.5276595744680852) internal successors, (359), 236 states have internal predecessors, (359), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-19 21:59:14,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 442 transitions. [2024-11-19 21:59:14,579 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 442 transitions. Word has length 86 [2024-11-19 21:59:14,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:14,581 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 442 transitions. [2024-11-19 21:59:14,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:14,582 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 442 transitions. [2024-11-19 21:59:14,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-19 21:59:14,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:14,589 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] [2024-11-19 21:59:14,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 21:59:14,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 21:59:14,793 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:14,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:14,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1471014267, now seen corresponding path program 1 times [2024-11-19 21:59:14,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:14,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665008673] [2024-11-19 21:59:14,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:14,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:59:15,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:15,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:59:15,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:15,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:59:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:15,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-19 21:59:15,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:15,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:59:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:15,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-19 21:59:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:15,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:59:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:15,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:59:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 21:59:15,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:15,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665008673] [2024-11-19 21:59:15,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665008673] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:59:15,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673142112] [2024-11-19 21:59:15,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:15,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:59:15,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:59:15,042 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:59:15,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 21:59:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:15,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 932 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 21:59:15,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:59:15,281 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:59:15,281 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:59:15,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673142112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:15,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:59:15,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-19 21:59:15,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741579290] [2024-11-19 21:59:15,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:15,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 21:59:15,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:15,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 21:59:15,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:59:15,284 INFO L87 Difference]: Start difference. First operand 294 states and 442 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:15,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:15,333 INFO L93 Difference]: Finished difference Result 438 states and 643 transitions. [2024-11-19 21:59:15,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 21:59:15,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 87 [2024-11-19 21:59:15,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:15,336 INFO L225 Difference]: With dead ends: 438 [2024-11-19 21:59:15,336 INFO L226 Difference]: Without dead ends: 297 [2024-11-19 21:59:15,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:59:15,337 INFO L432 NwaCegarLoop]: 440 mSDtfsCounter, 1 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:15,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 878 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:59:15,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-19 21:59:15,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 296. [2024-11-19 21:59:15,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 237 states have (on average 1.5232067510548524) internal successors, (361), 238 states have internal predecessors, (361), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-19 21:59:15,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 444 transitions. [2024-11-19 21:59:15,357 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 444 transitions. Word has length 87 [2024-11-19 21:59:15,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:15,358 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 444 transitions. [2024-11-19 21:59:15,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:15,358 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 444 transitions. [2024-11-19 21:59:15,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 21:59:15,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:15,359 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] [2024-11-19 21:59:15,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 21:59:15,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-19 21:59:15,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:15,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:15,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1546828526, now seen corresponding path program 1 times [2024-11-19 21:59:15,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:15,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119215364] [2024-11-19 21:59:15,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:15,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:15,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:15,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:15,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:15,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:59:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:15,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:59:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:15,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:59:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:15,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-19 21:59:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:15,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-19 21:59:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:15,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:59:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:15,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:59:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:15,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-19 21:59:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:15,801 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 21:59:15,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:15,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119215364] [2024-11-19 21:59:15,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119215364] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:59:15,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079644523] [2024-11-19 21:59:15,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:15,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:59:15,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:59:15,808 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:59:15,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 21:59:16,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 944 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 21:59:16,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:59:16,072 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:59:16,074 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:59:16,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079644523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:16,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:59:16,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-19 21:59:16,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699594376] [2024-11-19 21:59:16,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:16,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 21:59:16,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:16,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 21:59:16,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:59:16,079 INFO L87 Difference]: Start difference. First operand 296 states and 444 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:16,107 INFO L93 Difference]: Finished difference Result 622 states and 947 transitions. [2024-11-19 21:59:16,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 21:59:16,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 93 [2024-11-19 21:59:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:16,111 INFO L225 Difference]: With dead ends: 622 [2024-11-19 21:59:16,112 INFO L226 Difference]: Without dead ends: 353 [2024-11-19 21:59:16,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:59:16,115 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 107 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:16,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 853 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:59:16,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2024-11-19 21:59:16,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 345. [2024-11-19 21:59:16,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 275 states have (on average 1.538181818181818) internal successors, (423), 276 states have internal predecessors, (423), 53 states have call successors, (53), 16 states have call predecessors, (53), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-19 21:59:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 528 transitions. [2024-11-19 21:59:16,139 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 528 transitions. Word has length 93 [2024-11-19 21:59:16,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:16,139 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 528 transitions. [2024-11-19 21:59:16,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:16,139 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 528 transitions. [2024-11-19 21:59:16,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 21:59:16,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:16,141 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] [2024-11-19 21:59:16,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 21:59:16,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:59:16,343 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:16,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:16,344 INFO L85 PathProgramCache]: Analyzing trace with hash -519295329, now seen corresponding path program 1 times [2024-11-19 21:59:16,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:16,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526734878] [2024-11-19 21:59:16,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:16,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:16,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:16,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:59:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:59:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:59:16,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-19 21:59:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-19 21:59:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 21:59:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:59:16,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:59:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 21:59:16,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:16,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526734878] [2024-11-19 21:59:16,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526734878] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:59:16,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986322349] [2024-11-19 21:59:16,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:16,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:59:16,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:59:16,512 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:59:16,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 21:59:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 21:59:16,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:59:16,751 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 21:59:16,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:59:16,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986322349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:16,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:59:16,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-19 21:59:16,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635866382] [2024-11-19 21:59:16,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:16,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:59:16,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:16,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:59:16,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:59:16,753 INFO L87 Difference]: Start difference. First operand 345 states and 528 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-19 21:59:16,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:16,790 INFO L93 Difference]: Finished difference Result 681 states and 1046 transitions. [2024-11-19 21:59:16,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:59:16,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 94 [2024-11-19 21:59:16,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:16,793 INFO L225 Difference]: With dead ends: 681 [2024-11-19 21:59:16,793 INFO L226 Difference]: Without dead ends: 347 [2024-11-19 21:59:16,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:59:16,795 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 2 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1725 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:16,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1725 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:59:16,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-19 21:59:16,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-11-19 21:59:16,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 276 states have (on average 1.536231884057971) internal successors, (424), 278 states have internal predecessors, (424), 53 states have call successors, (53), 16 states have call predecessors, (53), 17 states have return successors, (54), 52 states have call predecessors, (54), 52 states have call successors, (54) [2024-11-19 21:59:16,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 531 transitions. [2024-11-19 21:59:16,807 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 531 transitions. Word has length 94 [2024-11-19 21:59:16,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:16,807 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 531 transitions. [2024-11-19 21:59:16,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-19 21:59:16,808 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 531 transitions. [2024-11-19 21:59:16,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 21:59:16,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:16,809 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] [2024-11-19 21:59:16,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 21:59:17,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:59:17,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:17,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:17,010 INFO L85 PathProgramCache]: Analyzing trace with hash 600148154, now seen corresponding path program 1 times [2024-11-19 21:59:17,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:17,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747675445] [2024-11-19 21:59:17,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:17,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:59:17,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:59:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-19 21:59:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-19 21:59:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 21:59:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:59:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:59:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,231 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:59:17,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:17,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747675445] [2024-11-19 21:59:17,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747675445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:59:17,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060187183] [2024-11-19 21:59:17,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:17,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:59:17,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:59:17,237 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:59:17,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 21:59:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 950 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 21:59:17,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:59:17,508 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 21:59:17,510 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:59:17,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060187183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:17,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:59:17,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-19 21:59:17,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775261185] [2024-11-19 21:59:17,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:17,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:59:17,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:17,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:59:17,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-19 21:59:17,513 INFO L87 Difference]: Start difference. First operand 347 states and 531 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-19 21:59:17,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:17,567 INFO L93 Difference]: Finished difference Result 683 states and 1051 transitions. [2024-11-19 21:59:17,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:59:17,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 95 [2024-11-19 21:59:17,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:17,570 INFO L225 Difference]: With dead ends: 683 [2024-11-19 21:59:17,570 INFO L226 Difference]: Without dead ends: 349 [2024-11-19 21:59:17,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-19 21:59:17,572 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 2 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:17,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1711 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:59:17,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-11-19 21:59:17,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-11-19 21:59:17,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 277 states have (on average 1.5342960288808665) internal successors, (425), 280 states have internal predecessors, (425), 53 states have call successors, (53), 16 states have call predecessors, (53), 18 states have return successors, (59), 52 states have call predecessors, (59), 52 states have call successors, (59) [2024-11-19 21:59:17,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 537 transitions. [2024-11-19 21:59:17,590 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 537 transitions. Word has length 95 [2024-11-19 21:59:17,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:17,590 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 537 transitions. [2024-11-19 21:59:17,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-19 21:59:17,591 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 537 transitions. [2024-11-19 21:59:17,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 21:59:17,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:17,593 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] [2024-11-19 21:59:17,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 21:59:17,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:59:17,793 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:17,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:17,794 INFO L85 PathProgramCache]: Analyzing trace with hash -610725529, now seen corresponding path program 1 times [2024-11-19 21:59:17,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:17,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119085425] [2024-11-19 21:59:17,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:17,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:17,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:17,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-19 21:59:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-19 21:59:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-19 21:59:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:59:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-19 21:59:17,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-19 21:59:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,955 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 21:59:17,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:17,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119085425] [2024-11-19 21:59:17,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119085425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:17,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:17,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:59:17,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326980087] [2024-11-19 21:59:17,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:17,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:59:17,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:17,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:59:17,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:59:17,957 INFO L87 Difference]: Start difference. First operand 349 states and 537 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-19 21:59:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:19,457 INFO L93 Difference]: Finished difference Result 831 states and 1280 transitions. [2024-11-19 21:59:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 21:59:19,457 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 96 [2024-11-19 21:59:19,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:19,460 INFO L225 Difference]: With dead ends: 831 [2024-11-19 21:59:19,460 INFO L226 Difference]: Without dead ends: 505 [2024-11-19 21:59:19,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-19 21:59:19,462 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 948 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 1106 SdHoareTripleChecker+Invalid, 2592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:19,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 1106 Invalid, 2592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 21:59:19,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-19 21:59:19,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 349. [2024-11-19 21:59:19,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 277 states have (on average 1.5342960288808665) internal successors, (425), 280 states have internal predecessors, (425), 53 states have call successors, (53), 16 states have call predecessors, (53), 18 states have return successors, (58), 52 states have call predecessors, (58), 52 states have call successors, (58) [2024-11-19 21:59:19,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 536 transitions. [2024-11-19 21:59:19,483 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 536 transitions. Word has length 96 [2024-11-19 21:59:19,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:19,484 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 536 transitions. [2024-11-19 21:59:19,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-19 21:59:19,484 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 536 transitions. [2024-11-19 21:59:19,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 21:59:19,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:19,485 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] [2024-11-19 21:59:19,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 21:59:19,485 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:19,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:19,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1759702684, now seen corresponding path program 2 times [2024-11-19 21:59:19,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:19,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771226964] [2024-11-19 21:59:19,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:19,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:59:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-19 21:59:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:59:19,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-19 21:59:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-19 21:59:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:59:19,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,612 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 21:59:19,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:19,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771226964] [2024-11-19 21:59:19,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771226964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:19,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:19,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:59:19,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432121135] [2024-11-19 21:59:19,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:19,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:59:19,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:19,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:59:19,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:59:19,614 INFO L87 Difference]: Start difference. First operand 349 states and 536 transitions. Second operand has 9 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-19 21:59:21,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:21,054 INFO L93 Difference]: Finished difference Result 833 states and 1283 transitions. [2024-11-19 21:59:21,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 21:59:21,054 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2024-11-19 21:59:21,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:21,059 INFO L225 Difference]: With dead ends: 833 [2024-11-19 21:59:21,059 INFO L226 Difference]: Without dead ends: 507 [2024-11-19 21:59:21,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-19 21:59:21,061 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 948 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 2602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:21,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 1108 Invalid, 2602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 21:59:21,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-11-19 21:59:21,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 351. [2024-11-19 21:59:21,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 278 states have (on average 1.5323741007194245) internal successors, (426), 282 states have internal predecessors, (426), 53 states have call successors, (53), 16 states have call predecessors, (53), 19 states have return successors, (60), 52 states have call predecessors, (60), 52 states have call successors, (60) [2024-11-19 21:59:21,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 539 transitions. [2024-11-19 21:59:21,111 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 539 transitions. Word has length 97 [2024-11-19 21:59:21,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:21,115 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 539 transitions. [2024-11-19 21:59:21,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.75) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-19 21:59:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 539 transitions. [2024-11-19 21:59:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 21:59:21,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:21,116 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] [2024-11-19 21:59:21,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 21:59:21,117 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:21,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:21,117 INFO L85 PathProgramCache]: Analyzing trace with hash 827408162, now seen corresponding path program 1 times [2024-11-19 21:59:21,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:21,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72104389] [2024-11-19 21:59:21,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:21,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-19 21:59:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 21:59:21,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:59:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-19 21:59:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:59:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,305 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:59:21,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:21,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72104389] [2024-11-19 21:59:21,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72104389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:21,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:21,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 21:59:21,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029542345] [2024-11-19 21:59:21,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:21,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:59:21,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:21,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:59:21,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:59:21,307 INFO L87 Difference]: Start difference. First operand 351 states and 539 transitions. Second operand has 12 states, 11 states have (on average 6.0) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-19 21:59:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:23,340 INFO L93 Difference]: Finished difference Result 831 states and 1278 transitions. [2024-11-19 21:59:23,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 21:59:23,341 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 98 [2024-11-19 21:59:23,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:23,344 INFO L225 Difference]: With dead ends: 831 [2024-11-19 21:59:23,344 INFO L226 Difference]: Without dead ends: 507 [2024-11-19 21:59:23,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-19 21:59:23,346 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 948 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 3893 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 4150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 3893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:23,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 1533 Invalid, 4150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 3893 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 21:59:23,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-11-19 21:59:23,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 351. [2024-11-19 21:59:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 278 states have (on average 1.5323741007194245) internal successors, (426), 282 states have internal predecessors, (426), 53 states have call successors, (53), 16 states have call predecessors, (53), 19 states have return successors, (59), 52 states have call predecessors, (59), 52 states have call successors, (59) [2024-11-19 21:59:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 538 transitions. [2024-11-19 21:59:23,368 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 538 transitions. Word has length 98 [2024-11-19 21:59:23,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:23,368 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 538 transitions. [2024-11-19 21:59:23,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.0) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-19 21:59:23,369 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 538 transitions. [2024-11-19 21:59:23,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 21:59:23,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:23,370 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] [2024-11-19 21:59:23,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 21:59:23,370 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:23,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:23,370 INFO L85 PathProgramCache]: Analyzing trace with hash -173000395, now seen corresponding path program 2 times [2024-11-19 21:59:23,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:23,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884901737] [2024-11-19 21:59:23,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:23,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:23,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-19 21:59:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-19 21:59:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:59:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-19 21:59:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-19 21:59:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-19 21:59:23,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:23,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884901737] [2024-11-19 21:59:23,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884901737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:23,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:23,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 21:59:23,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378760888] [2024-11-19 21:59:23,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:23,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:59:23,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:23,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:59:23,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:59:23,565 INFO L87 Difference]: Start difference. First operand 351 states and 538 transitions. Second operand has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-19 21:59:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:25,490 INFO L93 Difference]: Finished difference Result 833 states and 1284 transitions. [2024-11-19 21:59:25,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 21:59:25,491 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 99 [2024-11-19 21:59:25,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:25,494 INFO L225 Difference]: With dead ends: 833 [2024-11-19 21:59:25,494 INFO L226 Difference]: Without dead ends: 509 [2024-11-19 21:59:25,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-19 21:59:25,495 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 944 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 3920 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 4174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 3920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:25,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 1534 Invalid, 4174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 3920 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 21:59:25,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-19 21:59:25,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 353. [2024-11-19 21:59:25,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 279 states have (on average 1.5304659498207884) internal successors, (427), 284 states have internal predecessors, (427), 53 states have call successors, (53), 16 states have call predecessors, (53), 20 states have return successors, (64), 52 states have call predecessors, (64), 52 states have call successors, (64) [2024-11-19 21:59:25,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 544 transitions. [2024-11-19 21:59:25,513 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 544 transitions. Word has length 99 [2024-11-19 21:59:25,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:25,513 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 544 transitions. [2024-11-19 21:59:25,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.090909090909091) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-19 21:59:25,513 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 544 transitions. [2024-11-19 21:59:25,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 21:59:25,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:25,514 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] [2024-11-19 21:59:25,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 21:59:25,515 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:25,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:25,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1019207715, now seen corresponding path program 1 times [2024-11-19 21:59:25,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:25,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994580917] [2024-11-19 21:59:25,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:25,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:25,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:25,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:25,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-19 21:59:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-19 21:59:25,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:59:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:59:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:59:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:59:25,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:25,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994580917] [2024-11-19 21:59:25,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994580917] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:59:25,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038278070] [2024-11-19 21:59:25,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:25,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:59:25,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:59:25,629 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:59:25,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 21:59:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 21:59:25,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:59:25,856 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:59:25,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:59:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:59:25,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038278070] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:59:25,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:59:25,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-11-19 21:59:25,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477263365] [2024-11-19 21:59:25,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:59:25,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 21:59:25,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:25,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 21:59:25,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:59:25,918 INFO L87 Difference]: Start difference. First operand 353 states and 544 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 21:59:27,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:27,070 INFO L93 Difference]: Finished difference Result 1002 states and 1612 transitions. [2024-11-19 21:59:27,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 21:59:27,071 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 100 [2024-11-19 21:59:27,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:27,081 INFO L225 Difference]: With dead ends: 1002 [2024-11-19 21:59:27,081 INFO L226 Difference]: Without dead ends: 861 [2024-11-19 21:59:27,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-19 21:59:27,083 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 1564 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1609 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 1910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:27,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1609 Valid, 1310 Invalid, 1910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 21:59:27,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-11-19 21:59:27,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 681. [2024-11-19 21:59:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 543 states have (on average 1.5930018416206262) internal successors, (865), 548 states have internal predecessors, (865), 117 states have call successors, (117), 16 states have call predecessors, (117), 20 states have return successors, (138), 116 states have call predecessors, (138), 116 states have call successors, (138) [2024-11-19 21:59:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1120 transitions. [2024-11-19 21:59:27,143 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1120 transitions. Word has length 100 [2024-11-19 21:59:27,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:27,146 INFO L471 AbstractCegarLoop]: Abstraction has 681 states and 1120 transitions. [2024-11-19 21:59:27,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 7 states have internal predecessors, (92), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 21:59:27,147 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1120 transitions. [2024-11-19 21:59:27,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-19 21:59:27,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:27,149 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] [2024-11-19 21:59:27,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 21:59:27,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:59:27,350 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:27,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:27,351 INFO L85 PathProgramCache]: Analyzing trace with hash -123309536, now seen corresponding path program 1 times [2024-11-19 21:59:27,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:27,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067528472] [2024-11-19 21:59:27,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:27,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:27,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:27,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-19 21:59:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:59:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:59:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:59:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-19 21:59:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,536 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:59:27,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:27,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067528472] [2024-11-19 21:59:27,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067528472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:27,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:27,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:59:27,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206884841] [2024-11-19 21:59:27,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:27,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:59:27,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:27,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:59:27,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:59:27,538 INFO L87 Difference]: Start difference. First operand 681 states and 1120 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:28,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:28,599 INFO L93 Difference]: Finished difference Result 1783 states and 2983 transitions. [2024-11-19 21:59:28,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:59:28,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2024-11-19 21:59:28,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:28,606 INFO L225 Difference]: With dead ends: 1783 [2024-11-19 21:59:28,606 INFO L226 Difference]: Without dead ends: 1170 [2024-11-19 21:59:28,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:59:28,609 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1054 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 1342 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1069 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 1656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 1342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:28,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1069 Valid, 834 Invalid, 1656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 1342 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 21:59:28,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2024-11-19 21:59:28,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1006. [2024-11-19 21:59:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 804 states have (on average 1.6044776119402986) internal successors, (1290), 809 states have internal predecessors, (1290), 181 states have call successors, (181), 16 states have call predecessors, (181), 20 states have return successors, (212), 180 states have call predecessors, (212), 180 states have call successors, (212) [2024-11-19 21:59:28,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1683 transitions. [2024-11-19 21:59:28,642 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1683 transitions. Word has length 106 [2024-11-19 21:59:28,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:28,642 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1683 transitions. [2024-11-19 21:59:28,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1683 transitions. [2024-11-19 21:59:28,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 21:59:28,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:28,646 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] [2024-11-19 21:59:28,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 21:59:28,646 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:28,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:28,646 INFO L85 PathProgramCache]: Analyzing trace with hash -939436204, now seen corresponding path program 1 times [2024-11-19 21:59:28,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:28,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780498203] [2024-11-19 21:59:28,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:28,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:28,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-19 21:59:28,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:59:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:59:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:59:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-19 21:59:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,729 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:59:28,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:28,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780498203] [2024-11-19 21:59:28,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780498203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:28,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:28,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:59:28,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906529709] [2024-11-19 21:59:28,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:28,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:59:28,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:28,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:59:28,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:59:28,730 INFO L87 Difference]: Start difference. First operand 1006 states and 1683 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:29,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:29,795 INFO L93 Difference]: Finished difference Result 2563 states and 4332 transitions. [2024-11-19 21:59:29,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:59:29,795 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2024-11-19 21:59:29,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:29,802 INFO L225 Difference]: With dead ends: 2563 [2024-11-19 21:59:29,802 INFO L226 Difference]: Without dead ends: 1678 [2024-11-19 21:59:29,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:59:29,806 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 1051 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1066 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:29,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1066 Valid, 820 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 21:59:29,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2024-11-19 21:59:29,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1514. [2024-11-19 21:59:29,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1514 states, 1217 states have (on average 1.6113393590797043) internal successors, (1961), 1222 states have internal predecessors, (1961), 276 states have call successors, (276), 16 states have call predecessors, (276), 20 states have return successors, (307), 275 states have call predecessors, (307), 275 states have call successors, (307) [2024-11-19 21:59:29,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1514 states to 1514 states and 2544 transitions. [2024-11-19 21:59:29,853 INFO L78 Accepts]: Start accepts. Automaton has 1514 states and 2544 transitions. Word has length 107 [2024-11-19 21:59:29,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:29,853 INFO L471 AbstractCegarLoop]: Abstraction has 1514 states and 2544 transitions. [2024-11-19 21:59:29,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:29,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1514 states and 2544 transitions. [2024-11-19 21:59:29,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 21:59:29,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:29,858 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] [2024-11-19 21:59:29,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 21:59:29,858 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:29,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:29,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1004305410, now seen corresponding path program 1 times [2024-11-19 21:59:29,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:29,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731652999] [2024-11-19 21:59:29,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:29,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:29,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:29,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:29,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:29,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:29,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:29,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:29,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:29,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 21:59:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:29,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:59:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:29,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-19 21:59:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:29,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:59:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:29,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:59:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:29,930 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:59:29,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:29,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731652999] [2024-11-19 21:59:29,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731652999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:29,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:29,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:59:29,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298411700] [2024-11-19 21:59:29,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:29,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:59:29,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:29,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:59:29,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:59:29,932 INFO L87 Difference]: Start difference. First operand 1514 states and 2544 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:31,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:31,041 INFO L93 Difference]: Finished difference Result 3715 states and 6341 transitions. [2024-11-19 21:59:31,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:59:31,042 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-11-19 21:59:31,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:31,051 INFO L225 Difference]: With dead ends: 3715 [2024-11-19 21:59:31,051 INFO L226 Difference]: Without dead ends: 2447 [2024-11-19 21:59:31,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:59:31,055 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 1048 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:31,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 811 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 21:59:31,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2024-11-19 21:59:31,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 2283. [2024-11-19 21:59:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2283 states, 1863 states have (on average 1.6167471819645733) internal successors, (3012), 1868 states have internal predecessors, (3012), 399 states have call successors, (399), 16 states have call predecessors, (399), 20 states have return successors, (446), 398 states have call predecessors, (446), 398 states have call successors, (446) [2024-11-19 21:59:31,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2283 states to 2283 states and 3857 transitions. [2024-11-19 21:59:31,115 INFO L78 Accepts]: Start accepts. Automaton has 2283 states and 3857 transitions. Word has length 108 [2024-11-19 21:59:31,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:31,115 INFO L471 AbstractCegarLoop]: Abstraction has 2283 states and 3857 transitions. [2024-11-19 21:59:31,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:31,115 INFO L276 IsEmpty]: Start isEmpty. Operand 2283 states and 3857 transitions. [2024-11-19 21:59:31,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 21:59:31,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:31,120 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] [2024-11-19 21:59:31,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 21:59:31,120 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:31,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:31,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1214672019, now seen corresponding path program 1 times [2024-11-19 21:59:31,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:31,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421966057] [2024-11-19 21:59:31,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:31,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:31,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:31,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:31,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:31,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:31,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:31,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:31,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:31,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-19 21:59:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:31,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 21:59:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:31,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:59:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:31,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:59:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:31,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:59:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:31,189 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:59:31,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:31,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421966057] [2024-11-19 21:59:31,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421966057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:31,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:31,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:59:31,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937604169] [2024-11-19 21:59:31,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:31,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:59:31,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:31,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:59:31,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:59:31,190 INFO L87 Difference]: Start difference. First operand 2283 states and 3857 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:32,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:32,286 INFO L93 Difference]: Finished difference Result 5509 states and 9475 transitions. [2024-11-19 21:59:32,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:59:32,286 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2024-11-19 21:59:32,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:32,300 INFO L225 Difference]: With dead ends: 5509 [2024-11-19 21:59:32,300 INFO L226 Difference]: Without dead ends: 3676 [2024-11-19 21:59:32,304 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:59:32,305 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 1047 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 1636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:32,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 810 Invalid, 1636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 21:59:32,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2024-11-19 21:59:32,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3512. [2024-11-19 21:59:32,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3512 states, 2913 states have (on average 1.619979402677652) internal successors, (4719), 2918 states have internal predecessors, (4719), 578 states have call successors, (578), 16 states have call predecessors, (578), 20 states have return successors, (651), 577 states have call predecessors, (651), 577 states have call successors, (651) [2024-11-19 21:59:32,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3512 states to 3512 states and 5948 transitions. [2024-11-19 21:59:32,409 INFO L78 Accepts]: Start accepts. Automaton has 3512 states and 5948 transitions. Word has length 109 [2024-11-19 21:59:32,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:32,410 INFO L471 AbstractCegarLoop]: Abstraction has 3512 states and 5948 transitions. [2024-11-19 21:59:32,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:32,410 INFO L276 IsEmpty]: Start isEmpty. Operand 3512 states and 5948 transitions. [2024-11-19 21:59:32,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 21:59:32,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:32,416 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] [2024-11-19 21:59:32,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 21:59:32,416 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:32,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:32,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1692208126, now seen corresponding path program 1 times [2024-11-19 21:59:32,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:32,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884163481] [2024-11-19 21:59:32,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:32,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:32,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:32,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:32,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:32,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:32,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:32,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:32,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:32,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 21:59:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:32,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 21:59:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:32,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:59:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:32,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:59:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:32,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:59:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:32,493 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:59:32,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:32,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884163481] [2024-11-19 21:59:32,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884163481] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:32,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:32,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:59:32,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492669604] [2024-11-19 21:59:32,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:32,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:59:32,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:32,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:59:32,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:59:32,495 INFO L87 Difference]: Start difference. First operand 3512 states and 5948 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:33,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:33,627 INFO L93 Difference]: Finished difference Result 8457 states and 14622 transitions. [2024-11-19 21:59:33,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:59:33,627 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2024-11-19 21:59:33,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:33,649 INFO L225 Difference]: With dead ends: 8457 [2024-11-19 21:59:33,650 INFO L226 Difference]: Without dead ends: 5707 [2024-11-19 21:59:33,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:59:33,659 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1045 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1060 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:33,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1060 Valid, 851 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 21:59:33,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5707 states. [2024-11-19 21:59:33,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5707 to 5543. [2024-11-19 21:59:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5543 states, 4568 states have (on average 1.6136164623467601) internal successors, (7371), 4573 states have internal predecessors, (7371), 954 states have call successors, (954), 16 states have call predecessors, (954), 20 states have return successors, (1071), 953 states have call predecessors, (1071), 953 states have call successors, (1071) [2024-11-19 21:59:33,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5543 states to 5543 states and 9396 transitions. [2024-11-19 21:59:33,872 INFO L78 Accepts]: Start accepts. Automaton has 5543 states and 9396 transitions. Word has length 110 [2024-11-19 21:59:33,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:33,873 INFO L471 AbstractCegarLoop]: Abstraction has 5543 states and 9396 transitions. [2024-11-19 21:59:33,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:33,873 INFO L276 IsEmpty]: Start isEmpty. Operand 5543 states and 9396 transitions. [2024-11-19 21:59:33,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 21:59:33,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:33,881 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] [2024-11-19 21:59:33,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 21:59:33,881 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:33,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:33,881 INFO L85 PathProgramCache]: Analyzing trace with hash 648134799, now seen corresponding path program 1 times [2024-11-19 21:59:33,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:33,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175792697] [2024-11-19 21:59:33,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:33,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:33,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:59:33,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:59:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-19 21:59:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-19 21:59:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-19 21:59:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:59:33,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:33,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175792697] [2024-11-19 21:59:33,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175792697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:33,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:33,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:59:33,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573640979] [2024-11-19 21:59:33,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:33,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:59:33,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:33,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:59:33,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:59:33,952 INFO L87 Difference]: Start difference. First operand 5543 states and 9396 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:35,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:35,189 INFO L93 Difference]: Finished difference Result 13794 states and 23843 transitions. [2024-11-19 21:59:35,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:59:35,190 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2024-11-19 21:59:35,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:35,226 INFO L225 Difference]: With dead ends: 13794 [2024-11-19 21:59:35,226 INFO L226 Difference]: Without dead ends: 9390 [2024-11-19 21:59:35,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:59:35,239 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 1043 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1058 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 1657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:35,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1058 Valid, 819 Invalid, 1657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1337 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 21:59:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9390 states. [2024-11-19 21:59:35,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9390 to 9226. [2024-11-19 21:59:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9226 states, 7645 states have (on average 1.6111183780248528) internal successors, (12317), 7650 states have internal predecessors, (12317), 1560 states have call successors, (1560), 16 states have call predecessors, (1560), 20 states have return successors, (1755), 1559 states have call predecessors, (1755), 1559 states have call successors, (1755) [2024-11-19 21:59:35,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9226 states to 9226 states and 15632 transitions. [2024-11-19 21:59:35,523 INFO L78 Accepts]: Start accepts. Automaton has 9226 states and 15632 transitions. Word has length 111 [2024-11-19 21:59:35,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:35,523 INFO L471 AbstractCegarLoop]: Abstraction has 9226 states and 15632 transitions. [2024-11-19 21:59:35,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:35,524 INFO L276 IsEmpty]: Start isEmpty. Operand 9226 states and 15632 transitions. [2024-11-19 21:59:35,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 21:59:35,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:35,534 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] [2024-11-19 21:59:35,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 21:59:35,534 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:35,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:35,534 INFO L85 PathProgramCache]: Analyzing trace with hash 841308180, now seen corresponding path program 1 times [2024-11-19 21:59:35,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:35,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676594917] [2024-11-19 21:59:35,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:35,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:35,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:35,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:35,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:35,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:35,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:35,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:35,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:35,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:35,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:59:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:35,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-19 21:59:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:35,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:59:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:35,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-19 21:59:35,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:35,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 21:59:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:35,616 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:59:35,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:35,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676594917] [2024-11-19 21:59:35,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676594917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:35,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:35,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:59:35,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765862246] [2024-11-19 21:59:35,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:35,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:59:35,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:35,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:59:35,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:59:35,617 INFO L87 Difference]: Start difference. First operand 9226 states and 15632 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:36,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:36,967 INFO L93 Difference]: Finished difference Result 23978 states and 41389 transitions. [2024-11-19 21:59:36,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:59:36,967 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2024-11-19 21:59:36,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:37,009 INFO L225 Difference]: With dead ends: 23978 [2024-11-19 21:59:37,009 INFO L226 Difference]: Without dead ends: 16343 [2024-11-19 21:59:37,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:59:37,026 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1042 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 1358 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 1358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:37,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 848 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 1358 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 21:59:37,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16343 states. [2024-11-19 21:59:37,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16343 to 16179. [2024-11-19 21:59:37,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16179 states, 13395 states have (on average 1.6020156774916015) internal successors, (21459), 13400 states have internal predecessors, (21459), 2763 states have call successors, (2763), 16 states have call predecessors, (2763), 20 states have return successors, (3102), 2762 states have call predecessors, (3102), 2762 states have call successors, (3102) [2024-11-19 21:59:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16179 states to 16179 states and 27324 transitions. [2024-11-19 21:59:37,516 INFO L78 Accepts]: Start accepts. Automaton has 16179 states and 27324 transitions. Word has length 112 [2024-11-19 21:59:37,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:37,516 INFO L471 AbstractCegarLoop]: Abstraction has 16179 states and 27324 transitions. [2024-11-19 21:59:37,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:37,517 INFO L276 IsEmpty]: Start isEmpty. Operand 16179 states and 27324 transitions. [2024-11-19 21:59:37,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 21:59:37,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:37,531 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] [2024-11-19 21:59:37,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 21:59:37,532 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:37,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:37,532 INFO L85 PathProgramCache]: Analyzing trace with hash 481953966, now seen corresponding path program 1 times [2024-11-19 21:59:37,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:37,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120264030] [2024-11-19 21:59:37,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:37,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:37,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:37,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:37,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:37,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:37,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:37,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:37,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:37,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:59:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:37,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:59:37,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:37,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:59:37,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:37,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-19 21:59:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:37,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-19 21:59:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:37,637 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:59:37,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:37,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120264030] [2024-11-19 21:59:37,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120264030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:37,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:37,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:59:37,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64755996] [2024-11-19 21:59:37,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:37,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:59:37,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:37,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:59:37,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:59:37,640 INFO L87 Difference]: Start difference. First operand 16179 states and 27324 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:39,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:39,393 INFO L93 Difference]: Finished difference Result 42944 states and 73988 transitions. [2024-11-19 21:59:39,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:59:39,393 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2024-11-19 21:59:39,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:39,497 INFO L225 Difference]: With dead ends: 42944 [2024-11-19 21:59:39,497 INFO L226 Difference]: Without dead ends: 28998 [2024-11-19 21:59:39,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:59:39,529 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 1039 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:39,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 811 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 21:59:39,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28998 states. [2024-11-19 21:59:40,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28998 to 28834. [2024-11-19 21:59:40,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28834 states, 24011 states have (on average 1.5977260422306443) internal successors, (38363), 24016 states have internal predecessors, (38363), 4802 states have call successors, (4802), 16 states have call predecessors, (4802), 20 states have return successors, (5415), 4801 states have call predecessors, (5415), 4801 states have call successors, (5415) [2024-11-19 21:59:40,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28834 states to 28834 states and 48580 transitions. [2024-11-19 21:59:40,324 INFO L78 Accepts]: Start accepts. Automaton has 28834 states and 48580 transitions. Word has length 113 [2024-11-19 21:59:40,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:40,325 INFO L471 AbstractCegarLoop]: Abstraction has 28834 states and 48580 transitions. [2024-11-19 21:59:40,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:40,326 INFO L276 IsEmpty]: Start isEmpty. Operand 28834 states and 48580 transitions. [2024-11-19 21:59:40,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 21:59:40,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:40,496 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:40,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 21:59:40,497 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:40,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:40,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1928279346, now seen corresponding path program 1 times [2024-11-19 21:59:40,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:40,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623292332] [2024-11-19 21:59:40,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:40,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:40,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:40,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:40,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:40,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:40,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:40,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:40,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:40,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:40,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:40,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 21:59:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:40,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:59:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:40,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:59:40,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:40,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:59:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:40,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-19 21:59:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:40,575 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:59:40,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:40,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623292332] [2024-11-19 21:59:40,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623292332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:40,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:40,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:59:40,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370979120] [2024-11-19 21:59:40,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:40,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:59:40,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:40,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:59:40,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:59:40,577 INFO L87 Difference]: Start difference. First operand 28834 states and 48580 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:42,673 INFO L93 Difference]: Finished difference Result 78706 states and 134747 transitions. [2024-11-19 21:59:42,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:59:42,674 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 114 [2024-11-19 21:59:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:42,832 INFO L225 Difference]: With dead ends: 78706 [2024-11-19 21:59:42,832 INFO L226 Difference]: Without dead ends: 52877 [2024-11-19 21:59:42,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:59:42,893 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 1037 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1052 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:42,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1052 Valid, 817 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 21:59:42,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52877 states. [2024-11-19 21:59:44,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52877 to 52713. [2024-11-19 21:59:44,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52713 states, 44175 states have (on average 1.5921222410865874) internal successors, (70332), 44180 states have internal predecessors, (70332), 8517 states have call successors, (8517), 16 states have call predecessors, (8517), 20 states have return successors, (9662), 8516 states have call predecessors, (9662), 8516 states have call successors, (9662) [2024-11-19 21:59:44,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52713 states to 52713 states and 88511 transitions. [2024-11-19 21:59:44,760 INFO L78 Accepts]: Start accepts. Automaton has 52713 states and 88511 transitions. Word has length 114 [2024-11-19 21:59:44,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:44,761 INFO L471 AbstractCegarLoop]: Abstraction has 52713 states and 88511 transitions. [2024-11-19 21:59:44,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:44,761 INFO L276 IsEmpty]: Start isEmpty. Operand 52713 states and 88511 transitions. [2024-11-19 21:59:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 21:59:45,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:45,114 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:45,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 21:59:45,114 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:45,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:45,118 INFO L85 PathProgramCache]: Analyzing trace with hash 329987790, now seen corresponding path program 1 times [2024-11-19 21:59:45,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:45,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151415252] [2024-11-19 21:59:45,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:45,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:45,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:45,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:45,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 21:59:45,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:59:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:59:45,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:59:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-19 21:59:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:59:45,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:45,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151415252] [2024-11-19 21:59:45,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151415252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:45,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:45,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:59:45,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240083165] [2024-11-19 21:59:45,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:45,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:59:45,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:45,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:59:45,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:59:45,249 INFO L87 Difference]: Start difference. First operand 52713 states and 88511 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:47,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:47,957 INFO L93 Difference]: Finished difference Result 98477 states and 168934 transitions. [2024-11-19 21:59:47,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:59:47,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2024-11-19 21:59:47,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:48,642 INFO L225 Difference]: With dead ends: 98477 [2024-11-19 21:59:48,642 INFO L226 Difference]: Without dead ends: 98336 [2024-11-19 21:59:48,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:59:48,681 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1033 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:48,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 848 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 21:59:48,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98336 states. [2024-11-19 21:59:51,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98336 to 98172. [2024-11-19 21:59:51,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98172 states, 82835 states have (on average 1.585102915434297) internal successors, (131302), 82840 states have internal predecessors, (131302), 15316 states have call successors, (15316), 16 states have call predecessors, (15316), 20 states have return successors, (17507), 15315 states have call predecessors, (17507), 15315 states have call successors, (17507) [2024-11-19 21:59:52,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98172 states to 98172 states and 164125 transitions. [2024-11-19 21:59:52,099 INFO L78 Accepts]: Start accepts. Automaton has 98172 states and 164125 transitions. Word has length 115 [2024-11-19 21:59:52,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:52,100 INFO L471 AbstractCegarLoop]: Abstraction has 98172 states and 164125 transitions. [2024-11-19 21:59:52,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:59:52,100 INFO L276 IsEmpty]: Start isEmpty. Operand 98172 states and 164125 transitions. [2024-11-19 21:59:52,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 21:59:52,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:52,125 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:52,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 21:59:52,125 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:52,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:52,125 INFO L85 PathProgramCache]: Analyzing trace with hash -737519213, now seen corresponding path program 1 times [2024-11-19 21:59:52,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:52,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509269312] [2024-11-19 21:59:52,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:52,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:52,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:52,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:52,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:52,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:52,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:52,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:52,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:59:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:52,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:59:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:52,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:59:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:52,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:59:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:52,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-19 21:59:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:52,358 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-19 21:59:52,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:52,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509269312] [2024-11-19 21:59:52,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509269312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:52,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:52,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:59:52,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483358067] [2024-11-19 21:59:52,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:52,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:59:52,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:52,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:59:52,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:59:52,361 INFO L87 Difference]: Start difference. First operand 98172 states and 164125 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 21:59:55,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:55,487 INFO L93 Difference]: Finished difference Result 98326 states and 167632 transitions. [2024-11-19 21:59:55,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 21:59:55,487 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 116 [2024-11-19 21:59:55,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:55,511 INFO L225 Difference]: With dead ends: 98326 [2024-11-19 21:59:55,511 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 21:59:55,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2024-11-19 21:59:55,661 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 939 mSDsluCounter, 937 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:55,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 1117 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 2318 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 21:59:55,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 21:59:55,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 21:59:55,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 21:59:55,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 21:59:55,685 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2024-11-19 21:59:55,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:55,685 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 21:59:55,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 4 states have internal predecessors, (79), 1 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 21:59:55,686 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 21:59:55,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 21:59:55,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 21:59:55,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 21:59:55,693 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:55,694 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.