./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product13.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product13.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 a4d75af8ac92d9f5b92cf5fbd6315f6202b8108aa1e42fc32d65f286c89fdf2f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 21:55:59,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 21:55:59,985 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 21:55:59,992 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 21:55:59,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 21:56:00,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 21:56:00,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 21:56:00,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 21:56:00,027 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 21:56:00,028 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 21:56:00,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 21:56:00,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 21:56:00,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 21:56:00,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 21:56:00,033 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 21:56:00,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 21:56:00,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 21:56:00,034 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 21:56:00,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 21:56:00,034 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 21:56:00,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 21:56:00,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 21:56:00,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 21:56:00,039 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 21:56:00,040 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 21:56:00,040 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 21:56:00,040 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 21:56:00,040 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 21:56:00,041 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 21:56:00,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 21:56:00,041 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 21:56:00,041 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 21:56:00,042 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:56:00,042 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 21:56:00,042 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 21:56:00,042 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 21:56:00,043 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 21:56:00,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 21:56:00,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 21:56:00,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 21:56:00,046 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 21:56:00,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 21:56:00,047 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 -> a4d75af8ac92d9f5b92cf5fbd6315f6202b8108aa1e42fc32d65f286c89fdf2f [2024-11-19 21:56:00,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 21:56:00,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 21:56:00,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 21:56:00,340 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 21:56:00,340 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 21:56:00,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product13.cil.c [2024-11-19 21:56:01,823 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 21:56:02,118 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 21:56:02,119 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product13.cil.c [2024-11-19 21:56:02,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/885e02022/39364e99dea744a58db7e8ac3b9eeb76/FLAG68b8950a8 [2024-11-19 21:56:02,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/885e02022/39364e99dea744a58db7e8ac3b9eeb76 [2024-11-19 21:56:02,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 21:56:02,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 21:56:02,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 21:56:02,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 21:56:02,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 21:56:02,419 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:56:02" (1/1) ... [2024-11-19 21:56:02,420 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d3b001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:02, skipping insertion in model container [2024-11-19 21:56:02,420 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:56:02" (1/1) ... [2024-11-19 21:56:02,481 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 21:56:02,976 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_spec4_product13.cil.c[42804,42817] [2024-11-19 21:56:03,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:56:03,097 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 21:56:03,109 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [48] [2024-11-19 21:56:03,111 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [90] [2024-11-19 21:56:03,111 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [456] [2024-11-19 21:56:03,111 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [474] [2024-11-19 21:56:03,111 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [512] [2024-11-19 21:56:03,112 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1591] [2024-11-19 21:56:03,112 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1871] [2024-11-19 21:56:03,112 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1880] [2024-11-19 21:56:03,113 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2093] [2024-11-19 21:56:03,113 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2504] [2024-11-19 21:56:03,113 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2758] [2024-11-19 21:56:03,202 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_spec4_product13.cil.c[42804,42817] [2024-11-19 21:56:03,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:56:03,317 INFO L204 MainTranslator]: Completed translation [2024-11-19 21:56:03,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:03 WrapperNode [2024-11-19 21:56:03,318 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 21:56:03,319 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 21:56:03,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 21:56:03,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 21:56:03,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:03" (1/1) ... [2024-11-19 21:56:03,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:03" (1/1) ... [2024-11-19 21:56:03,429 INFO L138 Inliner]: procedures = 124, calls = 177, calls flagged for inlining = 53, calls inlined = 44, statements flattened = 843 [2024-11-19 21:56:03,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 21:56:03,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 21:56:03,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 21:56:03,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 21:56:03,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:03" (1/1) ... [2024-11-19 21:56:03,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:03" (1/1) ... [2024-11-19 21:56:03,455 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:03" (1/1) ... [2024-11-19 21:56:03,489 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-11-19 21:56:03,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:03" (1/1) ... [2024-11-19 21:56:03,490 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:03" (1/1) ... [2024-11-19 21:56:03,503 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:03" (1/1) ... [2024-11-19 21:56:03,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:03" (1/1) ... [2024-11-19 21:56:03,517 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:03" (1/1) ... [2024-11-19 21:56:03,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:03" (1/1) ... [2024-11-19 21:56:03,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 21:56:03,532 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 21:56:03,533 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 21:56:03,533 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 21:56:03,537 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:03" (1/1) ... [2024-11-19 21:56:03,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:56:03,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:56:03,583 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 21:56:03,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 21:56:03,640 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-11-19 21:56:03,640 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-11-19 21:56:03,640 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-19 21:56:03,641 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-19 21:56:03,641 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-19 21:56:03,641 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-19 21:56:03,641 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-19 21:56:03,641 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-19 21:56:03,642 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-19 21:56:03,642 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-19 21:56:03,642 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-19 21:56:03,643 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-19 21:56:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-19 21:56:03,643 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-19 21:56:03,643 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-19 21:56:03,644 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-19 21:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-19 21:56:03,644 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-19 21:56:03,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 21:56:03,645 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-19 21:56:03,645 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-19 21:56:03,646 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-19 21:56:03,646 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-19 21:56:03,647 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-19 21:56:03,647 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-19 21:56:03,647 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-19 21:56:03,647 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-19 21:56:03,647 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-19 21:56:03,647 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-19 21:56:03,647 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-19 21:56:03,647 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-19 21:56:03,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 21:56:03,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 21:56:03,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 21:56:03,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 21:56:03,648 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-19 21:56:03,648 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-19 21:56:03,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 21:56:03,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 21:56:03,861 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 21:56:03,865 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 21:56:04,675 INFO L? ?]: Removed 363 outVars from TransFormulas that were not future-live. [2024-11-19 21:56:04,675 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 21:56:04,699 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 21:56:04,700 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 21:56:04,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:56:04 BoogieIcfgContainer [2024-11-19 21:56:04,700 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 21:56:04,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 21:56:04,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 21:56:04,707 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 21:56:04,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:56:02" (1/3) ... [2024-11-19 21:56:04,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76673469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:56:04, skipping insertion in model container [2024-11-19 21:56:04,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:03" (2/3) ... [2024-11-19 21:56:04,708 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76673469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:56:04, skipping insertion in model container [2024-11-19 21:56:04,708 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:56:04" (3/3) ... [2024-11-19 21:56:04,709 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec4_product13.cil.c [2024-11-19 21:56:04,729 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 21:56:04,729 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 21:56:04,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 21:56:04,807 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;@f8facde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 21:56:04,807 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 21:56:04,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 271 states, 216 states have (on average 1.5509259259259258) internal successors, (335), 218 states have internal predecessors, (335), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-19 21:56:04,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-19 21:56:04,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:04,831 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:04,832 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:04,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:04,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1430097031, now seen corresponding path program 1 times [2024-11-19 21:56:04,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:04,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889677452] [2024-11-19 21:56:04,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:04,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:05,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:05,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:05,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:05,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:56:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:05,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:56:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:05,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:56:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:05,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:56:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:05,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-19 21:56:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:05,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-19 21:56:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:05,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:56:05,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:05,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:56:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:05,686 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-19 21:56:05,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:05,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889677452] [2024-11-19 21:56:05,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889677452] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:56:05,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604468993] [2024-11-19 21:56:05,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:05,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:56:05,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:56:05,692 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:56:05,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 21:56:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:06,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 21:56:06,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:56:06,044 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-19 21:56:06,045 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:56:06,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604468993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:06,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:56:06,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-11-19 21:56:06,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149329159] [2024-11-19 21:56:06,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:06,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 21:56:06,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:06,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 21:56:06,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:56:06,087 INFO L87 Difference]: Start difference. First operand has 271 states, 216 states have (on average 1.5509259259259258) internal successors, (335), 218 states have internal predecessors, (335), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:06,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:06,129 INFO L93 Difference]: Finished difference Result 393 states and 580 transitions. [2024-11-19 21:56:06,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 21:56:06,131 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2024-11-19 21:56:06,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:06,149 INFO L225 Difference]: With dead ends: 393 [2024-11-19 21:56:06,150 INFO L226 Difference]: Without dead ends: 264 [2024-11-19 21:56:06,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:56:06,162 INFO L432 NwaCegarLoop]: 405 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, 405 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:06,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:56:06,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-19 21:56:06,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-11-19 21:56:06,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 210 states have (on average 1.542857142857143) internal successors, (324), 211 states have internal predecessors, (324), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 21:56:06,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 397 transitions. [2024-11-19 21:56:06,243 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 397 transitions. Word has length 89 [2024-11-19 21:56:06,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:06,244 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 397 transitions. [2024-11-19 21:56:06,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:06,245 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 397 transitions. [2024-11-19 21:56:06,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-19 21:56:06,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:06,255 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:06,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 21:56:06,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 21:56:06,458 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:06,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:06,459 INFO L85 PathProgramCache]: Analyzing trace with hash 146243453, now seen corresponding path program 1 times [2024-11-19 21:56:06,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:06,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89657445] [2024-11-19 21:56:06,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:06,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:06,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:06,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:06,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:06,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:56:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:06,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:56:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:06,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:56:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:06,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-19 21:56:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:06,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-19 21:56:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:06,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 21:56:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:06,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 21:56:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:06,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:56:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:06,812 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-19 21:56:06,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89657445] [2024-11-19 21:56:06,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89657445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:56:06,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721217962] [2024-11-19 21:56:06,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:06,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:56:06,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:56:06,819 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:56:06,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 21:56:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:07,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 888 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 21:56:07,151 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:56:07,183 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-19 21:56:07,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:56:07,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721217962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:07,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:56:07,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-19 21:56:07,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389948271] [2024-11-19 21:56:07,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:07,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 21:56:07,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:07,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 21:56:07,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:56:07,190 INFO L87 Difference]: Start difference. First operand 264 states and 397 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:07,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:07,243 INFO L93 Difference]: Finished difference Result 383 states and 561 transitions. [2024-11-19 21:56:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 21:56:07,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2024-11-19 21:56:07,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:07,247 INFO L225 Difference]: With dead ends: 383 [2024-11-19 21:56:07,249 INFO L226 Difference]: Without dead ends: 267 [2024-11-19 21:56:07,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:56:07,251 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 1 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:07,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 788 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:56:07,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-19 21:56:07,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2024-11-19 21:56:07,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 212 states have (on average 1.5377358490566038) internal successors, (326), 213 states have internal predecessors, (326), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-19 21:56:07,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 399 transitions. [2024-11-19 21:56:07,283 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 399 transitions. Word has length 90 [2024-11-19 21:56:07,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:07,284 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 399 transitions. [2024-11-19 21:56:07,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 399 transitions. [2024-11-19 21:56:07,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 21:56:07,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:07,288 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:07,301 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 21:56:07,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-19 21:56:07,492 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:07,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:07,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1669237862, now seen corresponding path program 1 times [2024-11-19 21:56:07,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:07,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405494012] [2024-11-19 21:56:07,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:07,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:07,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:07,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:07,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:07,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:56:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:07,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:56:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:07,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:56:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:07,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-19 21:56:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:07,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-19 21:56:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:07,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 21:56:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:07,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:56:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:07,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:56:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:56:07,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:07,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405494012] [2024-11-19 21:56:07,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405494012] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:56:07,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854179127] [2024-11-19 21:56:07,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:07,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:56:07,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:56:07,814 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:56:07,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 21:56:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:08,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 900 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 21:56:08,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:56:08,124 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-19 21:56:08,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:56:08,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854179127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:08,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:56:08,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-19 21:56:08,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228224056] [2024-11-19 21:56:08,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:08,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 21:56:08,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:08,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 21:56:08,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:56:08,129 INFO L87 Difference]: Start difference. First operand 266 states and 399 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:08,169 INFO L93 Difference]: Finished difference Result 557 states and 849 transitions. [2024-11-19 21:56:08,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 21:56:08,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2024-11-19 21:56:08,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:08,173 INFO L225 Difference]: With dead ends: 557 [2024-11-19 21:56:08,173 INFO L226 Difference]: Without dead ends: 318 [2024-11-19 21:56:08,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:56:08,176 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 99 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:08,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 749 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:56:08,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-19 21:56:08,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 310. [2024-11-19 21:56:08,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 245 states have (on average 1.5510204081632653) internal successors, (380), 246 states have internal predecessors, (380), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-19 21:56:08,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 475 transitions. [2024-11-19 21:56:08,213 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 475 transitions. Word has length 96 [2024-11-19 21:56:08,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:08,214 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 475 transitions. [2024-11-19 21:56:08,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 475 transitions. [2024-11-19 21:56:08,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 21:56:08,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:08,218 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:08,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 21:56:08,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:56:08,419 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:08,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:08,420 INFO L85 PathProgramCache]: Analyzing trace with hash -242486194, now seen corresponding path program 1 times [2024-11-19 21:56:08,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:08,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341284153] [2024-11-19 21:56:08,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:08,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:08,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:08,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:08,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:08,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:08,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:08,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:56:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:08,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:56:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:08,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:56:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:08,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-19 21:56:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:08,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-19 21:56:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:08,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 21:56:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:08,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:56:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:08,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-19 21:56:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:08,661 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:56:08,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:08,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341284153] [2024-11-19 21:56:08,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341284153] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:56:08,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856192504] [2024-11-19 21:56:08,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:08,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:56:08,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:56:08,665 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:56:08,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 21:56:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:08,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 21:56:08,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:56:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 21:56:09,030 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:56:09,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856192504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:09,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:56:09,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-11-19 21:56:09,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302104471] [2024-11-19 21:56:09,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:09,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:56:09,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:09,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:56:09,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:56:09,035 INFO L87 Difference]: Start difference. First operand 310 states and 475 transitions. Second operand has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-19 21:56:09,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:09,095 INFO L93 Difference]: Finished difference Result 611 states and 940 transitions. [2024-11-19 21:56:09,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:56:09,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2024-11-19 21:56:09,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:09,100 INFO L225 Difference]: With dead ends: 611 [2024-11-19 21:56:09,100 INFO L226 Difference]: Without dead ends: 312 [2024-11-19 21:56:09,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:56:09,103 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 2 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:09,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1545 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:56:09,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-19 21:56:09,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2024-11-19 21:56:09,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 246 states have (on average 1.548780487804878) internal successors, (381), 248 states have internal predecessors, (381), 48 states have call successors, (48), 16 states have call predecessors, (48), 17 states have return successors, (49), 47 states have call predecessors, (49), 47 states have call successors, (49) [2024-11-19 21:56:09,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 478 transitions. [2024-11-19 21:56:09,122 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 478 transitions. Word has length 97 [2024-11-19 21:56:09,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:09,123 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 478 transitions. [2024-11-19 21:56:09,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.75) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-19 21:56:09,123 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 478 transitions. [2024-11-19 21:56:09,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 21:56:09,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:09,126 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:09,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 21:56:09,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:56:09,327 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:09,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:09,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1730126550, now seen corresponding path program 1 times [2024-11-19 21:56:09,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:09,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734555875] [2024-11-19 21:56:09,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:09,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:09,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:09,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:09,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:09,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:56:09,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:09,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:56:09,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:09,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:56:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:09,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-19 21:56:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:09,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-19 21:56:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:09,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:56:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:09,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-19 21:56:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:09,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:56:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 21:56:09,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:09,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734555875] [2024-11-19 21:56:09,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734555875] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:56:09,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156224515] [2024-11-19 21:56:09,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:09,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:56:09,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:56:09,577 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:56:09,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 21:56:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:09,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 906 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 21:56:09,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:56:09,875 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 21:56:09,876 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:56:09,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156224515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:09,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:56:09,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-11-19 21:56:09,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421411927] [2024-11-19 21:56:09,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:09,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:56:09,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:09,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:56:09,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:56:09,878 INFO L87 Difference]: Start difference. First operand 312 states and 478 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-19 21:56:09,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:09,948 INFO L93 Difference]: Finished difference Result 613 states and 945 transitions. [2024-11-19 21:56:09,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:56:09,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 98 [2024-11-19 21:56:09,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:09,951 INFO L225 Difference]: With dead ends: 613 [2024-11-19 21:56:09,951 INFO L226 Difference]: Without dead ends: 314 [2024-11-19 21:56:09,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:56:09,953 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 2 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1531 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:09,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1531 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:56:09,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-19 21:56:09,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2024-11-19 21:56:09,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 247 states have (on average 1.5465587044534412) internal successors, (382), 250 states have internal predecessors, (382), 48 states have call successors, (48), 16 states have call predecessors, (48), 18 states have return successors, (54), 47 states have call predecessors, (54), 47 states have call successors, (54) [2024-11-19 21:56:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 484 transitions. [2024-11-19 21:56:09,968 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 484 transitions. Word has length 98 [2024-11-19 21:56:09,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:09,968 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 484 transitions. [2024-11-19 21:56:09,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-19 21:56:09,968 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 484 transitions. [2024-11-19 21:56:09,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-19 21:56:09,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:09,970 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:09,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-19 21:56:10,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:56:10,171 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:10,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:10,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1369225661, now seen corresponding path program 1 times [2024-11-19 21:56:10,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:10,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133685770] [2024-11-19 21:56:10,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:10,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:10,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:10,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:10,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:10,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:56:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:10,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:56:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:10,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-19 21:56:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:10,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-19 21:56:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:10,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-19 21:56:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:10,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-19 21:56:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:10,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-19 21:56:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:10,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:56:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:10,369 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:56:10,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:10,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133685770] [2024-11-19 21:56:10,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133685770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:10,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:56:10,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 21:56:10,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520604868] [2024-11-19 21:56:10,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:10,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 21:56:10,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:10,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 21:56:10,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:56:10,371 INFO L87 Difference]: Start difference. First operand 314 states and 484 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-19 21:56:11,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:11,650 INFO L93 Difference]: Finished difference Result 669 states and 1040 transitions. [2024-11-19 21:56:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:56:11,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 99 [2024-11-19 21:56:11,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:11,654 INFO L225 Difference]: With dead ends: 669 [2024-11-19 21:56:11,654 INFO L226 Difference]: Without dead ends: 378 [2024-11-19 21:56:11,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:56:11,656 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 617 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:11,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 926 Invalid, 1738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1585 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 21:56:11,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-19 21:56:11,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 314. [2024-11-19 21:56:11,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 247 states have (on average 1.5465587044534412) internal successors, (382), 250 states have internal predecessors, (382), 48 states have call successors, (48), 16 states have call predecessors, (48), 18 states have return successors, (53), 47 states have call predecessors, (53), 47 states have call successors, (53) [2024-11-19 21:56:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 483 transitions. [2024-11-19 21:56:11,700 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 483 transitions. Word has length 99 [2024-11-19 21:56:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:11,702 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 483 transitions. [2024-11-19 21:56:11,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-19 21:56:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 483 transitions. [2024-11-19 21:56:11,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-19 21:56:11,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:11,705 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:11,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 21:56:11,705 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:11,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:11,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1151020745, now seen corresponding path program 2 times [2024-11-19 21:56:11,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:11,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117326510] [2024-11-19 21:56:11,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:11,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:11,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:11,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:11,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:11,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:56:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:11,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:56:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:11,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:56:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:11,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-19 21:56:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:11,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 21:56:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:11,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:56:11,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:11,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-19 21:56:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:11,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-19 21:56:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:11,901 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:56:11,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:11,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117326510] [2024-11-19 21:56:11,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117326510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:11,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:56:11,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 21:56:11,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435506247] [2024-11-19 21:56:11,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:11,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 21:56:11,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:11,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 21:56:11,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:56:11,904 INFO L87 Difference]: Start difference. First operand 314 states and 483 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-19 21:56:13,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:13,136 INFO L93 Difference]: Finished difference Result 671 states and 1043 transitions. [2024-11-19 21:56:13,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:56:13,136 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2024-11-19 21:56:13,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:13,142 INFO L225 Difference]: With dead ends: 671 [2024-11-19 21:56:13,142 INFO L226 Difference]: Without dead ends: 380 [2024-11-19 21:56:13,143 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:56:13,144 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 614 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:13,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 926 Invalid, 1756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1605 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 21:56:13,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-19 21:56:13,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 316. [2024-11-19 21:56:13,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 248 states have (on average 1.5443548387096775) internal successors, (383), 252 states have internal predecessors, (383), 48 states have call successors, (48), 16 states have call predecessors, (48), 19 states have return successors, (55), 47 states have call predecessors, (55), 47 states have call successors, (55) [2024-11-19 21:56:13,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 486 transitions. [2024-11-19 21:56:13,174 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 486 transitions. Word has length 100 [2024-11-19 21:56:13,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:13,175 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 486 transitions. [2024-11-19 21:56:13,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-19 21:56:13,175 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 486 transitions. [2024-11-19 21:56:13,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-19 21:56:13,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:13,177 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:13,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 21:56:13,177 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:13,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:13,178 INFO L85 PathProgramCache]: Analyzing trace with hash 257753346, now seen corresponding path program 1 times [2024-11-19 21:56:13,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:13,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871232609] [2024-11-19 21:56:13,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:13,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:13,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:13,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:13,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:13,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:13,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:13,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:56:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:13,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:56:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:13,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:56:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:13,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-19 21:56:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:13,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-19 21:56:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:13,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:56:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:13,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-19 21:56:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:13,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:56:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:13,385 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 21:56:13,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:13,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871232609] [2024-11-19 21:56:13,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871232609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:13,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:56:13,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 21:56:13,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144152927] [2024-11-19 21:56:13,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:13,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 21:56:13,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:13,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 21:56:13,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:56:13,387 INFO L87 Difference]: Start difference. First operand 316 states and 486 transitions. Second operand has 11 states, 10 states have (on average 6.6) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-19 21:56:15,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:15,044 INFO L93 Difference]: Finished difference Result 669 states and 1038 transitions. [2024-11-19 21:56:15,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 21:56:15,045 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 101 [2024-11-19 21:56:15,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:15,047 INFO L225 Difference]: With dead ends: 669 [2024-11-19 21:56:15,047 INFO L226 Difference]: Without dead ends: 380 [2024-11-19 21:56:15,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-19 21:56:15,050 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 617 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 2702 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 2858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 2702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:15,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1329 Invalid, 2858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 2702 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 21:56:15,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-19 21:56:15,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 316. [2024-11-19 21:56:15,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 248 states have (on average 1.5443548387096775) internal successors, (383), 252 states have internal predecessors, (383), 48 states have call successors, (48), 16 states have call predecessors, (48), 19 states have return successors, (54), 47 states have call predecessors, (54), 47 states have call successors, (54) [2024-11-19 21:56:15,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 485 transitions. [2024-11-19 21:56:15,073 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 485 transitions. Word has length 101 [2024-11-19 21:56:15,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:15,073 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 485 transitions. [2024-11-19 21:56:15,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-19 21:56:15,074 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 485 transitions. [2024-11-19 21:56:15,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 21:56:15,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:15,075 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:15,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 21:56:15,076 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:15,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:15,076 INFO L85 PathProgramCache]: Analyzing trace with hash -608894531, now seen corresponding path program 2 times [2024-11-19 21:56:15,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:15,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009060014] [2024-11-19 21:56:15,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:15,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:15,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:15,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:15,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:15,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:15,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:56:15,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:15,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:56:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:15,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:56:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:15,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-19 21:56:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:15,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 21:56:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:15,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:56:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:15,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:56:15,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:15,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:56:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:15,294 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 21:56:15,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:15,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009060014] [2024-11-19 21:56:15,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009060014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:15,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:56:15,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 21:56:15,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330377571] [2024-11-19 21:56:15,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:15,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 21:56:15,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:15,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 21:56:15,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:56:15,297 INFO L87 Difference]: Start difference. First operand 316 states and 485 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-19 21:56:16,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:16,810 INFO L93 Difference]: Finished difference Result 671 states and 1044 transitions. [2024-11-19 21:56:16,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 21:56:16,811 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 102 [2024-11-19 21:56:16,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:16,813 INFO L225 Difference]: With dead ends: 671 [2024-11-19 21:56:16,814 INFO L226 Difference]: Without dead ends: 382 [2024-11-19 21:56:16,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-19 21:56:16,817 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 614 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 2721 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 2877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 2721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:16,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1330 Invalid, 2877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 2721 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 21:56:16,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-19 21:56:16,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 318. [2024-11-19 21:56:16,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 249 states have (on average 1.5421686746987953) internal successors, (384), 254 states have internal predecessors, (384), 48 states have call successors, (48), 16 states have call predecessors, (48), 20 states have return successors, (59), 47 states have call predecessors, (59), 47 states have call successors, (59) [2024-11-19 21:56:16,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 491 transitions. [2024-11-19 21:56:16,839 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 491 transitions. Word has length 102 [2024-11-19 21:56:16,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:16,839 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 491 transitions. [2024-11-19 21:56:16,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-19 21:56:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 491 transitions. [2024-11-19 21:56:16,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 21:56:16,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:16,841 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:16,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 21:56:16,841 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:16,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:16,842 INFO L85 PathProgramCache]: Analyzing trace with hash -303425497, now seen corresponding path program 1 times [2024-11-19 21:56:16,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:16,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146639347] [2024-11-19 21:56:16,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:16,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:16,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:16,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:16,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:16,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:16,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:56:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:16,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:56:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:16,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:56:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:16,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-19 21:56:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:16,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:56:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:16,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:56:16,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:16,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:56:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:17,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:56:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:17,004 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:56:17,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:17,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146639347] [2024-11-19 21:56:17,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146639347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:56:17,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381949842] [2024-11-19 21:56:17,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:17,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:56:17,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:56:17,007 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:56:17,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 21:56:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:17,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 911 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 21:56:17,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:56:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:56:17,268 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:56:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:56:17,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381949842] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:56:17,337 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:56:17,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-11-19 21:56:17,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680447235] [2024-11-19 21:56:17,337 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:56:17,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 21:56:17,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:17,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 21:56:17,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:56:17,339 INFO L87 Difference]: Start difference. First operand 318 states and 491 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 7 states have internal predecessors, (89), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 21:56:18,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:18,405 INFO L93 Difference]: Finished difference Result 825 states and 1342 transitions. [2024-11-19 21:56:18,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 21:56:18,406 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 7 states have internal predecessors, (89), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2024-11-19 21:56:18,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:18,410 INFO L225 Difference]: With dead ends: 825 [2024-11-19 21:56:18,410 INFO L226 Difference]: Without dead ends: 709 [2024-11-19 21:56:18,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:56:18,412 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 1131 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:18,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 1161 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 21:56:18,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2024-11-19 21:56:18,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 621. [2024-11-19 21:56:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 488 states have (on average 1.6024590163934427) internal successors, (782), 493 states have internal predecessors, (782), 112 states have call successors, (112), 16 states have call predecessors, (112), 20 states have return successors, (133), 111 states have call predecessors, (133), 111 states have call successors, (133) [2024-11-19 21:56:18,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1027 transitions. [2024-11-19 21:56:18,453 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1027 transitions. Word has length 103 [2024-11-19 21:56:18,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:18,454 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 1027 transitions. [2024-11-19 21:56:18,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 7 states have internal predecessors, (89), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 21:56:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1027 transitions. [2024-11-19 21:56:18,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 21:56:18,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:18,457 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:18,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 21:56:18,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:56:18,658 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:18,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:18,658 INFO L85 PathProgramCache]: Analyzing trace with hash -431869596, now seen corresponding path program 1 times [2024-11-19 21:56:18,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:18,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379047041] [2024-11-19 21:56:18,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:18,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:18,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:18,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:18,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:18,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:56:18,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:18,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:56:18,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:18,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:56:18,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:18,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-19 21:56:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:18,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-19 21:56:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:18,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:56:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:18,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:56:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:18,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:56:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:56:18,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:18,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379047041] [2024-11-19 21:56:18,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379047041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:18,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:56:18,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:56:18,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362859835] [2024-11-19 21:56:18,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:18,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:56:18,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:18,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:56:18,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:56:18,775 INFO L87 Difference]: Start difference. First operand 621 states and 1027 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:19,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:19,653 INFO L93 Difference]: Finished difference Result 1546 states and 2621 transitions. [2024-11-19 21:56:19,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:56:19,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2024-11-19 21:56:19,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:19,660 INFO L225 Difference]: With dead ends: 1546 [2024-11-19 21:56:19,661 INFO L226 Difference]: Without dead ends: 993 [2024-11-19 21:56:19,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:56:19,664 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 710 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:19,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 661 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 21:56:19,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2024-11-19 21:56:19,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 921. [2024-11-19 21:56:19,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 724 states have (on average 1.611878453038674) internal successors, (1167), 729 states have internal predecessors, (1167), 176 states have call successors, (176), 16 states have call predecessors, (176), 20 states have return successors, (207), 175 states have call predecessors, (207), 175 states have call successors, (207) [2024-11-19 21:56:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1550 transitions. [2024-11-19 21:56:19,736 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1550 transitions. Word has length 109 [2024-11-19 21:56:19,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:19,736 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1550 transitions. [2024-11-19 21:56:19,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:19,737 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1550 transitions. [2024-11-19 21:56:19,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 21:56:19,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:19,743 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:19,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 21:56:19,743 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:19,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:19,744 INFO L85 PathProgramCache]: Analyzing trace with hash -285337811, now seen corresponding path program 1 times [2024-11-19 21:56:19,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:19,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622360877] [2024-11-19 21:56:19,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:19,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:19,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:19,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:19,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:19,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:19,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:56:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:19,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:56:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:19,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:56:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:19,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-19 21:56:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:19,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:56:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:19,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-19 21:56:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:19,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:56:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:19,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:56:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:56:19,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:19,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622360877] [2024-11-19 21:56:19,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622360877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:19,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:56:19,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:56:19,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237847981] [2024-11-19 21:56:19,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:19,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:56:19,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:19,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:56:19,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:56:19,872 INFO L87 Difference]: Start difference. First operand 921 states and 1550 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:20,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:20,749 INFO L93 Difference]: Finished difference Result 2261 states and 3866 transitions. [2024-11-19 21:56:20,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:56:20,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2024-11-19 21:56:20,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:20,759 INFO L225 Difference]: With dead ends: 2261 [2024-11-19 21:56:20,759 INFO L226 Difference]: Without dead ends: 1461 [2024-11-19 21:56:20,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:56:20,764 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 708 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:20,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 648 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 21:56:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2024-11-19 21:56:20,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 1389. [2024-11-19 21:56:20,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1097 states have (on average 1.6171376481312671) internal successors, (1774), 1102 states have internal predecessors, (1774), 271 states have call successors, (271), 16 states have call predecessors, (271), 20 states have return successors, (302), 270 states have call predecessors, (302), 270 states have call successors, (302) [2024-11-19 21:56:20,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 2347 transitions. [2024-11-19 21:56:20,839 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 2347 transitions. Word has length 110 [2024-11-19 21:56:20,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:20,840 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 2347 transitions. [2024-11-19 21:56:20,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 2347 transitions. [2024-11-19 21:56:20,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 21:56:20,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:20,846 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:20,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 21:56:20,847 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:20,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:20,847 INFO L85 PathProgramCache]: Analyzing trace with hash -630367642, now seen corresponding path program 1 times [2024-11-19 21:56:20,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:20,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498609408] [2024-11-19 21:56:20,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:20,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:20,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:20,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:20,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:20,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:20,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:56:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:20,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:56:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:20,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:56:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:20,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 21:56:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:20,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:56:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:20,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:56:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:20,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:56:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:20,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:56:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:56:20,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:20,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498609408] [2024-11-19 21:56:20,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498609408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:20,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:56:20,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:56:20,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906970873] [2024-11-19 21:56:20,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:20,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:56:20,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:20,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:56:20,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:56:20,941 INFO L87 Difference]: Start difference. First operand 1389 states and 2347 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:21,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:21,767 INFO L93 Difference]: Finished difference Result 3308 states and 5707 transitions. [2024-11-19 21:56:21,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:56:21,768 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2024-11-19 21:56:21,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:21,781 INFO L225 Difference]: With dead ends: 3308 [2024-11-19 21:56:21,781 INFO L226 Difference]: Without dead ends: 2165 [2024-11-19 21:56:21,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:56:21,787 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 706 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:21,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 646 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 21:56:21,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2165 states. [2024-11-19 21:56:21,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2165 to 2093. [2024-11-19 21:56:21,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2093 states, 1678 states have (on average 1.6215733015494636) internal successors, (2721), 1683 states have internal predecessors, (2721), 394 states have call successors, (394), 16 states have call predecessors, (394), 20 states have return successors, (441), 393 states have call predecessors, (441), 393 states have call successors, (441) [2024-11-19 21:56:21,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2093 states to 2093 states and 3556 transitions. [2024-11-19 21:56:21,914 INFO L78 Accepts]: Start accepts. Automaton has 2093 states and 3556 transitions. Word has length 111 [2024-11-19 21:56:21,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:21,914 INFO L471 AbstractCegarLoop]: Abstraction has 2093 states and 3556 transitions. [2024-11-19 21:56:21,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:21,915 INFO L276 IsEmpty]: Start isEmpty. Operand 2093 states and 3556 transitions. [2024-11-19 21:56:21,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 21:56:21,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:21,923 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:21,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 21:56:21,923 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:21,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:21,923 INFO L85 PathProgramCache]: Analyzing trace with hash 848726510, now seen corresponding path program 1 times [2024-11-19 21:56:21,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:21,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632817710] [2024-11-19 21:56:21,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:21,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:21,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:21,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:21,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:21,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:21,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:21,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:56:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:21,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:56:21,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:22,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:56:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:22,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-19 21:56:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:22,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:56:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:22,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:56:22,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:22,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:56:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:22,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-19 21:56:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:22,019 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:56:22,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:22,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632817710] [2024-11-19 21:56:22,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632817710] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:22,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:56:22,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:56:22,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814873823] [2024-11-19 21:56:22,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:22,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:56:22,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:22,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:56:22,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:56:22,022 INFO L87 Difference]: Start difference. First operand 2093 states and 3556 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:22,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:22,819 INFO L93 Difference]: Finished difference Result 4927 states and 8561 transitions. [2024-11-19 21:56:22,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:56:22,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2024-11-19 21:56:22,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:22,839 INFO L225 Difference]: With dead ends: 4927 [2024-11-19 21:56:22,839 INFO L226 Difference]: Without dead ends: 3284 [2024-11-19 21:56:22,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:56:22,845 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 704 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:22,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 646 Invalid, 1064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 21:56:22,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3284 states. [2024-11-19 21:56:22,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3284 to 3212. [2024-11-19 21:56:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3212 states, 2618 states have (on average 1.624140565317036) internal successors, (4252), 2623 states have internal predecessors, (4252), 573 states have call successors, (573), 16 states have call predecessors, (573), 20 states have return successors, (646), 572 states have call predecessors, (646), 572 states have call successors, (646) [2024-11-19 21:56:22,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3212 states to 3212 states and 5471 transitions. [2024-11-19 21:56:22,984 INFO L78 Accepts]: Start accepts. Automaton has 3212 states and 5471 transitions. Word has length 112 [2024-11-19 21:56:22,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:22,984 INFO L471 AbstractCegarLoop]: Abstraction has 3212 states and 5471 transitions. [2024-11-19 21:56:22,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:22,984 INFO L276 IsEmpty]: Start isEmpty. Operand 3212 states and 5471 transitions. [2024-11-19 21:56:22,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 21:56:22,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:22,993 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:22,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 21:56:22,993 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:22,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:22,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1608170622, now seen corresponding path program 1 times [2024-11-19 21:56:22,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:22,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155280210] [2024-11-19 21:56:22,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:22,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:23,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:23,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:23,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:23,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:23,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:56:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:23,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:56:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:23,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:56:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:23,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 21:56:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:23,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:56:23,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:23,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-19 21:56:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:23,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-19 21:56:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:23,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 21:56:23,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:56:23,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:23,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155280210] [2024-11-19 21:56:23,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155280210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:23,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:56:23,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:56:23,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211837277] [2024-11-19 21:56:23,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:23,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:56:23,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:23,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:56:23,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:56:23,089 INFO L87 Difference]: Start difference. First operand 3212 states and 5471 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:23,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:23,933 INFO L93 Difference]: Finished difference Result 7845 states and 13660 transitions. [2024-11-19 21:56:23,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:56:23,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2024-11-19 21:56:23,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:23,965 INFO L225 Difference]: With dead ends: 7845 [2024-11-19 21:56:23,965 INFO L226 Difference]: Without dead ends: 5315 [2024-11-19 21:56:23,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:56:23,976 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 702 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:23,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 685 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 907 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 21:56:23,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5315 states. [2024-11-19 21:56:24,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5315 to 5243. [2024-11-19 21:56:24,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5243 states, 4273 states have (on average 1.615726655745378) internal successors, (6904), 4278 states have internal predecessors, (6904), 949 states have call successors, (949), 16 states have call predecessors, (949), 20 states have return successors, (1066), 948 states have call predecessors, (1066), 948 states have call successors, (1066) [2024-11-19 21:56:24,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 8919 transitions. [2024-11-19 21:56:24,252 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 8919 transitions. Word has length 113 [2024-11-19 21:56:24,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:24,252 INFO L471 AbstractCegarLoop]: Abstraction has 5243 states and 8919 transitions. [2024-11-19 21:56:24,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:24,253 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 8919 transitions. [2024-11-19 21:56:24,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 21:56:24,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:24,266 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:24,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 21:56:24,266 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:24,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:24,267 INFO L85 PathProgramCache]: Analyzing trace with hash 334385362, now seen corresponding path program 1 times [2024-11-19 21:56:24,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:24,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586915371] [2024-11-19 21:56:24,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:24,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:24,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:24,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:24,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:24,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:24,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:56:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:24,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:56:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:24,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:56:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:24,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:56:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:24,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-19 21:56:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:24,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:56:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:24,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-19 21:56:24,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:24,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-19 21:56:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:24,371 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:56:24,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:24,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586915371] [2024-11-19 21:56:24,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586915371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:24,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:56:24,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:56:24,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714240885] [2024-11-19 21:56:24,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:24,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:56:24,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:24,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:56:24,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:56:24,376 INFO L87 Difference]: Start difference. First operand 5243 states and 8919 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:25,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:25,246 INFO L93 Difference]: Finished difference Result 12987 states and 22569 transitions. [2024-11-19 21:56:25,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:56:25,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 114 [2024-11-19 21:56:25,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:25,299 INFO L225 Difference]: With dead ends: 12987 [2024-11-19 21:56:25,299 INFO L226 Difference]: Without dead ends: 8803 [2024-11-19 21:56:25,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:56:25,318 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 700 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:25,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 647 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 21:56:25,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8803 states. [2024-11-19 21:56:25,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8803 to 8731. [2024-11-19 21:56:25,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8731 states, 7155 states have (on average 1.6125786163522013) internal successors, (11538), 7160 states have internal predecessors, (11538), 1555 states have call successors, (1555), 16 states have call predecessors, (1555), 20 states have return successors, (1750), 1554 states have call predecessors, (1750), 1554 states have call successors, (1750) [2024-11-19 21:56:25,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8731 states to 8731 states and 14843 transitions. [2024-11-19 21:56:25,739 INFO L78 Accepts]: Start accepts. Automaton has 8731 states and 14843 transitions. Word has length 114 [2024-11-19 21:56:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:25,740 INFO L471 AbstractCegarLoop]: Abstraction has 8731 states and 14843 transitions. [2024-11-19 21:56:25,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 8731 states and 14843 transitions. [2024-11-19 21:56:25,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 21:56:25,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:25,757 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:25,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 21:56:25,757 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:25,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:25,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1948475804, now seen corresponding path program 1 times [2024-11-19 21:56:25,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:25,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67224620] [2024-11-19 21:56:25,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:25,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:25,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:25,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:25,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:25,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:56:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:25,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:56:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:25,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:56:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:25,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:56:25,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:25,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-19 21:56:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:25,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:56:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:25,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-19 21:56:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:25,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-19 21:56:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:25,854 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:56:25,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:25,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67224620] [2024-11-19 21:56:25,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67224620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:25,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:56:25,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:56:25,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367036282] [2024-11-19 21:56:25,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:25,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:56:25,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:25,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:56:25,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:56:25,857 INFO L87 Difference]: Start difference. First operand 8731 states and 14843 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:27,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:27,108 INFO L93 Difference]: Finished difference Result 22646 states and 39275 transitions. [2024-11-19 21:56:27,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:56:27,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2024-11-19 21:56:27,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:27,172 INFO L225 Difference]: With dead ends: 22646 [2024-11-19 21:56:27,173 INFO L226 Difference]: Without dead ends: 15396 [2024-11-19 21:56:27,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:56:27,195 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 698 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:27,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 690 Invalid, 1091 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 21:56:27,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15396 states. [2024-11-19 21:56:27,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15396 to 15324. [2024-11-19 21:56:27,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15324 states, 12545 states have (on average 1.6025508170585891) internal successors, (20104), 12550 states have internal predecessors, (20104), 2758 states have call successors, (2758), 16 states have call predecessors, (2758), 20 states have return successors, (3097), 2757 states have call predecessors, (3097), 2757 states have call successors, (3097) [2024-11-19 21:56:27,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15324 states to 15324 states and 25959 transitions. [2024-11-19 21:56:27,820 INFO L78 Accepts]: Start accepts. Automaton has 15324 states and 25959 transitions. Word has length 115 [2024-11-19 21:56:27,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:27,820 INFO L471 AbstractCegarLoop]: Abstraction has 15324 states and 25959 transitions. [2024-11-19 21:56:27,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:27,821 INFO L276 IsEmpty]: Start isEmpty. Operand 15324 states and 25959 transitions. [2024-11-19 21:56:27,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 21:56:27,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:27,843 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:27,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 21:56:27,844 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:27,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:27,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1783036109, now seen corresponding path program 1 times [2024-11-19 21:56:27,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:27,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200487200] [2024-11-19 21:56:27,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:27,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:27,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:27,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:27,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:27,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:27,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:27,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:27,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:56:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:27,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:56:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:27,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:56:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:27,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:56:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:27,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-19 21:56:27,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:27,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:56:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:27,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:56:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:27,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-19 21:56:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:56:27,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:27,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200487200] [2024-11-19 21:56:27,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200487200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:27,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:56:27,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:56:27,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095911783] [2024-11-19 21:56:27,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:27,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:56:27,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:27,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:56:27,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:56:27,955 INFO L87 Difference]: Start difference. First operand 15324 states and 25959 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:29,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:29,309 INFO L93 Difference]: Finished difference Result 40602 states and 70258 transitions. [2024-11-19 21:56:29,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:56:29,310 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2024-11-19 21:56:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:29,463 INFO L225 Difference]: With dead ends: 40602 [2024-11-19 21:56:29,463 INFO L226 Difference]: Without dead ends: 27366 [2024-11-19 21:56:29,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:56:29,524 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 696 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:29,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 647 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 21:56:29,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27366 states. [2024-11-19 21:56:30,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27366 to 27294. [2024-11-19 21:56:30,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27294 states, 22476 states have (on average 1.597793201637302) internal successors, (35912), 22481 states have internal predecessors, (35912), 4797 states have call successors, (4797), 16 states have call predecessors, (4797), 20 states have return successors, (5410), 4796 states have call predecessors, (5410), 4796 states have call successors, (5410) [2024-11-19 21:56:30,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27294 states to 27294 states and 46119 transitions. [2024-11-19 21:56:30,717 INFO L78 Accepts]: Start accepts. Automaton has 27294 states and 46119 transitions. Word has length 116 [2024-11-19 21:56:30,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:30,719 INFO L471 AbstractCegarLoop]: Abstraction has 27294 states and 46119 transitions. [2024-11-19 21:56:30,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:30,719 INFO L276 IsEmpty]: Start isEmpty. Operand 27294 states and 46119 transitions. [2024-11-19 21:56:30,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-19 21:56:30,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:30,741 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:30,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 21:56:30,741 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:30,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:30,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1541785178, now seen corresponding path program 1 times [2024-11-19 21:56:30,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:30,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523911421] [2024-11-19 21:56:30,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:30,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:30,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:30,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:30,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:30,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:30,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:56:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:30,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:56:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:30,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:56:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:30,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 21:56:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:30,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-19 21:56:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:30,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:56:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:30,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:56:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:30,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-19 21:56:30,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:30,838 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:56:30,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:30,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523911421] [2024-11-19 21:56:30,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523911421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:30,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:56:30,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:56:30,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841492252] [2024-11-19 21:56:30,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:30,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:56:30,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:30,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:56:30,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:56:30,839 INFO L87 Difference]: Start difference. First operand 27294 states and 46119 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:32,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:32,681 INFO L93 Difference]: Finished difference Result 74389 states and 127857 transitions. [2024-11-19 21:56:32,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:56:32,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 117 [2024-11-19 21:56:32,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:32,935 INFO L225 Difference]: With dead ends: 74389 [2024-11-19 21:56:32,936 INFO L226 Difference]: Without dead ends: 49915 [2024-11-19 21:56:33,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:56:33,039 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 694 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:33,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 652 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 21:56:33,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49915 states. [2024-11-19 21:56:34,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49915 to 49843. [2024-11-19 21:56:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49843 states, 41310 states have (on average 1.5916969256838538) internal successors, (65753), 41315 states have internal predecessors, (65753), 8512 states have call successors, (8512), 16 states have call predecessors, (8512), 20 states have return successors, (9657), 8511 states have call predecessors, (9657), 8511 states have call successors, (9657) [2024-11-19 21:56:34,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49843 states to 49843 states and 83922 transitions. [2024-11-19 21:56:35,023 INFO L78 Accepts]: Start accepts. Automaton has 49843 states and 83922 transitions. Word has length 117 [2024-11-19 21:56:35,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:35,025 INFO L471 AbstractCegarLoop]: Abstraction has 49843 states and 83922 transitions. [2024-11-19 21:56:35,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:35,025 INFO L276 IsEmpty]: Start isEmpty. Operand 49843 states and 83922 transitions. [2024-11-19 21:56:35,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-19 21:56:35,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:35,051 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:35,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 21:56:35,051 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:35,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:35,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1856285709, now seen corresponding path program 1 times [2024-11-19 21:56:35,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:35,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14335457] [2024-11-19 21:56:35,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:35,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:35,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:35,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:35,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:35,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:56:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:35,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:56:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:35,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:56:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:35,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 21:56:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:35,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:56:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:35,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:56:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:35,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:56:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:35,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-19 21:56:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:56:35,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:35,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14335457] [2024-11-19 21:56:35,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14335457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:35,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:56:35,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:56:35,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646123006] [2024-11-19 21:56:35,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:35,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:56:35,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:35,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:56:35,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:56:35,166 INFO L87 Difference]: Start difference. First operand 49843 states and 83922 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:38,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:38,145 INFO L93 Difference]: Finished difference Result 92875 states and 159988 transitions. [2024-11-19 21:56:38,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:56:38,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 118 [2024-11-19 21:56:38,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:38,715 INFO L225 Difference]: With dead ends: 92875 [2024-11-19 21:56:38,716 INFO L226 Difference]: Without dead ends: 92759 [2024-11-19 21:56:38,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:56:38,753 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 689 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:38,753 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 679 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 21:56:38,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92759 states. [2024-11-19 21:56:41,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92759 to 92687. [2024-11-19 21:56:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92687 states, 77355 states have (on average 1.5841122099411802) internal successors, (122539), 77360 states have internal predecessors, (122539), 15311 states have call successors, (15311), 16 states have call predecessors, (15311), 20 states have return successors, (17502), 15310 states have call predecessors, (17502), 15310 states have call successors, (17502) [2024-11-19 21:56:42,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92687 states to 92687 states and 155352 transitions. [2024-11-19 21:56:42,207 INFO L78 Accepts]: Start accepts. Automaton has 92687 states and 155352 transitions. Word has length 118 [2024-11-19 21:56:42,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:42,208 INFO L471 AbstractCegarLoop]: Abstraction has 92687 states and 155352 transitions. [2024-11-19 21:56:42,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:42,208 INFO L276 IsEmpty]: Start isEmpty. Operand 92687 states and 155352 transitions. [2024-11-19 21:56:42,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 21:56:42,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:42,233 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:42,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 21:56:42,233 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:42,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:42,233 INFO L85 PathProgramCache]: Analyzing trace with hash -773662011, now seen corresponding path program 1 times [2024-11-19 21:56:42,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:42,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128309766] [2024-11-19 21:56:42,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:42,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:42,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:42,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:42,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:42,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:56:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:42,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:56:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:42,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:56:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:42,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:56:42,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:42,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:56:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:42,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-19 21:56:42,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:42,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-19 21:56:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:42,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-19 21:56:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:42,440 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:56:42,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:42,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128309766] [2024-11-19 21:56:42,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128309766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:42,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:56:42,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:56:42,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100401049] [2024-11-19 21:56:42,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:42,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:56:42,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:42,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:56:42,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:56:42,443 INFO L87 Difference]: Start difference. First operand 92687 states and 155352 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:46,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:46,205 INFO L93 Difference]: Finished difference Result 93023 states and 159116 transitions. [2024-11-19 21:56:46,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 21:56:46,205 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 119 [2024-11-19 21:56:46,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:46,590 INFO L225 Difference]: With dead ends: 93023 [2024-11-19 21:56:46,591 INFO L226 Difference]: Without dead ends: 92917 [2024-11-19 21:56:46,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2024-11-19 21:56:46,641 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 1000 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 2826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:46,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 959 Invalid, 2826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 21:56:46,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92917 states. [2024-11-19 21:56:49,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92917 to 92795. [2024-11-19 21:56:49,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92795 states, 77443 states have (on average 1.5839649806954792) internal successors, (122667), 77448 states have internal predecessors, (122667), 15321 states have call successors, (15321), 24 states have call predecessors, (15321), 30 states have return successors, (17515), 15322 states have call predecessors, (17515), 15319 states have call successors, (17515) [2024-11-19 21:56:50,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92795 states to 92795 states and 155503 transitions. [2024-11-19 21:56:50,086 INFO L78 Accepts]: Start accepts. Automaton has 92795 states and 155503 transitions. Word has length 119 [2024-11-19 21:56:50,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:50,086 INFO L471 AbstractCegarLoop]: Abstraction has 92795 states and 155503 transitions. [2024-11-19 21:56:50,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:56:50,086 INFO L276 IsEmpty]: Start isEmpty. Operand 92795 states and 155503 transitions. [2024-11-19 21:56:50,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-19 21:56:50,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:50,104 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:50,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 21:56:50,105 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:50,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:50,105 INFO L85 PathProgramCache]: Analyzing trace with hash -850075122, now seen corresponding path program 1 times [2024-11-19 21:56:50,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:50,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323221945] [2024-11-19 21:56:50,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:50,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:50,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:50,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:50,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:50,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:56:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:50,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:56:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:50,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:56:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:50,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:56:50,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:50,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:56:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:50,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-19 21:56:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:50,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-19 21:56:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:50,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-19 21:56:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:50,406 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:56:50,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:50,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323221945] [2024-11-19 21:56:50,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323221945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:50,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:56:50,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 21:56:50,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048698389] [2024-11-19 21:56:50,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:50,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 21:56:50,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:50,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 21:56:50,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:56:50,412 INFO L87 Difference]: Start difference. First operand 92795 states and 155503 transitions. Second operand has 14 states, 12 states have (on average 6.666666666666667) internal successors, (80), 10 states have internal predecessors, (80), 7 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-19 21:56:54,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:56:54,460 INFO L93 Difference]: Finished difference Result 93337 states and 159599 transitions. [2024-11-19 21:56:54,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 21:56:54,460 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.666666666666667) internal successors, (80), 10 states have internal predecessors, (80), 7 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) Word has length 120 [2024-11-19 21:56:54,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:56:54,799 INFO L225 Difference]: With dead ends: 93337 [2024-11-19 21:56:54,800 INFO L226 Difference]: Without dead ends: 92963 [2024-11-19 21:56:54,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2024-11-19 21:56:54,843 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 1163 mSDsluCounter, 1598 mSDsCounter, 0 mSdLazyCounter, 3271 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 3523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 3271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-19 21:56:54,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 1768 Invalid, 3523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 3271 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-19 21:56:54,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92963 states. [2024-11-19 21:56:58,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92963 to 92832. [2024-11-19 21:56:58,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92832 states, 77472 states have (on average 1.5838883725733168) internal successors, (122707), 77480 states have internal predecessors, (122707), 15327 states have call successors, (15327), 25 states have call predecessors, (15327), 32 states have return successors, (17523), 15326 states have call predecessors, (17523), 15325 states have call successors, (17523) [2024-11-19 21:56:58,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92832 states to 92832 states and 155557 transitions. [2024-11-19 21:56:58,383 INFO L78 Accepts]: Start accepts. Automaton has 92832 states and 155557 transitions. Word has length 120 [2024-11-19 21:56:58,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:56:58,384 INFO L471 AbstractCegarLoop]: Abstraction has 92832 states and 155557 transitions. [2024-11-19 21:56:58,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.666666666666667) internal successors, (80), 10 states have internal predecessors, (80), 7 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-19 21:56:58,384 INFO L276 IsEmpty]: Start isEmpty. Operand 92832 states and 155557 transitions. [2024-11-19 21:56:58,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-19 21:56:58,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:56:58,414 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:56:58,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 21:56:58,414 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:56:58,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:56:58,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1874175611, now seen corresponding path program 1 times [2024-11-19 21:56:58,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:56:58,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820681820] [2024-11-19 21:56:58,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:56:58,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:56:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:58,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:56:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:58,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:56:58,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:58,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:56:58,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:58,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:56:58,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:58,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:56:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:58,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:56:58,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:58,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:56:58,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:58,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:56:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:58,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:56:58,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:58,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-19 21:56:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:58,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-19 21:56:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:56:58,631 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:56:58,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:56:58,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820681820] [2024-11-19 21:56:58,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820681820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:56:58,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:56:58,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 21:56:58,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162063880] [2024-11-19 21:56:58,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:56:58,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 21:56:58,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:56:58,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 21:56:58,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:56:58,634 INFO L87 Difference]: Start difference. First operand 92832 states and 155557 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:57:02,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:57:02,557 INFO L93 Difference]: Finished difference Result 93409 states and 159681 transitions. [2024-11-19 21:57:02,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 21:57:02,558 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 123 [2024-11-19 21:57:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:57:02,928 INFO L225 Difference]: With dead ends: 93409 [2024-11-19 21:57:02,928 INFO L226 Difference]: Without dead ends: 93341 [2024-11-19 21:57:02,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2024-11-19 21:57:02,960 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 1115 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 2710 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 2975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 2710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:57:02,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 1345 Invalid, 2975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 2710 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-19 21:57:03,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93341 states. [2024-11-19 21:57:05,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93341 to 93095. [2024-11-19 21:57:06,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93095 states, 77685 states have (on average 1.583484585183755) internal successors, (123013), 77696 states have internal predecessors, (123013), 15352 states have call successors, (15352), 41 states have call predecessors, (15352), 57 states have return successors, (17563), 15357 states have call predecessors, (17563), 15348 states have call successors, (17563) [2024-11-19 21:57:06,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93095 states to 93095 states and 155928 transitions. [2024-11-19 21:57:06,323 INFO L78 Accepts]: Start accepts. Automaton has 93095 states and 155928 transitions. Word has length 123 [2024-11-19 21:57:06,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:57:06,324 INFO L471 AbstractCegarLoop]: Abstraction has 93095 states and 155928 transitions. [2024-11-19 21:57:06,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-19 21:57:06,324 INFO L276 IsEmpty]: Start isEmpty. Operand 93095 states and 155928 transitions. [2024-11-19 21:57:06,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 21:57:06,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:57:06,355 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:57:06,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 21:57:06,356 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:57:06,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:57:06,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1765914484, now seen corresponding path program 1 times [2024-11-19 21:57:06,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:57:06,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443715447] [2024-11-19 21:57:06,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:57:06,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:57:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:57:06,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:57:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:57:06,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:57:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:57:06,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:57:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:57:06,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:57:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:57:06,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:57:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:57:06,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:57:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:57:06,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:57:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:57:06,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:57:06,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:57:06,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:57:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:57:06,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-19 21:57:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:57:06,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-19 21:57:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:57:06,653 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-19 21:57:06,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:57:06,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443715447] [2024-11-19 21:57:06,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443715447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:57:06,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:57:06,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-19 21:57:06,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949989356] [2024-11-19 21:57:06,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:57:06,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 21:57:06,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:57:06,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 21:57:06,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:57:06,656 INFO L87 Difference]: Start difference. First operand 93095 states and 155928 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 9 states have internal predecessors, (87), 5 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-19 21:57:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:57:10,647 INFO L93 Difference]: Finished difference Result 93551 states and 159879 transitions. [2024-11-19 21:57:10,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-19 21:57:10,648 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 9 states have internal predecessors, (87), 5 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 124 [2024-11-19 21:57:10,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:57:10,934 INFO L225 Difference]: With dead ends: 93551 [2024-11-19 21:57:10,934 INFO L226 Difference]: Without dead ends: 93327 [2024-11-19 21:57:10,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2024-11-19 21:57:10,970 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1166 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 3288 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 3518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 3288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:57:10,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 1562 Invalid, 3518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 3288 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 21:57:11,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93327 states.