./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product19.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/product-lines/email_spec0_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 9deea958caebdff7c89a17deb67516eff149386872824a7682accca78686b765 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 22:58:30,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 22:58:30,554 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 22:58:30,557 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 22:58:30,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 22:58:30,591 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 22:58:30,592 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 22:58:30,592 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 22:58:30,592 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 22:58:30,592 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 22:58:30,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 22:58:30,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 22:58:30,593 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 22:58:30,593 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 22:58:30,594 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 22:58:30,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 22:58:30,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 22:58:30,595 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 22:58:30,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 22:58:30,596 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 22:58:30,596 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 22:58:30,598 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 22:58:30,598 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 22:58:30,598 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 22:58:30,599 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 22:58:30,599 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 22:58:30,599 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 22:58:30,599 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 22:58:30,599 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 22:58:30,599 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 22:58:30,600 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 22:58:30,600 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 22:58:30,600 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:58:30,601 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 22:58:30,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 22:58:30,602 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 22:58:30,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 22:58:30,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 22:58:30,602 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 22:58:30,602 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 22:58:30,603 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 22:58:30,603 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 22:58:30,603 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 -> 9deea958caebdff7c89a17deb67516eff149386872824a7682accca78686b765 [2024-11-09 22:58:30,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 22:58:30,845 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 22:58:30,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 22:58:30,849 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 22:58:30,849 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 22:58:30,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product19.cil.c [2024-11-09 22:58:32,075 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 22:58:32,299 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 22:58:32,299 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product19.cil.c [2024-11-09 22:58:32,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94bb1d659/2b65b70535394c97af3fbcce5fbadeab/FLAGa29915a92 [2024-11-09 22:58:32,628 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94bb1d659/2b65b70535394c97af3fbcce5fbadeab [2024-11-09 22:58:32,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 22:58:32,631 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 22:58:32,632 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 22:58:32,632 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 22:58:32,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 22:58:32,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:58:32" (1/1) ... [2024-11-09 22:58:32,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1076dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:32, skipping insertion in model container [2024-11-09 22:58:32,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:58:32" (1/1) ... [2024-11-09 22:58:32,692 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 22:58:33,033 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product19.cil.c[39319,39332] [2024-11-09 22:58:33,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:58:33,118 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 22:58:33,126 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2024-11-09 22:58:33,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [167] [2024-11-09 22:58:33,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [467] [2024-11-09 22:58:33,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [505] [2024-11-09 22:58:33,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [797] [2024-11-09 22:58:33,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1864] [2024-11-09 22:58:33,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1873] [2024-11-09 22:58:33,128 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1890] [2024-11-09 22:58:33,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [2106] [2024-11-09 22:58:33,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2125] [2024-11-09 22:58:33,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2491] [2024-11-09 22:58:33,167 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_spec0_product19.cil.c[39319,39332] [2024-11-09 22:58:33,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 22:58:33,208 INFO L204 MainTranslator]: Completed translation [2024-11-09 22:58:33,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:33 WrapperNode [2024-11-09 22:58:33,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 22:58:33,209 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 22:58:33,209 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 22:58:33,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 22:58:33,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:33" (1/1) ... [2024-11-09 22:58:33,233 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:33" (1/1) ... [2024-11-09 22:58:33,270 INFO L138 Inliner]: procedures = 127, calls = 184, calls flagged for inlining = 60, calls inlined = 55, statements flattened = 1001 [2024-11-09 22:58:33,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 22:58:33,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 22:58:33,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 22:58:33,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 22:58:33,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:33" (1/1) ... [2024-11-09 22:58:33,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:33" (1/1) ... [2024-11-09 22:58:33,289 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:33" (1/1) ... [2024-11-09 22:58:33,313 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-09 22:58:33,314 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:33" (1/1) ... [2024-11-09 22:58:33,314 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:33" (1/1) ... [2024-11-09 22:58:33,329 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:33" (1/1) ... [2024-11-09 22:58:33,333 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:33" (1/1) ... [2024-11-09 22:58:33,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:33" (1/1) ... [2024-11-09 22:58:33,341 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:33" (1/1) ... [2024-11-09 22:58:33,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 22:58:33,352 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 22:58:33,352 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 22:58:33,352 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 22:58:33,354 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:33" (1/1) ... [2024-11-09 22:58:33,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 22:58:33,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:58:33,381 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-09 22:58:33,382 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-09 22:58:33,414 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-09 22:58:33,414 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-09 22:58:33,414 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-09 22:58:33,414 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-09 22:58:33,414 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-09 22:58:33,414 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-09 22:58:33,414 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-09 22:58:33,415 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-09 22:58:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-09 22:58:33,415 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-09 22:58:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-09 22:58:33,415 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-09 22:58:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-09 22:58:33,415 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-09 22:58:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-09 22:58:33,415 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-09 22:58:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 22:58:33,415 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-09 22:58:33,416 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-09 22:58:33,416 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-09 22:58:33,416 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-09 22:58:33,416 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-09 22:58:33,416 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-09 22:58:33,416 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-09 22:58:33,416 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-09 22:58:33,416 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-09 22:58:33,416 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-09 22:58:33,416 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-09 22:58:33,416 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-09 22:58:33,416 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-09 22:58:33,417 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-09 22:58:33,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 22:58:33,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 22:58:33,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 22:58:33,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 22:58:33,417 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-09 22:58:33,417 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-09 22:58:33,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 22:58:33,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 22:58:33,576 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 22:58:33,578 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 22:58:33,621 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2836: #res := ~retValue_acc~41; [2024-11-09 22:58:33,853 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1794-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~26#1; [2024-11-09 22:58:33,853 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1406-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~20#1; [2024-11-09 22:58:33,853 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1722-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~25#1; [2024-11-09 22:58:33,853 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L370-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~7#1; [2024-11-09 22:58:33,853 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2873-1: isVerified_#res#1 := isVerified_~retValue_acc~42#1; [2024-11-09 22:58:33,853 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1841-1: getClientId_#res#1 := getClientId_~retValue_acc~27#1; [2024-11-09 22:58:33,853 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2536-1: getEmailId_#res#1 := getEmailId_~retValue_acc~33#1; [2024-11-09 22:58:33,861 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2799: #res := ~retValue_acc~40; [2024-11-09 22:58:33,881 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2610: #res := ~retValue_acc~35; [2024-11-09 22:58:33,904 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1498: #res#1 := ~retValue_acc~22#1; [2024-11-09 22:58:33,904 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1453-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~21#1; [2024-11-09 22:58:33,925 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L164-1: createEmail_#res#1 := createEmail_~retValue_acc~2#1; [2024-11-09 22:58:34,097 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L327-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~4#1; [2024-11-09 22:58:34,098 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L336-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~5#1; [2024-11-09 22:58:34,098 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L345-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~6#1; [2024-11-09 22:58:34,098 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L502-1: valid_product_#res#1 := valid_product_~retValue_acc~9#1; [2024-11-09 22:58:34,098 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1668-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~24#1; [2024-11-09 22:58:34,098 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1561-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~23#1; [2024-11-09 22:58:34,102 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2573: #res := ~retValue_acc~34; [2024-11-09 22:58:34,105 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L140: #res := ~retValue_acc~0; [2024-11-09 22:58:34,227 INFO L? ?]: Removed 436 outVars from TransFormulas that were not future-live. [2024-11-09 22:58:34,228 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 22:58:34,244 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 22:58:34,245 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 22:58:34,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:58:34 BoogieIcfgContainer [2024-11-09 22:58:34,246 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 22:58:34,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 22:58:34,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 22:58:34,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 22:58:34,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:58:32" (1/3) ... [2024-11-09 22:58:34,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5625c633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:58:34, skipping insertion in model container [2024-11-09 22:58:34,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:33" (2/3) ... [2024-11-09 22:58:34,250 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5625c633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:58:34, skipping insertion in model container [2024-11-09 22:58:34,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 10:58:34" (3/3) ... [2024-11-09 22:58:34,251 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec0_product19.cil.c [2024-11-09 22:58:34,264 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 22:58:34,264 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 22:58:34,323 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 22:58:34,329 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;@5b89915f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 22:58:34,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 22:58:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand has 313 states, 253 states have (on average 1.5138339920948616) internal successors, (383), 255 states have internal predecessors, (383), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 22:58:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 22:58:34,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:58:34,350 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:58:34,350 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:58:34,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:58:34,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1989151653, now seen corresponding path program 1 times [2024-11-09 22:58:34,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:58:34,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358464150] [2024-11-09 22:58:34,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:34,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:58:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:34,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:58:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:34,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:58:34,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:34,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:58:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:34,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:58:34,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:34,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 22:58:34,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:34,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 22:58:34,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:34,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 22:58:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:34,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 22:58:34,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:34,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 22:58:34,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:34,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 22:58:34,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:34,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 22:58:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:34,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 22:58:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:34,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 22:58:34,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:34,886 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 22:58:34,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:58:34,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358464150] [2024-11-09 22:58:34,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358464150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:58:34,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467301484] [2024-11-09 22:58:34,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:34,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:58:34,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:58:34,889 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-09 22:58:34,891 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-09 22:58:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:35,181 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 22:58:35,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:58:35,206 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-09 22:58:35,208 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:58:35,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467301484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:58:35,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 22:58:35,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-09 22:58:35,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193700507] [2024-11-09 22:58:35,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:58:35,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 22:58:35,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:58:35,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 22:58:35,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 22:58:35,240 INFO L87 Difference]: Start difference. First operand has 313 states, 253 states have (on average 1.5138339920948616) internal successors, (383), 255 states have internal predecessors, (383), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:35,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:58:35,281 INFO L93 Difference]: Finished difference Result 461 states and 677 transitions. [2024-11-09 22:58:35,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 22:58:35,282 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 105 [2024-11-09 22:58:35,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:58:35,297 INFO L225 Difference]: With dead ends: 461 [2024-11-09 22:58:35,298 INFO L226 Difference]: Without dead ends: 305 [2024-11-09 22:58:35,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 127 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-09 22:58:35,307 INFO L432 NwaCegarLoop]: 462 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, 462 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-09 22:58:35,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:58:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-09 22:58:35,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-09 22:58:35,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 246 states have (on average 1.508130081300813) internal successors, (371), 247 states have internal predecessors, (371), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-09 22:58:35,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 454 transitions. [2024-11-09 22:58:35,353 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 454 transitions. Word has length 105 [2024-11-09 22:58:35,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:58:35,354 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 454 transitions. [2024-11-09 22:58:35,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:35,355 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 454 transitions. [2024-11-09 22:58:35,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 22:58:35,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:58:35,358 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:58:35,372 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-09 22:58:35,558 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-09 22:58:35,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:58:35,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:58:35,559 INFO L85 PathProgramCache]: Analyzing trace with hash 105665899, now seen corresponding path program 1 times [2024-11-09 22:58:35,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:58:35,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016368229] [2024-11-09 22:58:35,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:35,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:58:35,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:35,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:58:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:35,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:58:35,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:35,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:58:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:35,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:58:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:35,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 22:58:35,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:35,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 22:58:35,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:35,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 22:58:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:35,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 22:58:35,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:35,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 22:58:35,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:35,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 22:58:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:35,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 22:58:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:35,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 22:58:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:35,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 22:58:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:35,833 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 22:58:35,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:58:35,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016368229] [2024-11-09 22:58:35,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016368229] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:58:35,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421992171] [2024-11-09 22:58:35,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:35,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:58:35,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:58:35,838 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-09 22:58:35,839 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-09 22:58:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:36,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 22:58:36,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:58:36,086 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-09 22:58:36,087 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:58:36,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421992171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:58:36,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 22:58:36,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-09 22:58:36,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121346239] [2024-11-09 22:58:36,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:58:36,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:58:36,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:58:36,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:58:36,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 22:58:36,090 INFO L87 Difference]: Start difference. First operand 305 states and 454 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:36,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:58:36,122 INFO L93 Difference]: Finished difference Result 450 states and 657 transitions. [2024-11-09 22:58:36,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:58:36,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 107 [2024-11-09 22:58:36,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:58:36,125 INFO L225 Difference]: With dead ends: 450 [2024-11-09 22:58:36,125 INFO L226 Difference]: Without dead ends: 308 [2024-11-09 22:58:36,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 22:58:36,127 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 0 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:58:36,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 904 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:58:36,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-09 22:58:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-11-09 22:58:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 249 states have (on average 1.502008032128514) internal successors, (374), 250 states have internal predecessors, (374), 42 states have call successors, (42), 16 states have call predecessors, (42), 16 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-09 22:58:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 457 transitions. [2024-11-09 22:58:36,150 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 457 transitions. Word has length 107 [2024-11-09 22:58:36,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:58:36,150 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 457 transitions. [2024-11-09 22:58:36,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 457 transitions. [2024-11-09 22:58:36,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 22:58:36,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:58:36,153 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:58:36,166 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-09 22:58:36,353 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-09 22:58:36,354 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:58:36,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:58:36,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1725955234, now seen corresponding path program 1 times [2024-11-09 22:58:36,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:58:36,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354429837] [2024-11-09 22:58:36,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:36,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:58:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:36,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:58:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:36,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:58:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:36,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:58:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:36,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:58:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:36,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 22:58:36,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:36,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 22:58:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:36,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 22:58:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:36,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 22:58:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:36,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 22:58:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:36,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 22:58:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:36,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 22:58:36,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:36,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 22:58:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:36,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 22:58:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:36,535 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 22:58:36,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:58:36,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354429837] [2024-11-09 22:58:36,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354429837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:58:36,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057075209] [2024-11-09 22:58:36,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:36,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:58:36,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:58:36,537 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-09 22:58:36,539 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-09 22:58:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:36,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 22:58:36,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:58:36,760 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-09 22:58:36,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:58:36,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057075209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:58:36,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 22:58:36,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-09 22:58:36,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299114405] [2024-11-09 22:58:36,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:58:36,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 22:58:36,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:58:36,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 22:58:36,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 22:58:36,763 INFO L87 Difference]: Start difference. First operand 308 states and 457 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:58:36,781 INFO L93 Difference]: Finished difference Result 655 states and 982 transitions. [2024-11-09 22:58:36,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 22:58:36,781 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2024-11-09 22:58:36,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:58:36,783 INFO L225 Difference]: With dead ends: 655 [2024-11-09 22:58:36,784 INFO L226 Difference]: Without dead ends: 375 [2024-11-09 22:58:36,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 22:58:36,786 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 117 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 868 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-09 22:58:36,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 868 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:58:36,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-11-09 22:58:36,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 367. [2024-11-09 22:58:36,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 297 states have (on average 1.5016835016835017) internal successors, (446), 298 states have internal predecessors, (446), 53 states have call successors, (53), 16 states have call predecessors, (53), 16 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 22:58:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 551 transitions. [2024-11-09 22:58:36,813 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 551 transitions. Word has length 114 [2024-11-09 22:58:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:58:36,814 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 551 transitions. [2024-11-09 22:58:36,814 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:36,814 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 551 transitions. [2024-11-09 22:58:36,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 22:58:36,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:58:36,817 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:58:36,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 22:58:37,018 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-09 22:58:37,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:58:37,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:58:37,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1714715806, now seen corresponding path program 1 times [2024-11-09 22:58:37,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:58:37,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713733971] [2024-11-09 22:58:37,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:37,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:58:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:58:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:58:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:58:37,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 22:58:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 22:58:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 22:58:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 22:58:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 22:58:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 22:58:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 22:58:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 22:58:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 22:58:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 22:58:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,187 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 22:58:37,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:58:37,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713733971] [2024-11-09 22:58:37,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713733971] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:58:37,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356409890] [2024-11-09 22:58:37,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:37,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:58:37,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:58:37,191 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-09 22:58:37,192 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-09 22:58:37,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 22:58:37,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:58:37,514 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 22:58:37,515 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:58:37,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356409890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:58:37,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 22:58:37,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-09 22:58:37,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785272466] [2024-11-09 22:58:37,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:58:37,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:58:37,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:58:37,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:58:37,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:58:37,519 INFO L87 Difference]: Start difference. First operand 367 states and 551 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 22:58:37,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:58:37,572 INFO L93 Difference]: Finished difference Result 725 states and 1092 transitions. [2024-11-09 22:58:37,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:58:37,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 115 [2024-11-09 22:58:37,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:58:37,577 INFO L225 Difference]: With dead ends: 725 [2024-11-09 22:58:37,578 INFO L226 Difference]: Without dead ends: 369 [2024-11-09 22:58:37,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 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-09 22:58:37,579 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 2 mSDsluCounter, 1327 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1773 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-09 22:58:37,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1773 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:58:37,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-09 22:58:37,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2024-11-09 22:58:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 298 states have (on average 1.5) internal successors, (447), 300 states have internal predecessors, (447), 53 states have call successors, (53), 16 states have call predecessors, (53), 17 states have return successors, (54), 52 states have call predecessors, (54), 52 states have call successors, (54) [2024-11-09 22:58:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 554 transitions. [2024-11-09 22:58:37,594 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 554 transitions. Word has length 115 [2024-11-09 22:58:37,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:58:37,594 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 554 transitions. [2024-11-09 22:58:37,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 22:58:37,594 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 554 transitions. [2024-11-09 22:58:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 22:58:37,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:58:37,596 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:58:37,609 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-09 22:58:37,796 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-09 22:58:37,796 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:58:37,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:58:37,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1160901392, now seen corresponding path program 1 times [2024-11-09 22:58:37,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:58:37,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361257449] [2024-11-09 22:58:37,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:37,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:58:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:58:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:58:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:58:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:58:37,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 22:58:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 22:58:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 22:58:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 22:58:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 22:58:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 22:58:37,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 22:58:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 22:58:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-09 22:58:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:37,965 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-09 22:58:37,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:58:37,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361257449] [2024-11-09 22:58:37,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361257449] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:58:37,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765157464] [2024-11-09 22:58:37,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:37,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:58:37,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:58:37,967 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-09 22:58:37,968 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-09 22:58:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:38,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 22:58:38,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:58:38,223 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 22:58:38,227 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 22:58:38,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765157464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:58:38,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 22:58:38,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-09 22:58:38,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659930473] [2024-11-09 22:58:38,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:58:38,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 22:58:38,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:58:38,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 22:58:38,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-09 22:58:38,228 INFO L87 Difference]: Start difference. First operand 369 states and 554 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 22:58:38,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:58:38,280 INFO L93 Difference]: Finished difference Result 727 states and 1097 transitions. [2024-11-09 22:58:38,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 22:58:38,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 116 [2024-11-09 22:58:38,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:58:38,283 INFO L225 Difference]: With dead ends: 727 [2024-11-09 22:58:38,283 INFO L226 Difference]: Without dead ends: 371 [2024-11-09 22:58:38,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 134 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-09 22:58:38,285 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 2 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1759 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-09 22:58:38,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1759 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 22:58:38,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-09 22:58:38,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2024-11-09 22:58:38,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 299 states have (on average 1.4983277591973243) internal successors, (448), 302 states have internal predecessors, (448), 53 states have call successors, (53), 16 states have call predecessors, (53), 18 states have return successors, (59), 52 states have call predecessors, (59), 52 states have call successors, (59) [2024-11-09 22:58:38,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 560 transitions. [2024-11-09 22:58:38,319 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 560 transitions. Word has length 116 [2024-11-09 22:58:38,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:58:38,319 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 560 transitions. [2024-11-09 22:58:38,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 22:58:38,319 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 560 transitions. [2024-11-09 22:58:38,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-09 22:58:38,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:58:38,321 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:58:38,335 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-09 22:58:38,521 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-09 22:58:38,522 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:58:38,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:58:38,522 INFO L85 PathProgramCache]: Analyzing trace with hash -24636138, now seen corresponding path program 1 times [2024-11-09 22:58:38,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:58:38,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907501623] [2024-11-09 22:58:38,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:38,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:58:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:38,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:58:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:38,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:58:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:38,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:58:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:38,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:58:38,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:38,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:58:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:38,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 22:58:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:38,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 22:58:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:38,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 22:58:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:38,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 22:58:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:38,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 22:58:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:38,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 22:58:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:38,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 22:58:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:38,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 22:58:38,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:38,653 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 22:58:38,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:58:38,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907501623] [2024-11-09 22:58:38,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907501623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:58:38,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:58:38,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 22:58:38,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560211915] [2024-11-09 22:58:38,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:58:38,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 22:58:38,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:58:38,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 22:58:38,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 22:58:38,655 INFO L87 Difference]: Start difference. First operand 371 states and 560 transitions. Second operand has 9 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 22:58:40,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:58:40,089 INFO L93 Difference]: Finished difference Result 890 states and 1344 transitions. [2024-11-09 22:58:40,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 22:58:40,092 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 117 [2024-11-09 22:58:40,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:58:40,094 INFO L225 Difference]: With dead ends: 890 [2024-11-09 22:58:40,094 INFO L226 Difference]: Without dead ends: 542 [2024-11-09 22:58:40,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-09 22:58:40,096 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1010 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 2243 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 2531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 2243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:58:40,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 1186 Invalid, 2531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 2243 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 22:58:40,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-09 22:58:40,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 371. [2024-11-09 22:58:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 299 states have (on average 1.4983277591973243) internal successors, (448), 302 states have internal predecessors, (448), 53 states have call successors, (53), 16 states have call predecessors, (53), 18 states have return successors, (58), 52 states have call predecessors, (58), 52 states have call successors, (58) [2024-11-09 22:58:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 559 transitions. [2024-11-09 22:58:40,122 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 559 transitions. Word has length 117 [2024-11-09 22:58:40,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:58:40,122 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 559 transitions. [2024-11-09 22:58:40,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 22:58:40,123 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 559 transitions. [2024-11-09 22:58:40,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 22:58:40,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:58:40,124 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:58:40,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 22:58:40,125 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:58:40,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:58:40,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1392190362, now seen corresponding path program 2 times [2024-11-09 22:58:40,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:58:40,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847757474] [2024-11-09 22:58:40,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:40,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:58:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:40,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:58:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:40,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:58:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:40,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:58:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:40,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:58:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:40,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:58:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:40,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 22:58:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:40,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 22:58:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:40,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 22:58:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:40,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 22:58:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:40,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 22:58:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:40,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 22:58:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:40,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 22:58:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:40,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 22:58:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-09 22:58:40,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:58:40,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847757474] [2024-11-09 22:58:40,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847757474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:58:40,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:58:40,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 22:58:40,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842087988] [2024-11-09 22:58:40,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:58:40,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 22:58:40,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:58:40,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 22:58:40,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 22:58:40,272 INFO L87 Difference]: Start difference. First operand 371 states and 559 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, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 22:58:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:58:41,746 INFO L93 Difference]: Finished difference Result 892 states and 1347 transitions. [2024-11-09 22:58:41,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 22:58:41,746 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, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 118 [2024-11-09 22:58:41,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:58:41,749 INFO L225 Difference]: With dead ends: 892 [2024-11-09 22:58:41,749 INFO L226 Difference]: Without dead ends: 544 [2024-11-09 22:58:41,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-09 22:58:41,751 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 956 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 2440 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 2709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 22:58:41,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 1188 Invalid, 2709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2440 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 22:58:41,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-11-09 22:58:41,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 373. [2024-11-09 22:58:41,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 300 states have (on average 1.4966666666666666) internal successors, (449), 304 states have internal predecessors, (449), 53 states have call successors, (53), 16 states have call predecessors, (53), 19 states have return successors, (60), 52 states have call predecessors, (60), 52 states have call successors, (60) [2024-11-09 22:58:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 562 transitions. [2024-11-09 22:58:41,776 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 562 transitions. Word has length 118 [2024-11-09 22:58:41,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:58:41,777 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 562 transitions. [2024-11-09 22:58:41,777 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, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-09 22:58:41,777 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 562 transitions. [2024-11-09 22:58:41,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 22:58:41,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:58:41,779 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:58:41,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 22:58:41,779 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:58:41,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:58:41,779 INFO L85 PathProgramCache]: Analyzing trace with hash -442622951, now seen corresponding path program 1 times [2024-11-09 22:58:41,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:58:41,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405898711] [2024-11-09 22:58:41,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:41,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:58:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:41,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:58:41,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:41,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:58:41,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:41,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:58:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:41,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:58:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:41,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:58:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:41,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 22:58:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:41,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 22:58:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:41,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 22:58:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:41,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 22:58:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:41,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 22:58:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:41,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 22:58:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:41,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 22:58:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:41,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 22:58:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:41,953 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-09 22:58:41,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:58:41,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405898711] [2024-11-09 22:58:41,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405898711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:58:41,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:58:41,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 22:58:41,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931865565] [2024-11-09 22:58:41,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:58:41,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 22:58:41,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:58:41,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 22:58:41,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:58:41,954 INFO L87 Difference]: Start difference. First operand 373 states and 562 transitions. Second operand has 12 states, 11 states have (on average 7.0) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-09 22:58:43,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:58:43,770 INFO L93 Difference]: Finished difference Result 890 states and 1342 transitions. [2024-11-09 22:58:43,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 22:58:43,771 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 119 [2024-11-09 22:58:43,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:58:43,773 INFO L225 Difference]: With dead ends: 890 [2024-11-09 22:58:43,773 INFO L226 Difference]: Without dead ends: 544 [2024-11-09 22:58:43,774 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-09 22:58:43,774 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 985 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 3887 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 4166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 3887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 22:58:43,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 1644 Invalid, 4166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 3887 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 22:58:43,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2024-11-09 22:58:43,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 373. [2024-11-09 22:58:43,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 300 states have (on average 1.4966666666666666) internal successors, (449), 304 states have internal predecessors, (449), 53 states have call successors, (53), 16 states have call predecessors, (53), 19 states have return successors, (59), 52 states have call predecessors, (59), 52 states have call successors, (59) [2024-11-09 22:58:43,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 561 transitions. [2024-11-09 22:58:43,790 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 561 transitions. Word has length 119 [2024-11-09 22:58:43,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:58:43,791 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 561 transitions. [2024-11-09 22:58:43,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-09 22:58:43,791 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 561 transitions. [2024-11-09 22:58:43,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 22:58:43,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:58:43,792 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:58:43,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 22:58:43,793 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:58:43,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:58:43,793 INFO L85 PathProgramCache]: Analyzing trace with hash -786194437, now seen corresponding path program 2 times [2024-11-09 22:58:43,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:58:43,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090352501] [2024-11-09 22:58:43,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:43,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:58:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:43,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:58:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:43,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:58:43,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:43,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:58:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:43,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:58:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:43,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:58:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:43,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 22:58:43,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:43,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 22:58:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:43,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 22:58:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:43,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 22:58:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:43,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 22:58:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:43,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 22:58:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:43,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 22:58:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:43,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 22:58:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-09 22:58:43,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:58:43,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090352501] [2024-11-09 22:58:43,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090352501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:58:43,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:58:43,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 22:58:43,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893782440] [2024-11-09 22:58:43,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:58:43,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 22:58:43,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:58:43,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 22:58:43,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 22:58:43,963 INFO L87 Difference]: Start difference. First operand 373 states and 561 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, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-09 22:58:45,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:58:45,692 INFO L93 Difference]: Finished difference Result 892 states and 1348 transitions. [2024-11-09 22:58:45,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 22:58:45,692 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, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 120 [2024-11-09 22:58:45,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:58:45,695 INFO L225 Difference]: With dead ends: 892 [2024-11-09 22:58:45,695 INFO L226 Difference]: Without dead ends: 546 [2024-11-09 22:58:45,696 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-09 22:58:45,696 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 962 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 3995 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 4274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 3995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 22:58:45,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [963 Valid, 1646 Invalid, 4274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 3995 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 22:58:45,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-11-09 22:58:45,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 375. [2024-11-09 22:58:45,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 301 states have (on average 1.495016611295681) internal successors, (450), 306 states have internal predecessors, (450), 53 states have call successors, (53), 16 states have call predecessors, (53), 20 states have return successors, (64), 52 states have call predecessors, (64), 52 states have call successors, (64) [2024-11-09 22:58:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 567 transitions. [2024-11-09 22:58:45,714 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 567 transitions. Word has length 120 [2024-11-09 22:58:45,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:58:45,715 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 567 transitions. [2024-11-09 22:58:45,715 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, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-09 22:58:45,715 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 567 transitions. [2024-11-09 22:58:45,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 22:58:45,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:58:45,717 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:58:45,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 22:58:45,717 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:58:45,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:58:45,718 INFO L85 PathProgramCache]: Analyzing trace with hash 622490524, now seen corresponding path program 1 times [2024-11-09 22:58:45,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:58:45,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685143086] [2024-11-09 22:58:45,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:45,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:58:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:45,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:58:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:45,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:58:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:45,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:58:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:45,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:58:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:45,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:58:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:45,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 22:58:45,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:45,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 22:58:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:45,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 22:58:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:45,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 22:58:45,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:45,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 22:58:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:45,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 22:58:45,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:45,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 22:58:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:45,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 22:58:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:45,816 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 22:58:45,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:58:45,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685143086] [2024-11-09 22:58:45,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685143086] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:58:45,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299823646] [2024-11-09 22:58:45,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:45,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:58:45,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:58:45,818 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-09 22:58:45,819 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-09 22:58:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:46,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 22:58:46,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:58:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 22:58:46,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:58:46,124 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 22:58:46,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299823646] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:58:46,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:58:46,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-11-09 22:58:46,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960192634] [2024-11-09 22:58:46,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:58:46,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 22:58:46,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:58:46,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 22:58:46,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:58:46,126 INFO L87 Difference]: Start difference. First operand 375 states and 567 transitions. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 7 states have internal predecessors, (106), 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-09 22:58:47,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:58:47,299 INFO L93 Difference]: Finished difference Result 1091 states and 1706 transitions. [2024-11-09 22:58:47,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 22:58:47,300 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 7 states have internal predecessors, (106), 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 121 [2024-11-09 22:58:47,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:58:47,304 INFO L225 Difference]: With dead ends: 1091 [2024-11-09 22:58:47,304 INFO L226 Difference]: Without dead ends: 949 [2024-11-09 22:58:47,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 265 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-09 22:58:47,305 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 1523 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1568 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:58:47,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1568 Valid, 1336 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 22:58:47,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2024-11-09 22:58:47,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 754. [2024-11-09 22:58:47,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 616 states have (on average 1.5243506493506493) internal successors, (939), 621 states have internal predecessors, (939), 117 states have call successors, (117), 16 states have call predecessors, (117), 20 states have return successors, (138), 116 states have call predecessors, (138), 116 states have call successors, (138) [2024-11-09 22:58:47,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1194 transitions. [2024-11-09 22:58:47,329 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1194 transitions. Word has length 121 [2024-11-09 22:58:47,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:58:47,330 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1194 transitions. [2024-11-09 22:58:47,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 7 states have internal predecessors, (106), 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-09 22:58:47,330 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1194 transitions. [2024-11-09 22:58:47,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 22:58:47,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:58:47,332 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 22:58:47,347 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-09 22:58:47,533 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-09 22:58:47,533 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:58:47,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:58:47,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2093891247, now seen corresponding path program 1 times [2024-11-09 22:58:47,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:58:47,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591711058] [2024-11-09 22:58:47,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:47,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:58:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:47,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:58:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:47,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:58:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:47,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:58:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:47,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:58:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:47,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:58:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:47,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 22:58:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:47,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 22:58:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:47,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 22:58:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:47,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 22:58:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:47,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 22:58:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:47,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 22:58:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:47,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 22:58:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:47,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 22:58:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:47,621 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 22:58:47,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:58:47,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591711058] [2024-11-09 22:58:47,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591711058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:58:47,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:58:47,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 22:58:47,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368552893] [2024-11-09 22:58:47,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:58:47,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:58:47,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:58:47,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:58:47,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:58:47,623 INFO L87 Difference]: Start difference. First operand 754 states and 1194 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:48,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:58:48,540 INFO L93 Difference]: Finished difference Result 1994 states and 3199 transitions. [2024-11-09 22:58:48,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 22:58:48,542 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 135 [2024-11-09 22:58:48,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:58:48,547 INFO L225 Difference]: With dead ends: 1994 [2024-11-09 22:58:48,548 INFO L226 Difference]: Without dead ends: 1310 [2024-11-09 22:58:48,551 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-09 22:58:48,552 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 1090 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 22:58:48,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 919 Invalid, 1725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 22:58:48,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2024-11-09 22:58:48,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1131. [2024-11-09 22:58:48,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 929 states have (on average 1.5242195909580194) internal successors, (1416), 934 states have internal predecessors, (1416), 181 states have call successors, (181), 16 states have call predecessors, (181), 20 states have return successors, (212), 180 states have call predecessors, (212), 180 states have call successors, (212) [2024-11-09 22:58:48,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1809 transitions. [2024-11-09 22:58:48,590 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1809 transitions. Word has length 135 [2024-11-09 22:58:48,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:58:48,591 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1809 transitions. [2024-11-09 22:58:48,591 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:48,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1809 transitions. [2024-11-09 22:58:48,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 22:58:48,595 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:58:48,595 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 22:58:48,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 22:58:48,595 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:58:48,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:58:48,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1377060009, now seen corresponding path program 1 times [2024-11-09 22:58:48,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:58:48,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539021890] [2024-11-09 22:58:48,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:48,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:58:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:48,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:58:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:48,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:58:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:48,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:58:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:48,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:58:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:48,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:58:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:48,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 22:58:48,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:48,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 22:58:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:48,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 22:58:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:48,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 22:58:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:48,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 22:58:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:48,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 22:58:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:48,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 22:58:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:48,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 22:58:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 22:58:48,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:58:48,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539021890] [2024-11-09 22:58:48,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539021890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:58:48,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:58:48,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 22:58:48,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182884556] [2024-11-09 22:58:48,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:58:48,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:58:48,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:58:48,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:58:48,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:58:48,708 INFO L87 Difference]: Start difference. First operand 1131 states and 1809 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:49,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:58:49,655 INFO L93 Difference]: Finished difference Result 2904 states and 4678 transitions. [2024-11-09 22:58:49,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 22:58:49,655 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 136 [2024-11-09 22:58:49,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:58:49,662 INFO L225 Difference]: With dead ends: 2904 [2024-11-09 22:58:49,662 INFO L226 Difference]: Without dead ends: 1902 [2024-11-09 22:58:49,665 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-09 22:58:49,666 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1108 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 22:58:49,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 872 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 22:58:49,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2024-11-09 22:58:49,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1723. [2024-11-09 22:58:49,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1426 states have (on average 1.5224403927068724) internal successors, (2171), 1431 states have internal predecessors, (2171), 276 states have call successors, (276), 16 states have call predecessors, (276), 20 states have return successors, (307), 275 states have call predecessors, (307), 275 states have call successors, (307) [2024-11-09 22:58:49,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2754 transitions. [2024-11-09 22:58:49,712 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2754 transitions. Word has length 136 [2024-11-09 22:58:49,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:58:49,712 INFO L471 AbstractCegarLoop]: Abstraction has 1723 states and 2754 transitions. [2024-11-09 22:58:49,712 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:49,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2754 transitions. [2024-11-09 22:58:49,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 22:58:49,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:58:49,718 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 22:58:49,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 22:58:49,719 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:58:49,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:58:49,719 INFO L85 PathProgramCache]: Analyzing trace with hash -478819665, now seen corresponding path program 1 times [2024-11-09 22:58:49,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:58:49,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375091225] [2024-11-09 22:58:49,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:49,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:58:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:49,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:58:49,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:49,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:58:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:49,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:58:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:49,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:58:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:49,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:58:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:49,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 22:58:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:49,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 22:58:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:49,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 22:58:49,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:49,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 22:58:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:49,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 22:58:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:49,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 22:58:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:49,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 22:58:49,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:49,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 22:58:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:49,809 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 22:58:49,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:58:49,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375091225] [2024-11-09 22:58:49,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375091225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:58:49,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:58:49,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 22:58:49,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875898633] [2024-11-09 22:58:49,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:58:49,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:58:49,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:58:49,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:58:49,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:58:49,811 INFO L87 Difference]: Start difference. First operand 1723 states and 2754 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:50,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:58:50,747 INFO L93 Difference]: Finished difference Result 4263 states and 6894 transitions. [2024-11-09 22:58:50,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 22:58:50,747 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 137 [2024-11-09 22:58:50,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:58:50,757 INFO L225 Difference]: With dead ends: 4263 [2024-11-09 22:58:50,757 INFO L226 Difference]: Without dead ends: 2808 [2024-11-09 22:58:50,761 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-09 22:58:50,762 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1089 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 1333 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1104 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 22:58:50,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1104 Valid, 869 Invalid, 1657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1333 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 22:58:50,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2024-11-09 22:58:50,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2629. [2024-11-09 22:58:50,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2209 states have (on average 1.520597555454957) internal successors, (3359), 2214 states have internal predecessors, (3359), 399 states have call successors, (399), 16 states have call predecessors, (399), 20 states have return successors, (446), 398 states have call predecessors, (446), 398 states have call successors, (446) [2024-11-09 22:58:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 4204 transitions. [2024-11-09 22:58:50,853 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 4204 transitions. Word has length 137 [2024-11-09 22:58:50,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:58:50,853 INFO L471 AbstractCegarLoop]: Abstraction has 2629 states and 4204 transitions. [2024-11-09 22:58:50,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:50,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 4204 transitions. [2024-11-09 22:58:50,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 22:58:50,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:58:50,861 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 22:58:50,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 22:58:50,861 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:58:50,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:58:50,861 INFO L85 PathProgramCache]: Analyzing trace with hash 520067319, now seen corresponding path program 1 times [2024-11-09 22:58:50,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:58:50,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177941126] [2024-11-09 22:58:50,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:50,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:58:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:50,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:58:50,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:50,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:58:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:50,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:58:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:50,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:58:50,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:50,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:58:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:50,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 22:58:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:50,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 22:58:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:50,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 22:58:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:50,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 22:58:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:50,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 22:58:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:50,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 22:58:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:50,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-09 22:58:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:50,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-09 22:58:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:50,956 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 22:58:50,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:58:50,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177941126] [2024-11-09 22:58:50,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177941126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:58:50,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:58:50,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 22:58:50,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677202240] [2024-11-09 22:58:50,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:58:50,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:58:50,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:58:50,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:58:50,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:58:50,957 INFO L87 Difference]: Start difference. First operand 2629 states and 4204 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:51,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:58:51,868 INFO L93 Difference]: Finished difference Result 6399 states and 10370 transitions. [2024-11-09 22:58:51,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 22:58:51,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 138 [2024-11-09 22:58:51,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:58:51,880 INFO L225 Difference]: With dead ends: 6399 [2024-11-09 22:58:51,881 INFO L226 Difference]: Without dead ends: 4268 [2024-11-09 22:58:51,884 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-09 22:58:51,885 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1064 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 22:58:51,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 869 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1377 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 22:58:51,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2024-11-09 22:58:51,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4089. [2024-11-09 22:58:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4089 states, 3490 states have (on average 1.5177650429799427) internal successors, (5297), 3495 states have internal predecessors, (5297), 578 states have call successors, (578), 16 states have call predecessors, (578), 20 states have return successors, (651), 577 states have call predecessors, (651), 577 states have call successors, (651) [2024-11-09 22:58:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4089 states to 4089 states and 6526 transitions. [2024-11-09 22:58:51,980 INFO L78 Accepts]: Start accepts. Automaton has 4089 states and 6526 transitions. Word has length 138 [2024-11-09 22:58:51,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:58:51,980 INFO L471 AbstractCegarLoop]: Abstraction has 4089 states and 6526 transitions. [2024-11-09 22:58:51,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:51,980 INFO L276 IsEmpty]: Start isEmpty. Operand 4089 states and 6526 transitions. [2024-11-09 22:58:51,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 22:58:51,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:58:51,991 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 22:58:51,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 22:58:51,991 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:58:51,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:58:51,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1638969777, now seen corresponding path program 1 times [2024-11-09 22:58:51,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:58:51,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085127687] [2024-11-09 22:58:51,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:51,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:58:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:52,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:58:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:52,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:58:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:52,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:58:52,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:52,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:58:52,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:52,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:58:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:52,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 22:58:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:52,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 22:58:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:52,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 22:58:52,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:52,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 22:58:52,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:52,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 22:58:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:52,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 22:58:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:52,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 22:58:52,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:52,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 22:58:52,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 22:58:52,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:58:52,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085127687] [2024-11-09 22:58:52,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085127687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:58:52,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:58:52,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 22:58:52,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123482153] [2024-11-09 22:58:52,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:58:52,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:58:52,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:58:52,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:58:52,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:58:52,096 INFO L87 Difference]: Start difference. First operand 4089 states and 6526 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:53,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:58:53,119 INFO L93 Difference]: Finished difference Result 9942 states and 16112 transitions. [2024-11-09 22:58:53,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 22:58:53,120 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 139 [2024-11-09 22:58:53,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:58:53,143 INFO L225 Difference]: With dead ends: 9942 [2024-11-09 22:58:53,143 INFO L226 Difference]: Without dead ends: 6705 [2024-11-09 22:58:53,150 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-09 22:58:53,150 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 1098 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 22:58:53,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 906 Invalid, 1698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 22:58:53,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6705 states. [2024-11-09 22:58:53,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6705 to 6526. [2024-11-09 22:58:53,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6526 states, 5551 states have (on average 1.505134210052243) internal successors, (8355), 5556 states have internal predecessors, (8355), 954 states have call successors, (954), 16 states have call predecessors, (954), 20 states have return successors, (1071), 953 states have call predecessors, (1071), 953 states have call successors, (1071) [2024-11-09 22:58:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6526 states to 6526 states and 10380 transitions. [2024-11-09 22:58:53,345 INFO L78 Accepts]: Start accepts. Automaton has 6526 states and 10380 transitions. Word has length 139 [2024-11-09 22:58:53,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:58:53,345 INFO L471 AbstractCegarLoop]: Abstraction has 6526 states and 10380 transitions. [2024-11-09 22:58:53,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:53,346 INFO L276 IsEmpty]: Start isEmpty. Operand 6526 states and 10380 transitions. [2024-11-09 22:58:53,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 22:58:53,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:58:53,358 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 22:58:53,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 22:58:53,359 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:58:53,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:58:53,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1786263063, now seen corresponding path program 1 times [2024-11-09 22:58:53,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:58:53,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555602522] [2024-11-09 22:58:53,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:53,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:58:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:53,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:58:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:53,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:58:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:53,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:58:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:53,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:58:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:53,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:58:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:53,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 22:58:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:53,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 22:58:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:53,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 22:58:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:53,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 22:58:53,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:53,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-09 22:58:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:53,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 22:58:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:53,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-09 22:58:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:53,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-09 22:58:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:53,438 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 22:58:53,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:58:53,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555602522] [2024-11-09 22:58:53,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555602522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:58:53,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:58:53,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 22:58:53,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490310099] [2024-11-09 22:58:53,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:58:53,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:58:53,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:58:53,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:58:53,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:58:53,441 INFO L87 Difference]: Start difference. First operand 6526 states and 10380 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:54,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:58:54,453 INFO L93 Difference]: Finished difference Result 16365 states and 26419 transitions. [2024-11-09 22:58:54,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 22:58:54,454 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 140 [2024-11-09 22:58:54,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:58:54,489 INFO L225 Difference]: With dead ends: 16365 [2024-11-09 22:58:54,489 INFO L226 Difference]: Without dead ends: 11130 [2024-11-09 22:58:54,501 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-09 22:58:54,502 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1080 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1095 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 22:58:54,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1095 Valid, 876 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 22:58:54,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11130 states. [2024-11-09 22:58:54,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11130 to 10951. [2024-11-09 22:58:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10951 states, 9370 states have (on average 1.4987193169690503) internal successors, (14043), 9375 states have internal predecessors, (14043), 1560 states have call successors, (1560), 16 states have call predecessors, (1560), 20 states have return successors, (1755), 1559 states have call predecessors, (1755), 1559 states have call successors, (1755) [2024-11-09 22:58:54,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10951 states to 10951 states and 17358 transitions. [2024-11-09 22:58:54,818 INFO L78 Accepts]: Start accepts. Automaton has 10951 states and 17358 transitions. Word has length 140 [2024-11-09 22:58:54,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:58:54,818 INFO L471 AbstractCegarLoop]: Abstraction has 10951 states and 17358 transitions. [2024-11-09 22:58:54,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:54,819 INFO L276 IsEmpty]: Start isEmpty. Operand 10951 states and 17358 transitions. [2024-11-09 22:58:54,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 22:58:54,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:58:54,836 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 22:58:54,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 22:58:54,837 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:58:54,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:58:54,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1913075279, now seen corresponding path program 1 times [2024-11-09 22:58:54,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:58:54,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558249149] [2024-11-09 22:58:54,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:54,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:58:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:54,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:58:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:54,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:58:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:54,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:58:54,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:54,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:58:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:54,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:58:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:54,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 22:58:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:54,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 22:58:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:54,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 22:58:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:54,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 22:58:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:54,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 22:58:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:54,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 22:58:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:54,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 22:58:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:54,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 22:58:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 22:58:54,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:58:54,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558249149] [2024-11-09 22:58:54,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558249149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:58:54,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:58:54,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 22:58:54,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097890417] [2024-11-09 22:58:54,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:58:54,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:58:54,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:58:54,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:58:54,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:58:54,930 INFO L87 Difference]: Start difference. First operand 10951 states and 17358 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:56,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:58:56,182 INFO L93 Difference]: Finished difference Result 28604 states and 46020 transitions. [2024-11-09 22:58:56,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 22:58:56,182 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 141 [2024-11-09 22:58:56,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:58:56,233 INFO L225 Difference]: With dead ends: 28604 [2024-11-09 22:58:56,233 INFO L226 Difference]: Without dead ends: 19482 [2024-11-09 22:58:56,256 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-09 22:58:56,257 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 1067 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 309 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 309 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 22:58:56,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 928 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [309 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 22:58:56,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19482 states. [2024-11-09 22:58:56,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19482 to 19303. [2024-11-09 22:58:56,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19303 states, 16519 states have (on average 1.4882256795205522) internal successors, (24584), 16524 states have internal predecessors, (24584), 2763 states have call successors, (2763), 16 states have call predecessors, (2763), 20 states have return successors, (3102), 2762 states have call predecessors, (3102), 2762 states have call successors, (3102) [2024-11-09 22:58:56,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19303 states to 19303 states and 30449 transitions. [2024-11-09 22:58:56,838 INFO L78 Accepts]: Start accepts. Automaton has 19303 states and 30449 transitions. Word has length 141 [2024-11-09 22:58:56,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:58:56,840 INFO L471 AbstractCegarLoop]: Abstraction has 19303 states and 30449 transitions. [2024-11-09 22:58:56,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:56,841 INFO L276 IsEmpty]: Start isEmpty. Operand 19303 states and 30449 transitions. [2024-11-09 22:58:56,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 22:58:56,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:58:56,864 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 22:58:56,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 22:58:56,864 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:58:56,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:58:56,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2029224055, now seen corresponding path program 1 times [2024-11-09 22:58:56,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:58:56,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629863855] [2024-11-09 22:58:56,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:56,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:58:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:56,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:58:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:56,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:58:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:56,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:58:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:56,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:58:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:56,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:58:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:56,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 22:58:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:56,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 22:58:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:56,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 22:58:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:56,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 22:58:56,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:56,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 22:58:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:56,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 22:58:56,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:56,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 22:58:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:56,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 22:58:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:56,951 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 22:58:56,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:58:56,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629863855] [2024-11-09 22:58:56,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629863855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:58:56,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:58:56,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 22:58:56,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070682946] [2024-11-09 22:58:56,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:58:56,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:58:56,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:58:56,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:58:56,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:58:56,953 INFO L87 Difference]: Start difference. First operand 19303 states and 30449 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:58,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:58:58,336 INFO L93 Difference]: Finished difference Result 51552 states and 82601 transitions. [2024-11-09 22:58:58,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 22:58:58,337 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 142 [2024-11-09 22:58:58,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:58:58,433 INFO L225 Difference]: With dead ends: 51552 [2024-11-09 22:58:58,433 INFO L226 Difference]: Without dead ends: 34834 [2024-11-09 22:58:58,472 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-09 22:58:58,473 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1094 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1109 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 22:58:58,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1109 Valid, 870 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 22:58:58,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34834 states. [2024-11-09 22:58:59,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34834 to 34655. [2024-11-09 22:58:59,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34655 states, 29832 states have (on average 1.4811276481630464) internal successors, (44185), 29837 states have internal predecessors, (44185), 4802 states have call successors, (4802), 16 states have call predecessors, (4802), 20 states have return successors, (5415), 4801 states have call predecessors, (5415), 4801 states have call successors, (5415) [2024-11-09 22:58:59,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34655 states to 34655 states and 54402 transitions. [2024-11-09 22:58:59,522 INFO L78 Accepts]: Start accepts. Automaton has 34655 states and 54402 transitions. Word has length 142 [2024-11-09 22:58:59,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:58:59,522 INFO L471 AbstractCegarLoop]: Abstraction has 34655 states and 54402 transitions. [2024-11-09 22:58:59,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:58:59,523 INFO L276 IsEmpty]: Start isEmpty. Operand 34655 states and 54402 transitions. [2024-11-09 22:58:59,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 22:58:59,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:58:59,543 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 22:58:59,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 22:58:59,543 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:58:59,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:58:59,544 INFO L85 PathProgramCache]: Analyzing trace with hash -873468305, now seen corresponding path program 1 times [2024-11-09 22:58:59,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:58:59,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008385313] [2024-11-09 22:58:59,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:58:59,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:58:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:59,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:58:59,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:59,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:58:59,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:59,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:58:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:59,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:58:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:59,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:58:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:59,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 22:58:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:59,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 22:58:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:59,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 22:58:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:59,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 22:58:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:59,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 22:58:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:59,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 22:58:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:59,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 22:58:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:59,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-09 22:58:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:58:59,633 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 22:58:59,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:58:59,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008385313] [2024-11-09 22:58:59,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008385313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:58:59,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:58:59,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 22:58:59,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351058177] [2024-11-09 22:58:59,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:58:59,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:58:59,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:58:59,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:58:59,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:58:59,634 INFO L87 Difference]: Start difference. First operand 34655 states and 54402 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:59:01,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:59:01,846 INFO L93 Difference]: Finished difference Result 95141 states and 151187 transitions. [2024-11-09 22:59:01,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 22:59:01,846 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 143 [2024-11-09 22:59:01,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:59:02,007 INFO L225 Difference]: With dead ends: 95141 [2024-11-09 22:59:02,007 INFO L226 Difference]: Without dead ends: 63989 [2024-11-09 22:59:02,067 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-09 22:59:02,067 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1047 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 329 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 329 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:59:02,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 887 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [329 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 22:59:02,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63989 states. [2024-11-09 22:59:03,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63989 to 63810. [2024-11-09 22:59:03,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63810 states, 55272 states have (on average 1.4732595165725866) internal successors, (81430), 55277 states have internal predecessors, (81430), 8517 states have call successors, (8517), 16 states have call predecessors, (8517), 20 states have return successors, (9662), 8516 states have call predecessors, (9662), 8516 states have call successors, (9662) [2024-11-09 22:59:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63810 states to 63810 states and 99609 transitions. [2024-11-09 22:59:04,249 INFO L78 Accepts]: Start accepts. Automaton has 63810 states and 99609 transitions. Word has length 143 [2024-11-09 22:59:04,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:59:04,250 INFO L471 AbstractCegarLoop]: Abstraction has 63810 states and 99609 transitions. [2024-11-09 22:59:04,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:59:04,250 INFO L276 IsEmpty]: Start isEmpty. Operand 63810 states and 99609 transitions. [2024-11-09 22:59:04,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 22:59:04,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:59:04,280 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 22:59:04,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 22:59:04,281 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:59:04,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:59:04,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1140799095, now seen corresponding path program 1 times [2024-11-09 22:59:04,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:59:04,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946244491] [2024-11-09 22:59:04,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:59:04,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:59:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:04,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:59:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:04,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:59:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:04,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:59:04,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:04,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:59:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:04,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:59:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:04,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 22:59:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:04,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 22:59:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:04,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 22:59:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:04,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 22:59:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:04,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 22:59:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:04,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 22:59:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:04,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-09 22:59:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:04,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-09 22:59:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 22:59:04,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:59:04,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946244491] [2024-11-09 22:59:04,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946244491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:59:04,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:59:04,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 22:59:04,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140356385] [2024-11-09 22:59:04,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:59:04,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:59:04,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:59:04,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:59:04,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:59:04,362 INFO L87 Difference]: Start difference. First operand 63810 states and 99609 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:59:06,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:59:06,885 INFO L93 Difference]: Finished difference Result 120005 states and 190467 transitions. [2024-11-09 22:59:06,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 22:59:06,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 144 [2024-11-09 22:59:06,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:59:07,346 INFO L225 Difference]: With dead ends: 120005 [2024-11-09 22:59:07,346 INFO L226 Difference]: Without dead ends: 119863 [2024-11-09 22:59:07,369 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-09 22:59:07,369 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1049 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1363 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1063 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 1363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 22:59:07,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1063 Valid, 872 Invalid, 1698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 1363 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 22:59:07,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119863 states. [2024-11-09 22:59:10,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119863 to 119684. [2024-11-09 22:59:10,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119684 states, 104347 states have (on average 1.4644886772020278) internal successors, (152815), 104352 states have internal predecessors, (152815), 15316 states have call successors, (15316), 16 states have call predecessors, (15316), 20 states have return successors, (17507), 15315 states have call predecessors, (17507), 15315 states have call successors, (17507) [2024-11-09 22:59:10,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119684 states to 119684 states and 185638 transitions. [2024-11-09 22:59:10,834 INFO L78 Accepts]: Start accepts. Automaton has 119684 states and 185638 transitions. Word has length 144 [2024-11-09 22:59:10,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:59:10,835 INFO L471 AbstractCegarLoop]: Abstraction has 119684 states and 185638 transitions. [2024-11-09 22:59:10,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:59:10,835 INFO L276 IsEmpty]: Start isEmpty. Operand 119684 states and 185638 transitions. [2024-11-09 22:59:10,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 22:59:10,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:59:10,868 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 22:59:10,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 22:59:10,868 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:59:10,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:59:10,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1001257599, now seen corresponding path program 2 times [2024-11-09 22:59:10,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:59:10,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663316646] [2024-11-09 22:59:10,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:59:10,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:59:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:10,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:59:10,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:10,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:59:10,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:10,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:59:10,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:10,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:59:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:10,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:59:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:10,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 22:59:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:10,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 22:59:10,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:10,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 22:59:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:10,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 22:59:10,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:10,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 22:59:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:10,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 22:59:10,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:10,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 22:59:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:10,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 22:59:10,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:10,986 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-11-09 22:59:10,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:59:10,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663316646] [2024-11-09 22:59:10,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663316646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:59:10,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:59:10,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 22:59:10,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090247269] [2024-11-09 22:59:10,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:59:10,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 22:59:10,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:59:10,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 22:59:10,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 22:59:10,989 INFO L87 Difference]: Start difference. First operand 119684 states and 185638 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:59:14,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:59:14,391 INFO L93 Difference]: Finished difference Result 233841 states and 366218 transitions. [2024-11-09 22:59:14,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 22:59:14,392 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 145 [2024-11-09 22:59:14,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:59:14,978 INFO L225 Difference]: With dead ends: 233841 [2024-11-09 22:59:14,978 INFO L226 Difference]: Without dead ends: 119863 [2024-11-09 22:59:15,111 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-09 22:59:15,111 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 1090 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 1699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 22:59:15,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 1470 Invalid, 1699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 22:59:15,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119863 states. [2024-11-09 22:59:17,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119863 to 119684. [2024-11-09 22:59:18,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119684 states, 104347 states have (on average 1.4545602652687668) internal successors, (151779), 104352 states have internal predecessors, (151779), 15316 states have call successors, (15316), 16 states have call predecessors, (15316), 20 states have return successors, (17507), 15315 states have call predecessors, (17507), 15315 states have call successors, (17507) [2024-11-09 22:59:18,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119684 states to 119684 states and 184602 transitions. [2024-11-09 22:59:18,362 INFO L78 Accepts]: Start accepts. Automaton has 119684 states and 184602 transitions. Word has length 145 [2024-11-09 22:59:18,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:59:18,363 INFO L471 AbstractCegarLoop]: Abstraction has 119684 states and 184602 transitions. [2024-11-09 22:59:18,363 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-09 22:59:18,363 INFO L276 IsEmpty]: Start isEmpty. Operand 119684 states and 184602 transitions. [2024-11-09 22:59:18,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 22:59:18,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:59:18,388 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 22:59:18,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 22:59:18,388 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:59:18,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:59:18,389 INFO L85 PathProgramCache]: Analyzing trace with hash 800320143, now seen corresponding path program 1 times [2024-11-09 22:59:18,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:59:18,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193975355] [2024-11-09 22:59:18,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:59:18,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:59:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:18,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:59:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:18,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:59:18,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:18,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:59:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:18,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:59:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:18,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:59:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:18,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 22:59:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:18,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 22:59:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:18,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 22:59:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:18,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 22:59:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:18,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 22:59:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:19,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 22:59:19,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:19,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 22:59:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:19,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 22:59:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:19,019 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-09 22:59:19,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:59:19,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193975355] [2024-11-09 22:59:19,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193975355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 22:59:19,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416048239] [2024-11-09 22:59:19,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:59:19,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:59:19,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 22:59:19,029 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-09 22:59:19,033 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-09 22:59:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:19,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 22:59:19,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 22:59:19,441 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-09 22:59:19,442 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 22:59:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-09 22:59:19,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416048239] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 22:59:19,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 22:59:19,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2024-11-09 22:59:19,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224971325] [2024-11-09 22:59:19,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 22:59:19,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 22:59:19,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:59:19,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 22:59:19,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2024-11-09 22:59:19,648 INFO L87 Difference]: Start difference. First operand 119684 states and 184602 transitions. Second operand has 21 states, 21 states have (on average 11.904761904761905) internal successors, (250), 16 states have internal predecessors, (250), 4 states have call successors, (42), 10 states have call predecessors, (42), 8 states have return successors, (35), 5 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-09 22:59:26,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 22:59:26,080 INFO L93 Difference]: Finished difference Result 239860 states and 380832 transitions. [2024-11-09 22:59:26,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 22:59:26,082 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 11.904761904761905) internal successors, (250), 16 states have internal predecessors, (250), 4 states have call successors, (42), 10 states have call predecessors, (42), 8 states have return successors, (35), 5 states have call predecessors, (35), 4 states have call successors, (35) Word has length 145 [2024-11-09 22:59:26,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 22:59:27,100 INFO L225 Difference]: With dead ends: 239860 [2024-11-09 22:59:27,100 INFO L226 Difference]: Without dead ends: 239724 [2024-11-09 22:59:27,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 596 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=617, Invalid=2353, Unknown=0, NotChecked=0, Total=2970 [2024-11-09 22:59:27,169 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 3505 mSDsluCounter, 2365 mSDsCounter, 0 mSdLazyCounter, 5985 mSolverCounterSat, 875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3517 SdHoareTripleChecker+Valid, 2531 SdHoareTripleChecker+Invalid, 6860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 875 IncrementalHoareTripleChecker+Valid, 5985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 22:59:27,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3517 Valid, 2531 Invalid, 6860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [875 Valid, 5985 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 22:59:27,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239724 states. [2024-11-09 22:59:33,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239724 to 239368. [2024-11-09 22:59:33,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239368 states, 208696 states have (on average 1.4545702840495265) internal successors, (303563), 208703 states have internal predecessors, (303563), 30630 states have call successors, (30630), 34 states have call predecessors, (30630), 41 states have return successors, (37192), 30630 states have call predecessors, (37192), 30628 states have call successors, (37192) [2024-11-09 22:59:33,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239368 states to 239368 states and 371385 transitions. [2024-11-09 22:59:33,875 INFO L78 Accepts]: Start accepts. Automaton has 239368 states and 371385 transitions. Word has length 145 [2024-11-09 22:59:33,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 22:59:33,875 INFO L471 AbstractCegarLoop]: Abstraction has 239368 states and 371385 transitions. [2024-11-09 22:59:33,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 11.904761904761905) internal successors, (250), 16 states have internal predecessors, (250), 4 states have call successors, (42), 10 states have call predecessors, (42), 8 states have return successors, (35), 5 states have call predecessors, (35), 4 states have call successors, (35) [2024-11-09 22:59:33,876 INFO L276 IsEmpty]: Start isEmpty. Operand 239368 states and 371385 transitions. [2024-11-09 22:59:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-09 22:59:33,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 22:59:33,945 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 22:59:33,959 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-09 22:59:34,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 22:59:34,146 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 22:59:34,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 22:59:34,146 INFO L85 PathProgramCache]: Analyzing trace with hash -2139486887, now seen corresponding path program 1 times [2024-11-09 22:59:34,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 22:59:34,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983568178] [2024-11-09 22:59:34,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 22:59:34,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 22:59:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:34,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 22:59:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:34,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 22:59:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:34,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 22:59:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:34,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 22:59:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:34,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 22:59:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:34,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 22:59:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:34,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 22:59:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:34,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 22:59:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:34,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-09 22:59:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:34,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 22:59:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:34,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 22:59:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:34,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-09 22:59:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:34,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-09 22:59:34,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:34,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-09 22:59:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 22:59:34,339 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-09 22:59:34,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 22:59:34,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983568178] [2024-11-09 22:59:34,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983568178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 22:59:34,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 22:59:34,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 22:59:34,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382608136] [2024-11-09 22:59:34,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 22:59:34,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 22:59:34,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 22:59:34,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 22:59:34,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 22:59:34,341 INFO L87 Difference]: Start difference. First operand 239368 states and 371385 transitions. Second operand has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 5 states have internal predecessors, (105), 3 states have call successors, (16), 7 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14)