./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_spec3_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_spec3_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 0eb0a93133a0d165b4e13ef7269be4b8c3f0f81976a167102da919b09b6c6616 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 21:54:30,938 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 21:54:30,994 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 21:54:31,000 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 21:54:31,001 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 21:54:31,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 21:54:31,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 21:54:31,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 21:54:31,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 21:54:31,024 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 21:54:31,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 21:54:31,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 21:54:31,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 21:54:31,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 21:54:31,026 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 21:54:31,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 21:54:31,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 21:54:31,027 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 21:54:31,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 21:54:31,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 21:54:31,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 21:54:31,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 21:54:31,029 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 21:54:31,029 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 21:54:31,029 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 21:54:31,029 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 21:54:31,029 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 21:54:31,030 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 21:54:31,030 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 21:54:31,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 21:54:31,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 21:54:31,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 21:54:31,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:54:31,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 21:54:31,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 21:54:31,031 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 21:54:31,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 21:54:31,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 21:54:31,032 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 21:54:31,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 21:54:31,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 21:54:31,033 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 21:54:31,035 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 -> 0eb0a93133a0d165b4e13ef7269be4b8c3f0f81976a167102da919b09b6c6616 [2024-11-19 21:54:31,254 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 21:54:31,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 21:54:31,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 21:54:31,282 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 21:54:31,283 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 21:54:31,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product19.cil.c [2024-11-19 21:54:32,479 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 21:54:32,734 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 21:54:32,735 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product19.cil.c [2024-11-19 21:54:32,752 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6476d729/d5985e567685418787e01c94c7a076fb/FLAG2520c9d8b [2024-11-19 21:54:33,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6476d729/d5985e567685418787e01c94c7a076fb [2024-11-19 21:54:33,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 21:54:33,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 21:54:33,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 21:54:33,055 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 21:54:33,059 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 21:54:33,059 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:54:33" (1/1) ... [2024-11-19 21:54:33,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61a339b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33, skipping insertion in model container [2024-11-19 21:54:33,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:54:33" (1/1) ... [2024-11-19 21:54:33,114 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 21:54:33,386 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_spec3_product19.cil.c[8336,8349] [2024-11-19 21:54:33,591 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:54:33,603 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 21:54:33,621 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2024-11-19 21:54:33,622 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [66] [2024-11-19 21:54:33,622 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [115] [2024-11-19 21:54:33,622 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [431] [2024-11-19 21:54:33,622 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [440] [2024-11-19 21:54:33,623 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [498] [2024-11-19 21:54:33,623 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [723] [2024-11-19 21:54:33,623 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [821] [2024-11-19 21:54:33,623 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1895] [2024-11-19 21:54:33,623 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2170] [2024-11-19 21:54:33,623 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2571] [2024-11-19 21:54:33,634 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_spec3_product19.cil.c[8336,8349] [2024-11-19 21:54:33,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:54:33,723 INFO L204 MainTranslator]: Completed translation [2024-11-19 21:54:33,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33 WrapperNode [2024-11-19 21:54:33,723 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 21:54:33,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 21:54:33,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 21:54:33,725 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 21:54:33,730 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:54:33" (1/1) ... [2024-11-19 21:54:33,762 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:54:33" (1/1) ... [2024-11-19 21:54:33,816 INFO L138 Inliner]: procedures = 128, calls = 192, calls flagged for inlining = 58, calls inlined = 53, statements flattened = 979 [2024-11-19 21:54:33,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 21:54:33,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 21:54:33,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 21:54:33,820 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 21:54:33,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 21:54:33,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 21:54:33,835 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 21:54:33,858 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:54:33,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 21:54:33,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 21:54:33,869 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 21:54:33,874 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 21:54:33,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 21:54:33,881 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 21:54:33,886 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 21:54:33,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 21:54:33,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 21:54:33,887 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 21:54:33,887 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (1/1) ... [2024-11-19 21:54:33,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:54:33,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:54:33,928 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:54:33,934 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:54:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-19 21:54:33,970 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-19 21:54:33,970 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-19 21:54:33,970 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-19 21:54:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-19 21:54:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-19 21:54:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-19 21:54:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-19 21:54:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-19 21:54:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-19 21:54:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-19 21:54:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-19 21:54:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-19 21:54:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-19 21:54:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-19 21:54:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-19 21:54:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 21:54:33,971 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-19 21:54:33,971 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-19 21:54:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-11-19 21:54:33,972 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-11-19 21:54:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-19 21:54:33,972 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-19 21:54:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-11-19 21:54:33,972 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-11-19 21:54:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-19 21:54:33,972 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-19 21:54:33,972 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-19 21:54:33,973 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-19 21:54:33,973 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-19 21:54:33,973 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-19 21:54:33,976 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-19 21:54:33,976 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-19 21:54:33,976 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-19 21:54:33,976 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-19 21:54:33,976 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-19 21:54:33,976 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-19 21:54:33,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 21:54:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 21:54:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 21:54:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 21:54:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-19 21:54:33,977 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-19 21:54:33,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 21:54:33,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 21:54:34,129 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 21:54:34,131 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 21:54:34,812 INFO L? ?]: Removed 433 outVars from TransFormulas that were not future-live. [2024-11-19 21:54:34,812 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 21:54:34,832 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 21:54:34,832 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 21:54:34,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:54:34 BoogieIcfgContainer [2024-11-19 21:54:34,833 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 21:54:34,834 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 21:54:34,834 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 21:54:34,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 21:54:34,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:54:33" (1/3) ... [2024-11-19 21:54:34,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3935c9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:54:34, skipping insertion in model container [2024-11-19 21:54:34,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:54:33" (2/3) ... [2024-11-19 21:54:34,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3935c9a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:54:34, skipping insertion in model container [2024-11-19 21:54:34,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:54:34" (3/3) ... [2024-11-19 21:54:34,840 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec3_product19.cil.c [2024-11-19 21:54:34,854 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 21:54:34,856 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 21:54:34,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 21:54:34,927 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;@4f572aa2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 21:54:34,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 21:54:34,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 323 states, 252 states have (on average 1.5198412698412698) internal successors, (383), 256 states have internal predecessors, (383), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-19 21:54:34,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 21:54:34,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:34,959 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:34,959 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:34,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:34,965 INFO L85 PathProgramCache]: Analyzing trace with hash 900815450, now seen corresponding path program 1 times [2024-11-19 21:54:34,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:34,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092668772] [2024-11-19 21:54:34,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:34,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:35,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:35,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:35,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:35,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:35,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:35,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:54:35,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:35,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:54:35,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:35,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:54:35,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:35,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:54:35,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:35,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-19 21:54:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:35,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-19 21:54:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:35,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:54:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:35,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:54:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:35,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:54:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:35,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:54:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:35,630 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:54:35,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:35,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092668772] [2024-11-19 21:54:35,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092668772] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:54:35,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36921105] [2024-11-19 21:54:35,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:35,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:54:35,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:54:35,635 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:54:35,642 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:54:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:35,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 21:54:35,924 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:54:35,944 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:54:35,947 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:54:35,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36921105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:35,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:54:35,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-19 21:54:35,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130998413] [2024-11-19 21:54:35,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:35,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 21:54:35,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:35,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 21:54:35,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:54:35,979 INFO L87 Difference]: Start difference. First operand has 323 states, 252 states have (on average 1.5198412698412698) internal successors, (383), 256 states have internal predecessors, (383), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:54:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:36,019 INFO L93 Difference]: Finished difference Result 491 states and 720 transitions. [2024-11-19 21:54:36,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 21:54:36,021 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 103 [2024-11-19 21:54:36,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:36,038 INFO L225 Difference]: With dead ends: 491 [2024-11-19 21:54:36,038 INFO L226 Difference]: Without dead ends: 315 [2024-11-19 21:54:36,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 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:54:36,050 INFO L432 NwaCegarLoop]: 477 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, 477 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:54:36,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:54:36,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-19 21:54:36,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2024-11-19 21:54:36,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 246 states have (on average 1.5121951219512195) internal successors, (372), 248 states have internal predecessors, (372), 50 states have call successors, (50), 19 states have call predecessors, (50), 18 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-19 21:54:36,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 469 transitions. [2024-11-19 21:54:36,121 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 469 transitions. Word has length 103 [2024-11-19 21:54:36,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:36,122 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 469 transitions. [2024-11-19 21:54:36,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:54:36,123 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 469 transitions. [2024-11-19 21:54:36,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 21:54:36,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:36,127 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:36,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 21:54:36,328 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:54:36,328 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:36,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:36,329 INFO L85 PathProgramCache]: Analyzing trace with hash -2044639414, now seen corresponding path program 1 times [2024-11-19 21:54:36,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:36,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888429476] [2024-11-19 21:54:36,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:36,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:36,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:36,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:36,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:36,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:36,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:36,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:54:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:36,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:54:36,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:36,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:54:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:36,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-19 21:54:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:36,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:54:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:36,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-19 21:54:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:36,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:54:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:36,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:54:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:36,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:54:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:36,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:54:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:36,598 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:54:36,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:36,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888429476] [2024-11-19 21:54:36,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888429476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:54:36,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86612630] [2024-11-19 21:54:36,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:36,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:54:36,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:54:36,604 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:54:36,605 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:54:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:36,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 21:54:36,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:54:36,847 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:54:36,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:54:36,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86612630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:36,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:54:36,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-19 21:54:36,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914551035] [2024-11-19 21:54:36,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:36,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 21:54:36,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:36,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 21:54:36,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:54:36,855 INFO L87 Difference]: Start difference. First operand 315 states and 469 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:54:36,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:36,906 INFO L93 Difference]: Finished difference Result 480 states and 697 transitions. [2024-11-19 21:54:36,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 21:54:36,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2024-11-19 21:54:36,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:36,911 INFO L225 Difference]: With dead ends: 480 [2024-11-19 21:54:36,911 INFO L226 Difference]: Without dead ends: 318 [2024-11-19 21:54:36,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:54:36,914 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 1 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 932 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:54:36,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 932 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:54:36,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-19 21:54:36,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 317. [2024-11-19 21:54:36,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 248 states have (on average 1.5080645161290323) internal successors, (374), 250 states have internal predecessors, (374), 50 states have call successors, (50), 19 states have call predecessors, (50), 18 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-19 21:54:36,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 471 transitions. [2024-11-19 21:54:36,940 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 471 transitions. Word has length 104 [2024-11-19 21:54:36,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:36,941 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 471 transitions. [2024-11-19 21:54:36,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:54:36,941 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 471 transitions. [2024-11-19 21:54:36,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 21:54:36,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:36,944 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:36,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 21:54:37,146 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:54:37,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:37,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:37,147 INFO L85 PathProgramCache]: Analyzing trace with hash 779520691, now seen corresponding path program 1 times [2024-11-19 21:54:37,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:37,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508253399] [2024-11-19 21:54:37,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:37,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:37,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:37,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:37,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:37,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:37,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:54:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:37,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:54:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:37,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:54:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:37,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-19 21:54:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:37,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-19 21:54:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:37,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:54:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:37,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:54:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:37,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:54:37,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:37,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:54:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:37,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-19 21:54:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:37,394 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:54:37,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:37,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508253399] [2024-11-19 21:54:37,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508253399] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:54:37,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450874217] [2024-11-19 21:54:37,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:37,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:54:37,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:54:37,397 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:54:37,399 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:54:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:37,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 21:54:37,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:54:37,670 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:54:37,670 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:54:37,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450874217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:37,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:54:37,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-19 21:54:37,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96534073] [2024-11-19 21:54:37,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:37,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 21:54:37,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:37,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 21:54:37,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:54:37,675 INFO L87 Difference]: Start difference. First operand 317 states and 471 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:54:37,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:37,696 INFO L93 Difference]: Finished difference Result 664 states and 1001 transitions. [2024-11-19 21:54:37,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 21:54:37,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2024-11-19 21:54:37,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:37,698 INFO L225 Difference]: With dead ends: 664 [2024-11-19 21:54:37,698 INFO L226 Difference]: Without dead ends: 374 [2024-11-19 21:54:37,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:54:37,700 INFO L432 NwaCegarLoop]: 480 mSDtfsCounter, 107 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 901 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:54:37,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 901 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:54:37,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-19 21:54:37,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 366. [2024-11-19 21:54:37,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 286 states have (on average 1.5244755244755244) internal successors, (436), 288 states have internal predecessors, (436), 61 states have call successors, (61), 19 states have call predecessors, (61), 18 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-19 21:54:37,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 555 transitions. [2024-11-19 21:54:37,724 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 555 transitions. Word has length 110 [2024-11-19 21:54:37,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:37,726 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 555 transitions. [2024-11-19 21:54:37,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:54:37,726 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 555 transitions. [2024-11-19 21:54:37,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 21:54:37,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:37,729 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:37,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 21:54:37,929 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:54:37,930 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:37,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:37,930 INFO L85 PathProgramCache]: Analyzing trace with hash -210584159, now seen corresponding path program 1 times [2024-11-19 21:54:37,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:37,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006389997] [2024-11-19 21:54:37,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:37,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:38,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:54:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:54:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:54:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-19 21:54:38,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-19 21:54:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 21:54:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:54:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:54:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:54:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:54:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,111 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:54:38,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:38,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006389997] [2024-11-19 21:54:38,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006389997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:54:38,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622104729] [2024-11-19 21:54:38,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:38,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:54:38,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:54:38,114 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:54:38,115 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:54:38,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 21:54:38,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:54:38,405 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:54:38,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:54:38,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622104729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:38,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:54:38,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-19 21:54:38,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640709014] [2024-11-19 21:54:38,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:38,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:54:38,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:38,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:54:38,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:54:38,407 INFO L87 Difference]: Start difference. First operand 366 states and 555 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:54:38,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:38,454 INFO L93 Difference]: Finished difference Result 723 states and 1100 transitions. [2024-11-19 21:54:38,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:54:38,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2024-11-19 21:54:38,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:38,458 INFO L225 Difference]: With dead ends: 723 [2024-11-19 21:54:38,458 INFO L226 Difference]: Without dead ends: 368 [2024-11-19 21:54:38,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 130 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:54:38,461 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 2 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1833 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:54:38,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1833 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:54:38,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-19 21:54:38,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2024-11-19 21:54:38,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 287 states have (on average 1.5226480836236933) internal successors, (437), 290 states have internal predecessors, (437), 61 states have call successors, (61), 19 states have call predecessors, (61), 19 states have return successors, (60), 58 states have call predecessors, (60), 58 states have call successors, (60) [2024-11-19 21:54:38,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 558 transitions. [2024-11-19 21:54:38,485 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 558 transitions. Word has length 111 [2024-11-19 21:54:38,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:38,486 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 558 transitions. [2024-11-19 21:54:38,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:54:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 558 transitions. [2024-11-19 21:54:38,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 21:54:38,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:38,490 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:38,498 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:54:38,691 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:54:38,691 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:38,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:38,691 INFO L85 PathProgramCache]: Analyzing trace with hash -632586872, now seen corresponding path program 1 times [2024-11-19 21:54:38,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:38,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025189310] [2024-11-19 21:54:38,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:38,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:54:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:54:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:54:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-19 21:54:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-19 21:54:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 21:54:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:54:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-19 21:54:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:54:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:54:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:38,923 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:54:38,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:38,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025189310] [2024-11-19 21:54:38,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025189310] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:54:38,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [969406130] [2024-11-19 21:54:38,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:38,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:54:38,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:54:38,926 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:54:38,928 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:54:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:39,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 21:54:39,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:54:39,204 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:54:39,205 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:54:39,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [969406130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:39,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:54:39,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-19 21:54:39,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878201003] [2024-11-19 21:54:39,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:39,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:54:39,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:39,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:54:39,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-19 21:54:39,207 INFO L87 Difference]: Start difference. First operand 368 states and 558 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:54:39,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:39,258 INFO L93 Difference]: Finished difference Result 725 states and 1105 transitions. [2024-11-19 21:54:39,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:54:39,259 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2024-11-19 21:54:39,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:39,261 INFO L225 Difference]: With dead ends: 725 [2024-11-19 21:54:39,261 INFO L226 Difference]: Without dead ends: 370 [2024-11-19 21:54:39,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 130 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:54:39,263 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 2 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1819 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:54:39,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1819 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:54:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-19 21:54:39,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2024-11-19 21:54:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 288 states have (on average 1.5208333333333333) internal successors, (438), 292 states have internal predecessors, (438), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (65), 58 states have call predecessors, (65), 58 states have call successors, (65) [2024-11-19 21:54:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 564 transitions. [2024-11-19 21:54:39,274 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 564 transitions. Word has length 112 [2024-11-19 21:54:39,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:39,274 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 564 transitions. [2024-11-19 21:54:39,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:54:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 564 transitions. [2024-11-19 21:54:39,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 21:54:39,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:39,276 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:39,284 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:54:39,476 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:54:39,477 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:39,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:39,478 INFO L85 PathProgramCache]: Analyzing trace with hash 605004577, now seen corresponding path program 1 times [2024-11-19 21:54:39,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:39,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135835688] [2024-11-19 21:54:39,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:39,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:39,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:39,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:39,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:39,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:54:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:39,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:54:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:39,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-19 21:54:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:39,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-19 21:54:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:39,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-19 21:54:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:39,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:54:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:39,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-19 21:54:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:39,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:54:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:39,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:54:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:39,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:54:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:39,650 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:54:39,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:39,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135835688] [2024-11-19 21:54:39,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135835688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:39,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:54:39,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:54:39,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523659812] [2024-11-19 21:54:39,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:39,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:54:39,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:39,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:54:39,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:54:39,652 INFO L87 Difference]: Start difference. First operand 370 states and 564 transitions. Second operand has 9 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:54:41,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:41,419 INFO L93 Difference]: Finished difference Result 875 states and 1334 transitions. [2024-11-19 21:54:41,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 21:54:41,419 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2024-11-19 21:54:41,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:41,422 INFO L225 Difference]: With dead ends: 875 [2024-11-19 21:54:41,422 INFO L226 Difference]: Without dead ends: 528 [2024-11-19 21:54:41,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-19 21:54:41,424 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 998 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 2474 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 2777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 2474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-19 21:54:41,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 1108 Invalid, 2777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 2474 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-19 21:54:41,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-11-19 21:54:41,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 370. [2024-11-19 21:54:41,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 288 states have (on average 1.5208333333333333) internal successors, (438), 292 states have internal predecessors, (438), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (64), 58 states have call predecessors, (64), 58 states have call successors, (64) [2024-11-19 21:54:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 563 transitions. [2024-11-19 21:54:41,444 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 563 transitions. Word has length 113 [2024-11-19 21:54:41,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:41,445 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 563 transitions. [2024-11-19 21:54:41,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:54:41,445 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 563 transitions. [2024-11-19 21:54:41,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 21:54:41,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:41,447 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:41,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 21:54:41,447 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:41,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:41,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1972880730, now seen corresponding path program 2 times [2024-11-19 21:54:41,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:41,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111258031] [2024-11-19 21:54:41,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:41,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:41,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:41,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:41,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:41,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:54:41,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:41,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:54:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:41,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:54:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:41,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-19 21:54:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:41,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:54:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:41,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-19 21:54:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:41,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-19 21:54:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:41,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:54:41,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:41,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-19 21:54:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:41,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-19 21:54:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:41,620 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:54:41,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:41,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111258031] [2024-11-19 21:54:41,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111258031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:41,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:54:41,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:54:41,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746481524] [2024-11-19 21:54:41,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:41,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:54:41,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:41,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:54:41,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:54:41,622 INFO L87 Difference]: Start difference. First operand 370 states and 563 transitions. Second operand has 9 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:54:43,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:43,174 INFO L93 Difference]: Finished difference Result 877 states and 1337 transitions. [2024-11-19 21:54:43,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 21:54:43,175 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2024-11-19 21:54:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:43,179 INFO L225 Difference]: With dead ends: 877 [2024-11-19 21:54:43,179 INFO L226 Difference]: Without dead ends: 530 [2024-11-19 21:54:43,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 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:54:43,181 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 994 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 2794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:54:43,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 1108 Invalid, 2794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 21:54:43,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-19 21:54:43,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 372. [2024-11-19 21:54:43,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 289 states have (on average 1.519031141868512) internal successors, (439), 294 states have internal predecessors, (439), 61 states have call successors, (61), 19 states have call predecessors, (61), 21 states have return successors, (66), 58 states have call predecessors, (66), 58 states have call successors, (66) [2024-11-19 21:54:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 566 transitions. [2024-11-19 21:54:43,220 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 566 transitions. Word has length 114 [2024-11-19 21:54:43,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:43,221 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 566 transitions. [2024-11-19 21:54:43,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:54:43,221 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 566 transitions. [2024-11-19 21:54:43,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 21:54:43,224 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:43,224 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:43,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 21:54:43,225 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:43,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:43,225 INFO L85 PathProgramCache]: Analyzing trace with hash 317652742, now seen corresponding path program 1 times [2024-11-19 21:54:43,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:43,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690601750] [2024-11-19 21:54:43,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:43,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:43,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:43,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:43,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:43,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:43,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:54:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:43,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:54:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:43,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:54:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:43,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-19 21:54:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:43,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 21:54:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:43,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:54:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:43,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-19 21:54:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:43,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-19 21:54:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:43,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-19 21:54:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:43,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 21:54:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:43,427 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:54:43,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:43,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690601750] [2024-11-19 21:54:43,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690601750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:43,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:54:43,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 21:54:43,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975453256] [2024-11-19 21:54:43,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:43,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:54:43,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:43,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:54:43,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:54:43,430 INFO L87 Difference]: Start difference. First operand 372 states and 566 transitions. Second operand has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-19 21:54:45,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:45,395 INFO L93 Difference]: Finished difference Result 875 states and 1332 transitions. [2024-11-19 21:54:45,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 21:54:45,396 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 115 [2024-11-19 21:54:45,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:45,398 INFO L225 Difference]: With dead ends: 875 [2024-11-19 21:54:45,399 INFO L226 Difference]: Without dead ends: 530 [2024-11-19 21:54:45,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 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:54:45,400 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 998 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 4115 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 4424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 4115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:54:45,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 1535 Invalid, 4424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 4115 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 21:54:45,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-11-19 21:54:45,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 372. [2024-11-19 21:54:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 289 states have (on average 1.519031141868512) internal successors, (439), 294 states have internal predecessors, (439), 61 states have call successors, (61), 19 states have call predecessors, (61), 21 states have return successors, (65), 58 states have call predecessors, (65), 58 states have call successors, (65) [2024-11-19 21:54:45,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 565 transitions. [2024-11-19 21:54:45,428 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 565 transitions. Word has length 115 [2024-11-19 21:54:45,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:45,428 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 565 transitions. [2024-11-19 21:54:45,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-19 21:54:45,428 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 565 transitions. [2024-11-19 21:54:45,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 21:54:45,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:45,430 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:45,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 21:54:45,430 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:45,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:45,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1448374717, now seen corresponding path program 2 times [2024-11-19 21:54:45,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:45,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635563989] [2024-11-19 21:54:45,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:45,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:45,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:45,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:45,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:45,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:45,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:54:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:45,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:54:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:45,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:54:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:45,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-19 21:54:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:45,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-19 21:54:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:45,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:54:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:45,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-19 21:54:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:45,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:54:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:45,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-19 21:54:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:45,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-19 21:54:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:45,671 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:54:45,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:45,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635563989] [2024-11-19 21:54:45,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635563989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:45,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:54:45,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 21:54:45,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809012727] [2024-11-19 21:54:45,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:45,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:54:45,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:45,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:54:45,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:54:45,674 INFO L87 Difference]: Start difference. First operand 372 states and 565 transitions. Second operand has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-19 21:54:47,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:47,724 INFO L93 Difference]: Finished difference Result 877 states and 1338 transitions. [2024-11-19 21:54:47,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 21:54:47,725 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 116 [2024-11-19 21:54:47,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:47,727 INFO L225 Difference]: With dead ends: 877 [2024-11-19 21:54:47,727 INFO L226 Difference]: Without dead ends: 532 [2024-11-19 21:54:47,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-19 21:54:47,729 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 995 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 4127 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 4435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 4127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:54:47,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 1535 Invalid, 4435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 4127 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-19 21:54:47,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2024-11-19 21:54:47,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 374. [2024-11-19 21:54:47,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 290 states have (on average 1.5172413793103448) internal successors, (440), 296 states have internal predecessors, (440), 61 states have call successors, (61), 19 states have call predecessors, (61), 22 states have return successors, (70), 58 states have call predecessors, (70), 58 states have call successors, (70) [2024-11-19 21:54:47,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 571 transitions. [2024-11-19 21:54:47,748 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 571 transitions. Word has length 116 [2024-11-19 21:54:47,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:47,749 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 571 transitions. [2024-11-19 21:54:47,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-19 21:54:47,749 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 571 transitions. [2024-11-19 21:54:47,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 21:54:47,750 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:47,750 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:47,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 21:54:47,751 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:47,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:47,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1658378475, now seen corresponding path program 1 times [2024-11-19 21:54:47,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:47,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007564036] [2024-11-19 21:54:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:47,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:54:47,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:54:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:54:47,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-19 21:54:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-19 21:54:47,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:54:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:54:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:54:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:54:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-19 21:54:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:47,866 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:54:47,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:47,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007564036] [2024-11-19 21:54:47,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007564036] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:54:47,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630381627] [2024-11-19 21:54:47,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:47,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:54:47,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:54:47,868 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:54:47,869 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:54:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:48,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 21:54:48,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:54:48,113 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:54:48,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:54:48,194 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:54:48,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630381627] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:54:48,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:54:48,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-11-19 21:54:48,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442960964] [2024-11-19 21:54:48,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:54:48,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 21:54:48,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:48,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 21:54:48,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:54:48,196 INFO L87 Difference]: Start difference. First operand 374 states and 571 transitions. Second operand has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 7 states have internal predecessors, (112), 2 states have call successors, (32), 6 states have call predecessors, (32), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 21:54:49,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:49,683 INFO L93 Difference]: Finished difference Result 1046 states and 1666 transitions. [2024-11-19 21:54:49,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 21:54:49,683 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 7 states have internal predecessors, (112), 2 states have call successors, (32), 6 states have call predecessors, (32), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 117 [2024-11-19 21:54:49,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:49,688 INFO L225 Difference]: With dead ends: 1046 [2024-11-19 21:54:49,688 INFO L226 Difference]: Without dead ends: 884 [2024-11-19 21:54:49,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 257 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:54:49,691 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 1503 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 2110 mSolverCounterSat, 453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 1273 SdHoareTripleChecker+Invalid, 2563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 453 IncrementalHoareTripleChecker+Valid, 2110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:54:49,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 1273 Invalid, 2563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [453 Valid, 2110 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 21:54:49,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2024-11-19 21:54:49,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 702. [2024-11-19 21:54:49,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 554 states have (on average 1.5848375451263539) internal successors, (878), 560 states have internal predecessors, (878), 125 states have call successors, (125), 19 states have call predecessors, (125), 22 states have return successors, (144), 122 states have call predecessors, (144), 122 states have call successors, (144) [2024-11-19 21:54:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1147 transitions. [2024-11-19 21:54:49,721 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1147 transitions. Word has length 117 [2024-11-19 21:54:49,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:49,722 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1147 transitions. [2024-11-19 21:54:49,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.181818181818182) internal successors, (112), 7 states have internal predecessors, (112), 2 states have call successors, (32), 6 states have call predecessors, (32), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 21:54:49,722 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1147 transitions. [2024-11-19 21:54:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-19 21:54:49,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:49,725 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:49,737 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:54:49,929 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:54:49,930 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:49,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:49,930 INFO L85 PathProgramCache]: Analyzing trace with hash -870041368, now seen corresponding path program 1 times [2024-11-19 21:54:49,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:49,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958426746] [2024-11-19 21:54:49,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:49,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:49,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:50,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:54:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:54:50,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:54:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-19 21:54:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:54:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:54:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:54:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-19 21:54:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-19 21:54:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-19 21:54:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:50,038 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:54:50,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:50,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958426746] [2024-11-19 21:54:50,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958426746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:50,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:54:50,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:54:50,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766763224] [2024-11-19 21:54:50,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:50,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:54:50,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:50,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:54:50,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:54:50,040 INFO L87 Difference]: Start difference. First operand 702 states and 1147 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:54:51,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:51,370 INFO L93 Difference]: Finished difference Result 1827 states and 3037 transitions. [2024-11-19 21:54:51,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:54:51,371 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2024-11-19 21:54:51,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:51,380 INFO L225 Difference]: With dead ends: 1827 [2024-11-19 21:54:51,381 INFO L226 Difference]: Without dead ends: 1193 [2024-11-19 21:54:51,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:54:51,383 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1098 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:54:51,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 841 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 21:54:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2024-11-19 21:54:51,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 1027. [2024-11-19 21:54:51,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 815 states have (on average 1.5987730061349694) internal successors, (1303), 821 states have internal predecessors, (1303), 189 states have call successors, (189), 19 states have call predecessors, (189), 22 states have return successors, (218), 186 states have call predecessors, (218), 186 states have call successors, (218) [2024-11-19 21:54:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1710 transitions. [2024-11-19 21:54:51,434 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1710 transitions. Word has length 123 [2024-11-19 21:54:51,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:51,435 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1710 transitions. [2024-11-19 21:54:51,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:54:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1710 transitions. [2024-11-19 21:54:51,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 21:54:51,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:51,440 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:51,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 21:54:51,441 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:51,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:51,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1333376919, now seen corresponding path program 1 times [2024-11-19 21:54:51,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:51,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827639774] [2024-11-19 21:54:51,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:51,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:51,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:51,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:51,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:51,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:51,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:51,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:54:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:51,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:54:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:51,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:54:51,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:51,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-19 21:54:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:51,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:54:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:51,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:54:51,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:51,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:54:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:51,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:54:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:51,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-19 21:54:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:51,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-19 21:54:51,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:51,540 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:54:51,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:51,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827639774] [2024-11-19 21:54:51,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827639774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:51,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:54:51,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:54:51,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914785021] [2024-11-19 21:54:51,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:51,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:54:51,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:51,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:54:51,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:54:51,541 INFO L87 Difference]: Start difference. First operand 1027 states and 1710 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:54:52,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:52,697 INFO L93 Difference]: Finished difference Result 2607 states and 4386 transitions. [2024-11-19 21:54:52,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:54:52,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2024-11-19 21:54:52,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:52,706 INFO L225 Difference]: With dead ends: 2607 [2024-11-19 21:54:52,707 INFO L226 Difference]: Without dead ends: 1701 [2024-11-19 21:54:52,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:54:52,711 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1096 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 1423 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 1786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 1423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:54:52,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 827 Invalid, 1786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 1423 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 21:54:52,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2024-11-19 21:54:52,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1535. [2024-11-19 21:54:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1535 states, 1228 states have (on average 1.6074918566775245) internal successors, (1974), 1234 states have internal predecessors, (1974), 284 states have call successors, (284), 19 states have call predecessors, (284), 22 states have return successors, (313), 281 states have call predecessors, (313), 281 states have call successors, (313) [2024-11-19 21:54:52,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2571 transitions. [2024-11-19 21:54:52,779 INFO L78 Accepts]: Start accepts. Automaton has 1535 states and 2571 transitions. Word has length 124 [2024-11-19 21:54:52,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:52,779 INFO L471 AbstractCegarLoop]: Abstraction has 1535 states and 2571 transitions. [2024-11-19 21:54:52,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:54:52,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1535 states and 2571 transitions. [2024-11-19 21:54:52,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 21:54:52,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:52,785 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:52,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 21:54:52,786 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:52,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:52,786 INFO L85 PathProgramCache]: Analyzing trace with hash -480631446, now seen corresponding path program 1 times [2024-11-19 21:54:52,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:52,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080557700] [2024-11-19 21:54:52,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:52,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:52,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:54:52,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:54:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:54:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 21:54:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:54:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-19 21:54:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:54:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:54:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-19 21:54:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-19 21:54:52,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:52,905 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:54:52,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:52,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080557700] [2024-11-19 21:54:52,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080557700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:52,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:54:52,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:54:52,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442919089] [2024-11-19 21:54:52,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:52,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:54:52,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:52,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:54:52,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:54:52,907 INFO L87 Difference]: Start difference. First operand 1535 states and 2571 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:54:53,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:53,910 INFO L93 Difference]: Finished difference Result 3759 states and 6395 transitions. [2024-11-19 21:54:53,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:54:53,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2024-11-19 21:54:53,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:53,922 INFO L225 Difference]: With dead ends: 3759 [2024-11-19 21:54:53,922 INFO L226 Difference]: Without dead ends: 2470 [2024-11-19 21:54:53,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:54:53,927 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 1094 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 1770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:54:53,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 813 Invalid, 1770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 1415 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 21:54:53,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2024-11-19 21:54:54,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2304. [2024-11-19 21:54:54,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2304 states, 1874 states have (on average 1.6141942369263607) internal successors, (3025), 1880 states have internal predecessors, (3025), 407 states have call successors, (407), 19 states have call predecessors, (407), 22 states have return successors, (452), 404 states have call predecessors, (452), 404 states have call successors, (452) [2024-11-19 21:54:54,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2304 states to 2304 states and 3884 transitions. [2024-11-19 21:54:54,066 INFO L78 Accepts]: Start accepts. Automaton has 2304 states and 3884 transitions. Word has length 125 [2024-11-19 21:54:54,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:54,066 INFO L471 AbstractCegarLoop]: Abstraction has 2304 states and 3884 transitions. [2024-11-19 21:54:54,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:54:54,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2304 states and 3884 transitions. [2024-11-19 21:54:54,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 21:54:54,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:54,076 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:54,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 21:54:54,076 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:54,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:54,077 INFO L85 PathProgramCache]: Analyzing trace with hash 490767978, now seen corresponding path program 1 times [2024-11-19 21:54:54,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:54,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770660531] [2024-11-19 21:54:54,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:54,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:54:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:54:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:54:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-19 21:54:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 21:54:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:54:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:54:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:54:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-19 21:54:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-19 21:54:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:54,194 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:54:54,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:54,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770660531] [2024-11-19 21:54:54,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770660531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:54,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:54:54,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:54:54,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219327699] [2024-11-19 21:54:54,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:54,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:54:54,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:54,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:54:54,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:54:54,196 INFO L87 Difference]: Start difference. First operand 2304 states and 3884 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:54:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:55,339 INFO L93 Difference]: Finished difference Result 5553 states and 9529 transitions. [2024-11-19 21:54:55,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:54:55,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2024-11-19 21:54:55,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:55,354 INFO L225 Difference]: With dead ends: 5553 [2024-11-19 21:54:55,354 INFO L226 Difference]: Without dead ends: 3699 [2024-11-19 21:54:55,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:54:55,359 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 1093 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1108 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:54:55,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1108 Valid, 810 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 21:54:55,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3699 states. [2024-11-19 21:54:55,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3699 to 3533. [2024-11-19 21:54:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3533 states, 2924 states have (on average 1.6183310533515731) internal successors, (4732), 2930 states have internal predecessors, (4732), 586 states have call successors, (586), 19 states have call predecessors, (586), 22 states have return successors, (657), 583 states have call predecessors, (657), 583 states have call successors, (657) [2024-11-19 21:54:55,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3533 states to 3533 states and 5975 transitions. [2024-11-19 21:54:55,485 INFO L78 Accepts]: Start accepts. Automaton has 3533 states and 5975 transitions. Word has length 126 [2024-11-19 21:54:55,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:55,485 INFO L471 AbstractCegarLoop]: Abstraction has 3533 states and 5975 transitions. [2024-11-19 21:54:55,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:54:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 3533 states and 5975 transitions. [2024-11-19 21:54:55,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-19 21:54:55,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:55,495 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:55,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 21:54:55,495 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:55,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:55,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1910889606, now seen corresponding path program 1 times [2024-11-19 21:54:55,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:55,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712912232] [2024-11-19 21:54:55,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:55,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:55,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:55,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:55,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:55,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:54:55,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:55,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:54:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:55,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:54:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:55,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 21:54:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:55,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 21:54:55,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:55,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:54:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:55,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:54:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:55,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-19 21:54:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:55,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-19 21:54:55,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:55,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-19 21:54:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:55,585 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:54:55,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:55,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712912232] [2024-11-19 21:54:55,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712912232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:55,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:54:55,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:54:55,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376551363] [2024-11-19 21:54:55,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:55,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:54:55,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:55,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:54:55,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:54:55,588 INFO L87 Difference]: Start difference. First operand 3533 states and 5975 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:54:56,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:56,665 INFO L93 Difference]: Finished difference Result 8501 states and 14676 transitions. [2024-11-19 21:54:56,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:54:56,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2024-11-19 21:54:56,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:56,689 INFO L225 Difference]: With dead ends: 8501 [2024-11-19 21:54:56,689 INFO L226 Difference]: Without dead ends: 5730 [2024-11-19 21:54:56,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:54:56,697 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1091 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:54:56,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 832 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 21:54:56,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5730 states. [2024-11-19 21:54:56,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5730 to 5564. [2024-11-19 21:54:56,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5564 states, 4579 states have (on average 1.6125791657567154) internal successors, (7384), 4585 states have internal predecessors, (7384), 962 states have call successors, (962), 19 states have call predecessors, (962), 22 states have return successors, (1077), 959 states have call predecessors, (1077), 959 states have call successors, (1077) [2024-11-19 21:54:56,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5564 states to 5564 states and 9423 transitions. [2024-11-19 21:54:56,897 INFO L78 Accepts]: Start accepts. Automaton has 5564 states and 9423 transitions. Word has length 127 [2024-11-19 21:54:56,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:56,897 INFO L471 AbstractCegarLoop]: Abstraction has 5564 states and 9423 transitions. [2024-11-19 21:54:56,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:54:56,898 INFO L276 IsEmpty]: Start isEmpty. Operand 5564 states and 9423 transitions. [2024-11-19 21:54:56,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 21:54:56,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:56,957 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:56,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 21:54:56,957 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:56,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:56,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1265737906, now seen corresponding path program 1 times [2024-11-19 21:54:56,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:56,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213219965] [2024-11-19 21:54:56,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:56,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:57,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:54:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:54:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:54:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:54:57,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:54:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-19 21:54:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-19 21:54:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 21:54:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-19 21:54:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-19 21:54:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:57,052 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:54:57,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:57,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213219965] [2024-11-19 21:54:57,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213219965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:57,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:54:57,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:54:57,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019474044] [2024-11-19 21:54:57,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:57,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:54:57,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:57,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:54:57,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:54:57,057 INFO L87 Difference]: Start difference. First operand 5564 states and 9423 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:54:58,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:54:58,197 INFO L93 Difference]: Finished difference Result 13838 states and 23897 transitions. [2024-11-19 21:54:58,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:54:58,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2024-11-19 21:54:58,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:54:58,243 INFO L225 Difference]: With dead ends: 13838 [2024-11-19 21:54:58,243 INFO L226 Difference]: Without dead ends: 9413 [2024-11-19 21:54:58,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:54:58,258 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 1089 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:54:58,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1104 Valid, 814 Invalid, 1771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 21:54:58,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9413 states. [2024-11-19 21:54:58,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9413 to 9247. [2024-11-19 21:54:58,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9247 states, 7656 states have (on average 1.6105015673981191) internal successors, (12330), 7662 states have internal predecessors, (12330), 1568 states have call successors, (1568), 19 states have call predecessors, (1568), 22 states have return successors, (1761), 1565 states have call predecessors, (1761), 1565 states have call successors, (1761) [2024-11-19 21:54:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9247 states to 9247 states and 15659 transitions. [2024-11-19 21:54:58,633 INFO L78 Accepts]: Start accepts. Automaton has 9247 states and 15659 transitions. Word has length 128 [2024-11-19 21:54:58,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:54:58,633 INFO L471 AbstractCegarLoop]: Abstraction has 9247 states and 15659 transitions. [2024-11-19 21:54:58,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:54:58,634 INFO L276 IsEmpty]: Start isEmpty. Operand 9247 states and 15659 transitions. [2024-11-19 21:54:58,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 21:54:58,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:54:58,652 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:54:58,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 21:54:58,652 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:54:58,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:54:58,652 INFO L85 PathProgramCache]: Analyzing trace with hash 155342164, now seen corresponding path program 1 times [2024-11-19 21:54:58,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:54:58,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712538224] [2024-11-19 21:54:58,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:54:58,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:54:58,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:58,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:54:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:58,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:54:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:58,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:54:58,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:58,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:54:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:58,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:54:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:58,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:54:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:58,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:54:58,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:58,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-19 21:54:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:58,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:54:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:58,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-19 21:54:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:58,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-19 21:54:58,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:58,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-19 21:54:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:58,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-19 21:54:58,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:54:58,751 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:54:58,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:54:58,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712538224] [2024-11-19 21:54:58,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712538224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:54:58,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:54:58,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:54:58,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921558231] [2024-11-19 21:54:58,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:54:58,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:54:58,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:54:58,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:54:58,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:54:58,753 INFO L87 Difference]: Start difference. First operand 9247 states and 15659 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:55:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:00,156 INFO L93 Difference]: Finished difference Result 24022 states and 41443 transitions. [2024-11-19 21:55:00,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:55:00,156 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2024-11-19 21:55:00,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:00,215 INFO L225 Difference]: With dead ends: 24022 [2024-11-19 21:55:00,215 INFO L226 Difference]: Without dead ends: 16366 [2024-11-19 21:55:00,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:55:00,240 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 1087 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:00,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 849 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 21:55:00,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16366 states. [2024-11-19 21:55:00,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16366 to 16200. [2024-11-19 21:55:00,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16200 states, 13406 states have (on average 1.601670893629718) internal successors, (21472), 13412 states have internal predecessors, (21472), 2771 states have call successors, (2771), 19 states have call predecessors, (2771), 22 states have return successors, (3108), 2768 states have call predecessors, (3108), 2768 states have call successors, (3108) [2024-11-19 21:55:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16200 states to 16200 states and 27351 transitions. [2024-11-19 21:55:00,801 INFO L78 Accepts]: Start accepts. Automaton has 16200 states and 27351 transitions. Word has length 129 [2024-11-19 21:55:00,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:00,802 INFO L471 AbstractCegarLoop]: Abstraction has 16200 states and 27351 transitions. [2024-11-19 21:55:00,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:55:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand 16200 states and 27351 transitions. [2024-11-19 21:55:00,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-19 21:55:00,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:00,830 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:55:00,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 21:55:00,831 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:00,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:00,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1010816623, now seen corresponding path program 1 times [2024-11-19 21:55:00,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:00,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083287067] [2024-11-19 21:55:00,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:00,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:55:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:55:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:55:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:55:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:55:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:55:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:55:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:55:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:55:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-19 21:55:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-19 21:55:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-19 21:55:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-19 21:55:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:00,923 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:55:00,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:55:00,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083287067] [2024-11-19 21:55:00,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083287067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:55:00,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:55:00,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:55:00,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978985558] [2024-11-19 21:55:00,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:55:00,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:55:00,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:55:00,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:55:00,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:55:00,925 INFO L87 Difference]: Start difference. First operand 16200 states and 27351 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:55:02,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:02,655 INFO L93 Difference]: Finished difference Result 42988 states and 74042 transitions. [2024-11-19 21:55:02,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:55:02,656 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 130 [2024-11-19 21:55:02,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:02,742 INFO L225 Difference]: With dead ends: 42988 [2024-11-19 21:55:02,742 INFO L226 Difference]: Without dead ends: 29021 [2024-11-19 21:55:02,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:55:02,769 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 1084 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:02,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 814 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 21:55:02,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29021 states. [2024-11-19 21:55:03,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29021 to 28855. [2024-11-19 21:55:03,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28855 states, 24022 states have (on average 1.5975355923736574) internal successors, (38376), 24028 states have internal predecessors, (38376), 4810 states have call successors, (4810), 19 states have call predecessors, (4810), 22 states have return successors, (5421), 4807 states have call predecessors, (5421), 4807 states have call successors, (5421) [2024-11-19 21:55:03,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28855 states to 28855 states and 48607 transitions. [2024-11-19 21:55:04,000 INFO L78 Accepts]: Start accepts. Automaton has 28855 states and 48607 transitions. Word has length 130 [2024-11-19 21:55:04,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:04,001 INFO L471 AbstractCegarLoop]: Abstraction has 28855 states and 48607 transitions. [2024-11-19 21:55:04,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:55:04,001 INFO L276 IsEmpty]: Start isEmpty. Operand 28855 states and 48607 transitions. [2024-11-19 21:55:04,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 21:55:04,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:04,026 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:55:04,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 21:55:04,026 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:04,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:04,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1210836630, now seen corresponding path program 1 times [2024-11-19 21:55:04,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:04,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170078711] [2024-11-19 21:55:04,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:04,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:55:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:55:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:55:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:55:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:55:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:55:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 21:55:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:55:04,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:55:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:55:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-19 21:55:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-19 21:55:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-19 21:55:04,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:04,125 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:55:04,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:55:04,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170078711] [2024-11-19 21:55:04,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170078711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:55:04,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:55:04,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:55:04,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740532590] [2024-11-19 21:55:04,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:55:04,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:55:04,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:55:04,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:55:04,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:55:04,127 INFO L87 Difference]: Start difference. First operand 28855 states and 48607 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:55:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:06,305 INFO L93 Difference]: Finished difference Result 78750 states and 134801 transitions. [2024-11-19 21:55:06,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:55:06,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 131 [2024-11-19 21:55:06,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:06,510 INFO L225 Difference]: With dead ends: 78750 [2024-11-19 21:55:06,511 INFO L226 Difference]: Without dead ends: 52900 [2024-11-19 21:55:06,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:55:06,573 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 1082 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 1783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:06,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 821 Invalid, 1783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 21:55:06,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52900 states. [2024-11-19 21:55:08,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52900 to 52734. [2024-11-19 21:55:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52734 states, 44186 states have (on average 1.5920200968632598) internal successors, (70345), 44192 states have internal predecessors, (70345), 8525 states have call successors, (8525), 19 states have call predecessors, (8525), 22 states have return successors, (9668), 8522 states have call predecessors, (9668), 8522 states have call successors, (9668) [2024-11-19 21:55:08,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52734 states to 52734 states and 88538 transitions. [2024-11-19 21:55:08,591 INFO L78 Accepts]: Start accepts. Automaton has 52734 states and 88538 transitions. Word has length 131 [2024-11-19 21:55:08,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:08,592 INFO L471 AbstractCegarLoop]: Abstraction has 52734 states and 88538 transitions. [2024-11-19 21:55:08,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:55:08,592 INFO L276 IsEmpty]: Start isEmpty. Operand 52734 states and 88538 transitions. [2024-11-19 21:55:08,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 21:55:08,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:08,621 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:55:08,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 21:55:08,622 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:08,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:08,622 INFO L85 PathProgramCache]: Analyzing trace with hash 464597423, now seen corresponding path program 1 times [2024-11-19 21:55:08,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:08,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775802587] [2024-11-19 21:55:08,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:08,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:55:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:55:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:55:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:55:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:55:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:55:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 21:55:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:55:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:55:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:55:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-19 21:55:08,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-19 21:55:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-19 21:55:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:08,712 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:55:08,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:55:08,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775802587] [2024-11-19 21:55:08,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775802587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:55:08,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:55:08,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:55:08,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501555867] [2024-11-19 21:55:08,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:55:08,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:55:08,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:55:08,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:55:08,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:55:08,714 INFO L87 Difference]: Start difference. First operand 52734 states and 88538 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:55:11,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:11,709 INFO L93 Difference]: Finished difference Result 98521 states and 168988 transitions. [2024-11-19 21:55:11,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:55:11,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2024-11-19 21:55:11,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:12,068 INFO L225 Difference]: With dead ends: 98521 [2024-11-19 21:55:12,068 INFO L226 Difference]: Without dead ends: 98359 [2024-11-19 21:55:12,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:55:12,110 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1077 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 1422 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 1422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:12,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 852 Invalid, 1776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 1422 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 21:55:12,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98359 states. [2024-11-19 21:55:15,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98359 to 98193. [2024-11-19 21:55:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98193 states, 82846 states have (on average 1.5850493687082057) internal successors, (131315), 82852 states have internal predecessors, (131315), 15324 states have call successors, (15324), 19 states have call predecessors, (15324), 22 states have return successors, (17513), 15321 states have call predecessors, (17513), 15321 states have call successors, (17513) [2024-11-19 21:55:15,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98193 states to 98193 states and 164152 transitions. [2024-11-19 21:55:15,527 INFO L78 Accepts]: Start accepts. Automaton has 98193 states and 164152 transitions. Word has length 132 [2024-11-19 21:55:15,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:15,527 INFO L471 AbstractCegarLoop]: Abstraction has 98193 states and 164152 transitions. [2024-11-19 21:55:15,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:55:15,528 INFO L276 IsEmpty]: Start isEmpty. Operand 98193 states and 164152 transitions. [2024-11-19 21:55:15,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 21:55:15,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:15,563 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:55:15,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 21:55:15,563 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:15,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:15,564 INFO L85 PathProgramCache]: Analyzing trace with hash 514856693, now seen corresponding path program 1 times [2024-11-19 21:55:15,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:15,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920767330] [2024-11-19 21:55:15,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:15,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:55:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:55:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:55:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:55:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:55:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:55:16,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:55:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:55:16,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:55:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:55:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-19 21:55:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-19 21:55:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-19 21:55:16,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:16,216 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:55:16,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:55:16,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920767330] [2024-11-19 21:55:16,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920767330] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:55:16,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:55:16,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 21:55:16,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295887515] [2024-11-19 21:55:16,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:55:16,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 21:55:16,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:55:16,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 21:55:16,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:55:16,218 INFO L87 Difference]: Start difference. First operand 98193 states and 164152 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:55:21,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:21,087 INFO L93 Difference]: Finished difference Result 99111 states and 168756 transitions. [2024-11-19 21:55:21,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-19 21:55:21,087 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 133 [2024-11-19 21:55:21,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:21,490 INFO L225 Difference]: With dead ends: 99111 [2024-11-19 21:55:21,490 INFO L226 Difference]: Without dead ends: 98955 [2024-11-19 21:55:21,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=328, Invalid=862, Unknown=0, NotChecked=0, Total=1190 [2024-11-19 21:55:21,527 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1803 mSDsluCounter, 957 mSDsCounter, 0 mSdLazyCounter, 4710 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1817 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 5208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 4710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:21,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1817 Valid, 1146 Invalid, 5208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 4710 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-19 21:55:21,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98955 states. [2024-11-19 21:55:24,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98955 to 98509. [2024-11-19 21:55:24,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98509 states, 83098 states have (on average 1.584574839346314) internal successors, (131675), 83107 states have internal predecessors, (131675), 15362 states have call successors, (15362), 41 states have call predecessors, (15362), 48 states have return successors, (17558), 15360 states have call predecessors, (17558), 15357 states have call successors, (17558) [2024-11-19 21:55:25,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98509 states to 98509 states and 164595 transitions. [2024-11-19 21:55:25,282 INFO L78 Accepts]: Start accepts. Automaton has 98509 states and 164595 transitions. Word has length 133 [2024-11-19 21:55:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:25,282 INFO L471 AbstractCegarLoop]: Abstraction has 98509 states and 164595 transitions. [2024-11-19 21:55:25,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:55:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 98509 states and 164595 transitions. [2024-11-19 21:55:25,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 21:55:25,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:25,321 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:55:25,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 21:55:25,322 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:25,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:25,322 INFO L85 PathProgramCache]: Analyzing trace with hash 552870723, now seen corresponding path program 1 times [2024-11-19 21:55:25,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:25,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604824763] [2024-11-19 21:55:25,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:25,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:25,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:55:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:25,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:55:25,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:25,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:55:25,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:25,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:55:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:25,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:55:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:25,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:55:25,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:25,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:55:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:25,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:55:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:25,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:55:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:25,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:55:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:25,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-19 21:55:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:25,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-19 21:55:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:25,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-19 21:55:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:25,651 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:55:25,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:55:25,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604824763] [2024-11-19 21:55:25,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604824763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:55:25,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:55:25,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-19 21:55:25,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901262032] [2024-11-19 21:55:25,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:55:25,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 21:55:25,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:55:25,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 21:55:25,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-11-19 21:55:25,653 INFO L87 Difference]: Start difference. First operand 98509 states and 164595 transitions. Second operand has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 10 states have internal predecessors, (92), 6 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-19 21:55:30,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:30,728 INFO L93 Difference]: Finished difference Result 99623 states and 169495 transitions. [2024-11-19 21:55:30,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-19 21:55:30,730 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 10 states have internal predecessors, (92), 6 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 134 [2024-11-19 21:55:30,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:31,103 INFO L225 Difference]: With dead ends: 99623 [2024-11-19 21:55:31,103 INFO L226 Difference]: Without dead ends: 98805 [2024-11-19 21:55:31,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=344, Invalid=1636, Unknown=0, NotChecked=0, Total=1980 [2024-11-19 21:55:31,152 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 1563 mSDsluCounter, 1818 mSDsCounter, 0 mSdLazyCounter, 6888 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1563 SdHoareTripleChecker+Valid, 1998 SdHoareTripleChecker+Invalid, 7436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 6888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:31,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1563 Valid, 1998 Invalid, 7436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 6888 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-19 21:55:31,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98805 states. [2024-11-19 21:55:33,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98805 to 98465. [2024-11-19 21:55:33,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98465 states, 83063 states have (on average 1.584676691186208) internal successors, (131628), 83072 states have internal predecessors, (131628), 15356 states have call successors, (15356), 40 states have call predecessors, (15356), 45 states have return successors, (17551), 15352 states have call predecessors, (17551), 15352 states have call successors, (17551) [2024-11-19 21:55:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98465 states to 98465 states and 164535 transitions. [2024-11-19 21:55:34,432 INFO L78 Accepts]: Start accepts. Automaton has 98465 states and 164535 transitions. Word has length 134 [2024-11-19 21:55:34,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:34,432 INFO L471 AbstractCegarLoop]: Abstraction has 98465 states and 164535 transitions. [2024-11-19 21:55:34,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 10 states have internal predecessors, (92), 6 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-19 21:55:34,432 INFO L276 IsEmpty]: Start isEmpty. Operand 98465 states and 164535 transitions. [2024-11-19 21:55:34,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 21:55:34,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:34,467 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:55:34,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 21:55:34,467 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:34,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:34,467 INFO L85 PathProgramCache]: Analyzing trace with hash 999646783, now seen corresponding path program 1 times [2024-11-19 21:55:34,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:34,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046646877] [2024-11-19 21:55:34,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:34,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:34,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:55:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:34,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:55:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:34,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:55:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:34,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:55:34,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:34,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:55:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:34,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:55:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:34,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:55:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:34,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:55:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:34,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:55:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:34,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-19 21:55:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:34,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-19 21:55:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:34,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-19 21:55:34,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:34,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-19 21:55:34,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:34,945 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-19 21:55:34,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:55:34,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046646877] [2024-11-19 21:55:34,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046646877] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:55:34,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468836543] [2024-11-19 21:55:34,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:34,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:55:34,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:55:34,948 INFO L229 MonitoredProcess]: Starting monitored process 8 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:55:34,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 21:55:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:35,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 1121 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-19 21:55:35,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:55:35,469 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 21:55:35,469 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:55:35,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468836543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:55:35,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:55:35,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [20] total 31 [2024-11-19 21:55:35,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537602122] [2024-11-19 21:55:35,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:55:35,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 21:55:35,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:55:35,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 21:55:35,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=857, Unknown=0, NotChecked=0, Total=930 [2024-11-19 21:55:35,471 INFO L87 Difference]: Start difference. First operand 98465 states and 164535 transitions. Second operand has 13 states, 12 states have (on average 8.5) internal successors, (102), 11 states have internal predecessors, (102), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-19 21:55:38,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:55:38,102 INFO L93 Difference]: Finished difference Result 99161 states and 165501 transitions. [2024-11-19 21:55:38,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 21:55:38,104 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.5) internal successors, (102), 11 states have internal predecessors, (102), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) Word has length 137 [2024-11-19 21:55:38,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:55:38,554 INFO L225 Difference]: With dead ends: 99161 [2024-11-19 21:55:38,554 INFO L226 Difference]: Without dead ends: 98981 [2024-11-19 21:55:38,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=1870, Unknown=0, NotChecked=0, Total=2070 [2024-11-19 21:55:38,582 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 741 mSDsluCounter, 4557 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 5059 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 21:55:38,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 5059 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 21:55:38,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98981 states. [2024-11-19 21:55:41,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98981 to 98907. [2024-11-19 21:55:41,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98907 states, 83409 states have (on average 1.5840017264323993) internal successors, (132120), 83428 states have internal predecessors, (132120), 15413 states have call successors, (15413), 70 states have call predecessors, (15413), 84 states have return successors, (17625), 15408 states have call predecessors, (17625), 15407 states have call successors, (17625) [2024-11-19 21:55:42,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98907 states to 98907 states and 165158 transitions. [2024-11-19 21:55:42,039 INFO L78 Accepts]: Start accepts. Automaton has 98907 states and 165158 transitions. Word has length 137 [2024-11-19 21:55:42,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:55:42,041 INFO L471 AbstractCegarLoop]: Abstraction has 98907 states and 165158 transitions. [2024-11-19 21:55:42,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.5) internal successors, (102), 11 states have internal predecessors, (102), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-19 21:55:42,042 INFO L276 IsEmpty]: Start isEmpty. Operand 98907 states and 165158 transitions. [2024-11-19 21:55:42,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-19 21:55:42,080 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:55:42,080 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:55:42,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 21:55:42,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:55:42,281 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:55:42,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:55:42,282 INFO L85 PathProgramCache]: Analyzing trace with hash -750718411, now seen corresponding path program 1 times [2024-11-19 21:55:42,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:55:42,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935915928] [2024-11-19 21:55:42,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:55:42,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:55:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:42,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:55:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:42,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:55:42,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:42,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:55:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:42,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:55:42,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:42,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:55:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:42,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:55:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:42,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:55:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:42,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:55:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:42,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:55:42,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:42,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-19 21:55:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:42,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-19 21:55:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:42,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-19 21:55:42,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:42,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-19 21:55:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:55:42,622 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:55:42,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:55:42,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935915928] [2024-11-19 21:55:42,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935915928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:55:42,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:55:42,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-19 21:55:42,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447543041] [2024-11-19 21:55:42,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:55:42,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-19 21:55:42,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:55:42,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-19 21:55:42,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2024-11-19 21:55:42,624 INFO L87 Difference]: Start difference. First operand 98907 states and 165158 transitions. Second operand has 17 states, 16 states have (on average 6.0) internal successors, (96), 11 states have internal predecessors, (96), 6 states have call successors, (16), 8 states have call predecessors, (16), 4 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13)