./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product27.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product27.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 1c4d0e54eab5e94cf1a4af64165a2546f1c45e063bd8600195a743522777000c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 00:49:23,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 00:49:23,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 00:49:23,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 00:49:23,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 00:49:23,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 00:49:23,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 00:49:23,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 00:49:23,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 00:49:23,486 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 00:49:23,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 00:49:23,486 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 00:49:23,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 00:49:23,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 00:49:23,489 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 00:49:23,489 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 00:49:23,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 00:49:23,490 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 00:49:23,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 00:49:23,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 00:49:23,491 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 00:49:23,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 00:49:23,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 00:49:23,494 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 00:49:23,494 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 00:49:23,494 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 00:49:23,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 00:49:23,495 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 00:49:23,495 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 00:49:23,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 00:49:23,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 00:49:23,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 00:49:23,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:49:23,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 00:49:23,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 00:49:23,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 00:49:23,497 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 00:49:23,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 00:49:23,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 00:49:23,499 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 00:49:23,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 00:49:23,499 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 00:49:23,500 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 -> 1c4d0e54eab5e94cf1a4af64165a2546f1c45e063bd8600195a743522777000c [2024-10-24 00:49:23,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 00:49:23,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 00:49:23,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 00:49:23,777 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 00:49:23,778 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 00:49:23,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product27.cil.c [2024-10-24 00:49:25,176 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 00:49:25,494 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 00:49:25,494 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product27.cil.c [2024-10-24 00:49:25,523 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6269c19/58ccc57f521645c788065f8905027bb4/FLAGf6955bd3f [2024-10-24 00:49:25,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d6269c19/58ccc57f521645c788065f8905027bb4 [2024-10-24 00:49:25,542 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 00:49:25,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 00:49:25,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 00:49:25,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 00:49:25,553 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 00:49:25,554 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:49:25" (1/1) ... [2024-10-24 00:49:25,555 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@122f8480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:25, skipping insertion in model container [2024-10-24 00:49:25,555 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:49:25" (1/1) ... [2024-10-24 00:49:25,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 00:49:26,141 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product27.cil.c[40661,40674] [2024-10-24 00:49:26,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:49:26,222 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 00:49:26,231 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2024-10-24 00:49:26,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [167] [2024-10-24 00:49:26,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [184] [2024-10-24 00:49:26,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [550] [2024-10-24 00:49:26,233 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [612] [2024-10-24 00:49:26,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [650] [2024-10-24 00:49:26,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1054] [2024-10-24 00:49:26,234 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1435] [2024-10-24 00:49:26,235 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1756] [2024-10-24 00:49:26,235 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1978] [2024-10-24 00:49:26,236 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1987] [2024-10-24 00:49:26,295 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product27.cil.c[40661,40674] [2024-10-24 00:49:26,314 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:49:26,352 INFO L204 MainTranslator]: Completed translation [2024-10-24 00:49:26,353 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26 WrapperNode [2024-10-24 00:49:26,353 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 00:49:26,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 00:49:26,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 00:49:26,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 00:49:26,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,390 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,447 INFO L138 Inliner]: procedures = 134, calls = 215, calls flagged for inlining = 63, calls inlined = 60, statements flattened = 1103 [2024-10-24 00:49:26,448 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 00:49:26,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 00:49:26,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 00:49:26,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 00:49:26,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,470 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,499 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-10-24 00:49:26,503 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,503 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,534 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,546 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 00:49:26,569 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 00:49:26,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 00:49:26,570 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 00:49:26,578 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (1/1) ... [2024-10-24 00:49:26,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:49:26,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:49:26,628 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-10-24 00:49:26,634 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-10-24 00:49:26,677 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2024-10-24 00:49:26,678 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2024-10-24 00:49:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2024-10-24 00:49:26,678 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2024-10-24 00:49:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-24 00:49:26,678 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-24 00:49:26,678 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2024-10-24 00:49:26,679 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2024-10-24 00:49:26,679 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-24 00:49:26,680 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-24 00:49:26,680 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-24 00:49:26,680 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-24 00:49:26,680 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-24 00:49:26,680 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-24 00:49:26,681 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-24 00:49:26,681 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-24 00:49:26,681 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-24 00:49:26,681 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-24 00:49:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-24 00:49:26,683 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-24 00:49:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2024-10-24 00:49:26,683 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2024-10-24 00:49:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-24 00:49:26,683 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-24 00:49:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 00:49:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-24 00:49:26,684 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-24 00:49:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-24 00:49:26,684 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-24 00:49:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2024-10-24 00:49:26,684 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2024-10-24 00:49:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-24 00:49:26,684 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-24 00:49:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-24 00:49:26,685 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-24 00:49:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-24 00:49:26,685 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-24 00:49:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-24 00:49:26,685 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-24 00:49:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-24 00:49:26,685 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-24 00:49:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-24 00:49:26,686 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-24 00:49:26,686 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-24 00:49:26,686 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-24 00:49:26,686 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-24 00:49:26,686 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-24 00:49:26,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 00:49:26,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 00:49:26,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 00:49:26,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 00:49:26,687 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-24 00:49:26,688 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-24 00:49:26,688 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2024-10-24 00:49:26,688 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2024-10-24 00:49:26,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 00:49:26,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 00:49:26,911 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 00:49:26,915 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 00:49:27,855 INFO L? ?]: Removed 564 outVars from TransFormulas that were not future-live. [2024-10-24 00:49:27,855 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 00:49:27,928 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 00:49:27,930 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 00:49:27,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:49:27 BoogieIcfgContainer [2024-10-24 00:49:27,931 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 00:49:27,933 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 00:49:27,933 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 00:49:27,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 00:49:27,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:49:25" (1/3) ... [2024-10-24 00:49:27,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0142ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:49:27, skipping insertion in model container [2024-10-24 00:49:27,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:26" (2/3) ... [2024-10-24 00:49:27,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a0142ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:49:27, skipping insertion in model container [2024-10-24 00:49:27,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:49:27" (3/3) ... [2024-10-24 00:49:27,940 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec3_product27.cil.c [2024-10-24 00:49:27,955 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 00:49:27,956 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 00:49:28,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 00:49:28,049 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;@472d23bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 00:49:28,049 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 00:49:28,055 INFO L276 IsEmpty]: Start isEmpty. Operand has 390 states, 297 states have (on average 1.6094276094276094) internal successors, (478), 302 states have internal predecessors, (478), 66 states have call successors, (66), 25 states have call predecessors, (66), 25 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-24 00:49:28,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 00:49:28,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:28,077 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:28,077 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:28,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:28,082 INFO L85 PathProgramCache]: Analyzing trace with hash 615660377, now seen corresponding path program 1 times [2024-10-24 00:49:28,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:28,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960404283] [2024-10-24 00:49:28,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:28,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:28,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:49:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:49:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:49:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 00:49:28,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 00:49:28,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 00:49:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:49:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:49:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:49:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:49:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:49:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,827 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:49:28,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:28,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960404283] [2024-10-24 00:49:28,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960404283] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:49:28,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649683059] [2024-10-24 00:49:28,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:28,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:49:28,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:49:28,831 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-10-24 00:49:28,832 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-10-24 00:49:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 00:49:29,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:49:29,237 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:49:29,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:49:29,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649683059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:29,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:49:29,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-24 00:49:29,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039499716] [2024-10-24 00:49:29,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:29,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 00:49:29,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:29,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 00:49:29,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:49:29,284 INFO L87 Difference]: Start difference. First operand has 390 states, 297 states have (on average 1.6094276094276094) internal successors, (478), 302 states have internal predecessors, (478), 66 states have call successors, (66), 25 states have call predecessors, (66), 25 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:49:29,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:29,402 INFO L93 Difference]: Finished difference Result 591 states and 912 transitions. [2024-10-24 00:49:29,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 00:49:29,405 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2024-10-24 00:49:29,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:29,424 INFO L225 Difference]: With dead ends: 591 [2024-10-24 00:49:29,424 INFO L226 Difference]: Without dead ends: 386 [2024-10-24 00:49:29,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 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-10-24 00:49:29,438 INFO L432 NwaCegarLoop]: 584 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:29,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 584 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:49:29,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-10-24 00:49:29,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2024-10-24 00:49:29,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 295 states have (on average 1.5966101694915253) internal successors, (471), 298 states have internal predecessors, (471), 66 states have call successors, (66), 25 states have call predecessors, (66), 24 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-24 00:49:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 600 transitions. [2024-10-24 00:49:29,529 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 600 transitions. Word has length 105 [2024-10-24 00:49:29,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:29,530 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 600 transitions. [2024-10-24 00:49:29,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:49:29,530 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 600 transitions. [2024-10-24 00:49:29,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 00:49:29,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:29,545 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:29,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 00:49:29,749 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-10-24 00:49:29,750 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:29,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:29,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1569228992, now seen corresponding path program 1 times [2024-10-24 00:49:29,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:29,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388949712] [2024-10-24 00:49:29,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:29,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:29,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:29,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:49:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:49:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:49:30,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:49:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 00:49:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 00:49:30,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:49:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:49:30,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:49:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:49:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:49:30,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:49:30,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:30,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388949712] [2024-10-24 00:49:30,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388949712] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:49:30,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533968578] [2024-10-24 00:49:30,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:30,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:49:30,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:49:30,071 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-10-24 00:49:30,073 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-10-24 00:49:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,385 INFO L255 TraceCheckSpWp]: Trace formula consists of 1073 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 00:49:30,392 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:49:30,425 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:49:30,425 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:49:30,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533968578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:30,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:49:30,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:49:30,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25762389] [2024-10-24 00:49:30,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:30,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:49:30,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:30,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:49:30,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:49:30,432 INFO L87 Difference]: Start difference. First operand 386 states and 600 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:49:30,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:30,523 INFO L93 Difference]: Finished difference Result 586 states and 892 transitions. [2024-10-24 00:49:30,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:49:30,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 106 [2024-10-24 00:49:30,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:30,528 INFO L225 Difference]: With dead ends: 586 [2024-10-24 00:49:30,528 INFO L226 Difference]: Without dead ends: 388 [2024-10-24 00:49:30,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:49:30,531 INFO L432 NwaCegarLoop]: 581 mSDtfsCounter, 0 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:30,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1161 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:49:30,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-24 00:49:30,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2024-10-24 00:49:30,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 297 states have (on average 1.5925925925925926) internal successors, (473), 300 states have internal predecessors, (473), 66 states have call successors, (66), 25 states have call predecessors, (66), 24 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-24 00:49:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 602 transitions. [2024-10-24 00:49:30,568 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 602 transitions. Word has length 106 [2024-10-24 00:49:30,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:30,568 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 602 transitions. [2024-10-24 00:49:30,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:49:30,569 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 602 transitions. [2024-10-24 00:49:30,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-24 00:49:30,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:30,577 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:30,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 00:49:30,777 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-10-24 00:49:30,778 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:30,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:30,779 INFO L85 PathProgramCache]: Analyzing trace with hash 929256607, now seen corresponding path program 1 times [2024-10-24 00:49:30,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:30,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056634460] [2024-10-24 00:49:30,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:30,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:30,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:49:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:49:31,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:49:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 00:49:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:49:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:49:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:49:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:49:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:49:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:49:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:49:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 00:49:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 00:49:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 00:49:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,053 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-24 00:49:31,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:31,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056634460] [2024-10-24 00:49:31,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056634460] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:49:31,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836258956] [2024-10-24 00:49:31,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:31,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:49:31,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:49:31,056 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-10-24 00:49:31,058 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-10-24 00:49:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 1166 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:49:31,365 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:49:31,384 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-24 00:49:31,385 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:49:31,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836258956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:31,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:49:31,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:49:31,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704608814] [2024-10-24 00:49:31,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:31,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:49:31,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:31,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:49:31,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:49:31,391 INFO L87 Difference]: Start difference. First operand 388 states and 602 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:49:31,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:31,465 INFO L93 Difference]: Finished difference Result 828 states and 1303 transitions. [2024-10-24 00:49:31,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:49:31,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2024-10-24 00:49:31,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:31,473 INFO L225 Difference]: With dead ends: 828 [2024-10-24 00:49:31,473 INFO L226 Difference]: Without dead ends: 462 [2024-10-24 00:49:31,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:49:31,475 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 136 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:31,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1133 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:49:31,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-24 00:49:31,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 457. [2024-10-24 00:49:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 352 states have (on average 1.6107954545454546) internal successors, (567), 355 states have internal predecessors, (567), 80 states have call successors, (80), 25 states have call predecessors, (80), 24 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2024-10-24 00:49:31,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 724 transitions. [2024-10-24 00:49:31,515 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 724 transitions. Word has length 131 [2024-10-24 00:49:31,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:31,516 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 724 transitions. [2024-10-24 00:49:31,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:49:31,516 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 724 transitions. [2024-10-24 00:49:31,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-24 00:49:31,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:31,523 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:31,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 00:49:31,726 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-10-24 00:49:31,727 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:31,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:31,727 INFO L85 PathProgramCache]: Analyzing trace with hash 669860306, now seen corresponding path program 1 times [2024-10-24 00:49:31,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:31,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698857294] [2024-10-24 00:49:31,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:31,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:31,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:31,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:49:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:49:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:49:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 00:49:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:49:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:49:31,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:49:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:49:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:49:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:49:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:49:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 00:49:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 00:49:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 00:49:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-24 00:49:31,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:31,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698857294] [2024-10-24 00:49:31,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698857294] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:49:31,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86953397] [2024-10-24 00:49:31,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:31,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:49:31,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:49:32,000 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-10-24 00:49:32,002 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-10-24 00:49:32,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,300 INFO L255 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 00:49:32,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:49:32,378 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-24 00:49:32,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:49:32,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86953397] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:32,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:49:32,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-24 00:49:32,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11271246] [2024-10-24 00:49:32,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:32,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:49:32,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:32,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:49:32,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:49:32,381 INFO L87 Difference]: Start difference. First operand 457 states and 724 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-24 00:49:32,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:32,487 INFO L93 Difference]: Finished difference Result 909 states and 1442 transitions. [2024-10-24 00:49:32,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:49:32,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 132 [2024-10-24 00:49:32,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:32,491 INFO L225 Difference]: With dead ends: 909 [2024-10-24 00:49:32,491 INFO L226 Difference]: Without dead ends: 459 [2024-10-24 00:49:32,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:49:32,493 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 2 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:32,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2281 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:49:32,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-24 00:49:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2024-10-24 00:49:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 353 states have (on average 1.6090651558073654) internal successors, (568), 357 states have internal predecessors, (568), 80 states have call successors, (80), 25 states have call predecessors, (80), 25 states have return successors, (79), 76 states have call predecessors, (79), 77 states have call successors, (79) [2024-10-24 00:49:32,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 727 transitions. [2024-10-24 00:49:32,512 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 727 transitions. Word has length 132 [2024-10-24 00:49:32,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:32,513 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 727 transitions. [2024-10-24 00:49:32,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-24 00:49:32,513 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 727 transitions. [2024-10-24 00:49:32,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 00:49:32,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:32,516 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:32,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 00:49:32,716 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-10-24 00:49:32,716 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:32,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:32,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1008654336, now seen corresponding path program 1 times [2024-10-24 00:49:32,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:32,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852454975] [2024-10-24 00:49:32,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:32,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:32,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 00:49:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 00:49:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 00:49:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 00:49:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:49:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:49:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:49:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:49:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:49:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 00:49:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,961 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:49:32,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:32,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852454975] [2024-10-24 00:49:32,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852454975] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:49:32,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243448308] [2024-10-24 00:49:32,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:32,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:49:32,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:49:32,964 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-10-24 00:49:32,965 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-10-24 00:49:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,266 INFO L255 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 00:49:33,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:49:33,335 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-24 00:49:33,335 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:49:33,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243448308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:33,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:49:33,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-24 00:49:33,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541103901] [2024-10-24 00:49:33,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:33,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:49:33,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:33,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:49:33,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:49:33,338 INFO L87 Difference]: Start difference. First operand 459 states and 727 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 00:49:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:33,457 INFO L93 Difference]: Finished difference Result 911 states and 1447 transitions. [2024-10-24 00:49:33,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:49:33,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2024-10-24 00:49:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:33,462 INFO L225 Difference]: With dead ends: 911 [2024-10-24 00:49:33,462 INFO L226 Difference]: Without dead ends: 461 [2024-10-24 00:49:33,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:49:33,464 INFO L432 NwaCegarLoop]: 571 mSDtfsCounter, 2 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2267 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:33,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2267 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:49:33,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-10-24 00:49:33,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2024-10-24 00:49:33,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 354 states have (on average 1.6073446327683616) internal successors, (569), 359 states have internal predecessors, (569), 80 states have call successors, (80), 25 states have call predecessors, (80), 26 states have return successors, (84), 76 states have call predecessors, (84), 77 states have call successors, (84) [2024-10-24 00:49:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 733 transitions. [2024-10-24 00:49:33,483 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 733 transitions. Word has length 115 [2024-10-24 00:49:33,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:33,483 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 733 transitions. [2024-10-24 00:49:33,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 00:49:33,483 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 733 transitions. [2024-10-24 00:49:33,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 00:49:33,486 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:33,486 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:33,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 00:49:33,686 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-10-24 00:49:33,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:33,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:33,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1634900594, now seen corresponding path program 1 times [2024-10-24 00:49:33,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:33,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057429195] [2024-10-24 00:49:33,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:33,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 00:49:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:49:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 00:49:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:49:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:49:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:49:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:49:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:49:33,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 00:49:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:33,898 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:49:33,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:33,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057429195] [2024-10-24 00:49:33,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057429195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:33,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:33,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:49:33,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864219696] [2024-10-24 00:49:33,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:33,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:49:33,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:33,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:49:33,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:49:33,900 INFO L87 Difference]: Start difference. First operand 461 states and 733 transitions. Second operand has 9 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 00:49:36,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:36,506 INFO L93 Difference]: Finished difference Result 1082 states and 1756 transitions. [2024-10-24 00:49:36,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:49:36,506 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2024-10-24 00:49:36,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:36,512 INFO L225 Difference]: With dead ends: 1082 [2024-10-24 00:49:36,512 INFO L226 Difference]: Without dead ends: 640 [2024-10-24 00:49:36,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:49:36,514 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 1329 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 3091 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1330 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 3577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 3091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:36,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1330 Valid, 1247 Invalid, 3577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 3091 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-24 00:49:36,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-10-24 00:49:36,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 461. [2024-10-24 00:49:36,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 354 states have (on average 1.6073446327683616) internal successors, (569), 359 states have internal predecessors, (569), 80 states have call successors, (80), 25 states have call predecessors, (80), 26 states have return successors, (83), 76 states have call predecessors, (83), 77 states have call successors, (83) [2024-10-24 00:49:36,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 732 transitions. [2024-10-24 00:49:36,606 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 732 transitions. Word has length 116 [2024-10-24 00:49:36,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:36,607 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 732 transitions. [2024-10-24 00:49:36,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 00:49:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 732 transitions. [2024-10-24 00:49:36,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-24 00:49:36,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:36,611 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:36,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 00:49:36,611 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:36,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:36,612 INFO L85 PathProgramCache]: Analyzing trace with hash -92926302, now seen corresponding path program 1 times [2024-10-24 00:49:36,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:36,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134204062] [2024-10-24 00:49:36,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:36,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:36,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:36,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:36,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:36,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:36,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:36,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:36,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:36,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 00:49:36,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:36,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:49:36,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:36,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 00:49:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:36,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:49:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:36,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:49:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:36,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:49:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:36,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:49:36,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:36,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:49:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:36,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 00:49:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:36,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 00:49:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:36,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 00:49:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:36,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-24 00:49:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:36,858 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-24 00:49:36,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:36,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134204062] [2024-10-24 00:49:36,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134204062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:36,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:36,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:49:36,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855328462] [2024-10-24 00:49:36,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:36,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:49:36,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:36,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:49:36,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:49:36,861 INFO L87 Difference]: Start difference. First operand 461 states and 732 transitions. Second operand has 9 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-24 00:49:39,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:39,238 INFO L93 Difference]: Finished difference Result 1084 states and 1759 transitions. [2024-10-24 00:49:39,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:49:39,239 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2024-10-24 00:49:39,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:39,243 INFO L225 Difference]: With dead ends: 1084 [2024-10-24 00:49:39,243 INFO L226 Difference]: Without dead ends: 642 [2024-10-24 00:49:39,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:49:39,245 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 1327 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 3084 mSolverCounterSat, 484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 3568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 484 IncrementalHoareTripleChecker+Valid, 3084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:39,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 1245 Invalid, 3568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [484 Valid, 3084 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 00:49:39,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-10-24 00:49:39,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 463. [2024-10-24 00:49:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 355 states have (on average 1.6056338028169015) internal successors, (570), 361 states have internal predecessors, (570), 80 states have call successors, (80), 25 states have call predecessors, (80), 27 states have return successors, (85), 76 states have call predecessors, (85), 77 states have call successors, (85) [2024-10-24 00:49:39,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 735 transitions. [2024-10-24 00:49:39,280 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 735 transitions. Word has length 135 [2024-10-24 00:49:39,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:39,281 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 735 transitions. [2024-10-24 00:49:39,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-24 00:49:39,281 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 735 transitions. [2024-10-24 00:49:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-24 00:49:39,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:39,283 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:39,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 00:49:39,284 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:39,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:39,284 INFO L85 PathProgramCache]: Analyzing trace with hash -923375831, now seen corresponding path program 1 times [2024-10-24 00:49:39,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:39,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8219723] [2024-10-24 00:49:39,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:39,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:39,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:49:39,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 00:49:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:49:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:49:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:49:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:49:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:49:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 00:49:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 00:49:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 00:49:39,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 00:49:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-24 00:49:39,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:39,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8219723] [2024-10-24 00:49:39,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8219723] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:39,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:39,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:49:39,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160700241] [2024-10-24 00:49:39,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:39,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:49:39,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:39,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:49:39,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:49:39,523 INFO L87 Difference]: Start difference. First operand 463 states and 735 transitions. Second operand has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-24 00:49:41,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:41,923 INFO L93 Difference]: Finished difference Result 1084 states and 1758 transitions. [2024-10-24 00:49:41,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 00:49:41,924 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 136 [2024-10-24 00:49:41,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:41,929 INFO L225 Difference]: With dead ends: 1084 [2024-10-24 00:49:41,929 INFO L226 Difference]: Without dead ends: 642 [2024-10-24 00:49:41,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-24 00:49:41,934 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1325 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 3079 mSolverCounterSat, 480 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 3559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 480 IncrementalHoareTripleChecker+Valid, 3079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:41,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 1242 Invalid, 3559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [480 Valid, 3079 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 00:49:41,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-10-24 00:49:41,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 463. [2024-10-24 00:49:41,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 355 states have (on average 1.6056338028169015) internal successors, (570), 361 states have internal predecessors, (570), 80 states have call successors, (80), 25 states have call predecessors, (80), 27 states have return successors, (85), 76 states have call predecessors, (85), 77 states have call successors, (85) [2024-10-24 00:49:41,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 735 transitions. [2024-10-24 00:49:41,975 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 735 transitions. Word has length 136 [2024-10-24 00:49:41,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:41,975 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 735 transitions. [2024-10-24 00:49:41,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-24 00:49:41,976 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 735 transitions. [2024-10-24 00:49:41,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 00:49:41,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:41,978 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:41,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 00:49:41,978 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:41,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:41,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1484276503, now seen corresponding path program 1 times [2024-10-24 00:49:41,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:41,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028668604] [2024-10-24 00:49:41,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:41,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:42,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:49:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 00:49:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:49:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:49:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:49:42,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:49:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:49:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 00:49:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:49:42,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:42,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028668604] [2024-10-24 00:49:42,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028668604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:42,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:42,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:49:42,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363636306] [2024-10-24 00:49:42,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:42,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:49:42,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:42,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:49:42,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:49:42,266 INFO L87 Difference]: Start difference. First operand 463 states and 735 transitions. Second operand has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-24 00:49:45,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:45,152 INFO L93 Difference]: Finished difference Result 1082 states and 1753 transitions. [2024-10-24 00:49:45,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:49:45,153 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 118 [2024-10-24 00:49:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:45,157 INFO L225 Difference]: With dead ends: 1082 [2024-10-24 00:49:45,157 INFO L226 Difference]: Without dead ends: 642 [2024-10-24 00:49:45,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-24 00:49:45,160 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1330 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 5098 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 5587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 5098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:45,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 1728 Invalid, 5587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 5098 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-24 00:49:45,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-10-24 00:49:45,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 463. [2024-10-24 00:49:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 355 states have (on average 1.6056338028169015) internal successors, (570), 361 states have internal predecessors, (570), 80 states have call successors, (80), 25 states have call predecessors, (80), 27 states have return successors, (84), 76 states have call predecessors, (84), 77 states have call successors, (84) [2024-10-24 00:49:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 734 transitions. [2024-10-24 00:49:45,196 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 734 transitions. Word has length 118 [2024-10-24 00:49:45,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:45,196 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 734 transitions. [2024-10-24 00:49:45,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-24 00:49:45,197 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 734 transitions. [2024-10-24 00:49:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 00:49:45,199 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:45,199 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] [2024-10-24 00:49:45,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 00:49:45,199 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:45,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:45,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1098031065, now seen corresponding path program 2 times [2024-10-24 00:49:45,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:45,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830007395] [2024-10-24 00:49:45,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:45,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:45,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:45,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:49:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:49:45,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:49:45,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:49:45,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:49:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:49:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:49:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 00:49:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-24 00:49:45,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:45,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830007395] [2024-10-24 00:49:45,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830007395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:45,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:45,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:49:45,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827917891] [2024-10-24 00:49:45,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:45,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:49:45,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:45,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:49:45,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:49:45,459 INFO L87 Difference]: Start difference. First operand 463 states and 734 transitions. Second operand has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-24 00:49:48,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:48,143 INFO L93 Difference]: Finished difference Result 1084 states and 1759 transitions. [2024-10-24 00:49:48,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:49:48,143 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 119 [2024-10-24 00:49:48,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:48,148 INFO L225 Difference]: With dead ends: 1084 [2024-10-24 00:49:48,148 INFO L226 Difference]: Without dead ends: 644 [2024-10-24 00:49:48,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-24 00:49:48,151 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 1323 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 5160 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1324 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 5636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 5160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:48,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1324 Valid, 1729 Invalid, 5636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 5160 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-24 00:49:48,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-10-24 00:49:48,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 465. [2024-10-24 00:49:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 356 states have (on average 1.603932584269663) internal successors, (571), 363 states have internal predecessors, (571), 80 states have call successors, (80), 25 states have call predecessors, (80), 28 states have return successors, (89), 76 states have call predecessors, (89), 77 states have call successors, (89) [2024-10-24 00:49:48,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 740 transitions. [2024-10-24 00:49:48,194 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 740 transitions. Word has length 119 [2024-10-24 00:49:48,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:48,194 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 740 transitions. [2024-10-24 00:49:48,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-24 00:49:48,194 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 740 transitions. [2024-10-24 00:49:48,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-24 00:49:48,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:48,197 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:48,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 00:49:48,197 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:48,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:48,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1025119802, now seen corresponding path program 1 times [2024-10-24 00:49:48,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:48,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641707856] [2024-10-24 00:49:48,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:48,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:48,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:48,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:48,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 00:49:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:49:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:49:48,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:49:48,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:49:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:49:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:49:48,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 00:49:48,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 00:49:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-24 00:49:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-24 00:49:48,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,480 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-24 00:49:48,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:48,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641707856] [2024-10-24 00:49:48,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641707856] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:49:48,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490844980] [2024-10-24 00:49:48,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:48,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:49:48,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:49:48,483 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-10-24 00:49:48,485 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-10-24 00:49:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:49:48,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:49:48,872 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-24 00:49:48,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:49:48,983 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-24 00:49:48,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490844980] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:49:48,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:49:48,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-10-24 00:49:48,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816861709] [2024-10-24 00:49:48,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:49:48,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 00:49:48,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:48,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 00:49:48,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:49:48,989 INFO L87 Difference]: Start difference. First operand 465 states and 740 transitions. Second operand has 15 states, 14 states have (on average 10.071428571428571) internal successors, (141), 11 states have internal predecessors, (141), 4 states have call successors, (42), 6 states have call predecessors, (42), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) [2024-10-24 00:49:52,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:52,201 INFO L93 Difference]: Finished difference Result 1523 states and 2570 transitions. [2024-10-24 00:49:52,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 00:49:52,202 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 10.071428571428571) internal successors, (141), 11 states have internal predecessors, (141), 4 states have call successors, (42), 6 states have call predecessors, (42), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) Word has length 138 [2024-10-24 00:49:52,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:52,209 INFO L225 Difference]: With dead ends: 1523 [2024-10-24 00:49:52,209 INFO L226 Difference]: Without dead ends: 1084 [2024-10-24 00:49:52,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2024-10-24 00:49:52,212 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 2765 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 4976 mSolverCounterSat, 890 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2785 SdHoareTripleChecker+Valid, 1936 SdHoareTripleChecker+Invalid, 5866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 890 IncrementalHoareTripleChecker+Valid, 4976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:52,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2785 Valid, 1936 Invalid, 5866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [890 Valid, 4976 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-24 00:49:52,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2024-10-24 00:49:52,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 890. [2024-10-24 00:49:52,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 702 states have (on average 1.650997150997151) internal successors, (1159), 709 states have internal predecessors, (1159), 159 states have call successors, (159), 25 states have call predecessors, (159), 28 states have return successors, (178), 155 states have call predecessors, (178), 156 states have call successors, (178) [2024-10-24 00:49:52,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1496 transitions. [2024-10-24 00:49:52,269 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1496 transitions. Word has length 138 [2024-10-24 00:49:52,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:52,269 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1496 transitions. [2024-10-24 00:49:52,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 10.071428571428571) internal successors, (141), 11 states have internal predecessors, (141), 4 states have call successors, (42), 6 states have call predecessors, (42), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) [2024-10-24 00:49:52,270 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1496 transitions. [2024-10-24 00:49:52,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 00:49:52,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:52,274 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:52,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 00:49:52,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:49:52,475 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:52,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:52,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1889822118, now seen corresponding path program 1 times [2024-10-24 00:49:52,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:52,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763398176] [2024-10-24 00:49:52,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:52,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:52,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:52,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:52,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:52,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:49:52,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:49:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:49:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:49:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:49:52,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:49:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 00:49:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 00:49:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,628 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:49:52,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:52,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763398176] [2024-10-24 00:49:52,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763398176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:52,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:52,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:49:52,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85295704] [2024-10-24 00:49:52,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:52,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:49:52,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:52,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:49:52,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:49:52,631 INFO L87 Difference]: Start difference. First operand 890 states and 1496 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:49:54,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:54,186 INFO L93 Difference]: Finished difference Result 2298 states and 3959 transitions. [2024-10-24 00:49:54,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:49:54,187 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 124 [2024-10-24 00:49:54,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:54,195 INFO L225 Difference]: With dead ends: 2298 [2024-10-24 00:49:54,196 INFO L226 Difference]: Without dead ends: 1476 [2024-10-24 00:49:54,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:49:54,200 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 1457 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 551 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 2307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 551 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:54,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 921 Invalid, 2307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [551 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:49:54,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2024-10-24 00:49:54,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1292. [2024-10-24 00:49:54,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1025 states have (on average 1.664390243902439) internal successors, (1706), 1032 states have internal predecessors, (1706), 238 states have call successors, (238), 25 states have call predecessors, (238), 28 states have return successors, (267), 234 states have call predecessors, (267), 235 states have call successors, (267) [2024-10-24 00:49:54,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 2211 transitions. [2024-10-24 00:49:54,275 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 2211 transitions. Word has length 124 [2024-10-24 00:49:54,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:54,276 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 2211 transitions. [2024-10-24 00:49:54,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:49:54,276 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 2211 transitions. [2024-10-24 00:49:54,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-24 00:49:54,282 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:54,283 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:54,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 00:49:54,283 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:54,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:54,283 INFO L85 PathProgramCache]: Analyzing trace with hash -708475126, now seen corresponding path program 1 times [2024-10-24 00:49:54,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:54,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328914563] [2024-10-24 00:49:54,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:54,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:54,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:54,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:54,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:54,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:54,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:54,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:54,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:54,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:49:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:54,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:49:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:54,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:49:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:54,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:49:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:54,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:49:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:54,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:49:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:54,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 00:49:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:54,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 00:49:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:54,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 00:49:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:54,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 00:49:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:54,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 00:49:54,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-24 00:49:54,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:54,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328914563] [2024-10-24 00:49:54,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328914563] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:54,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:54,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:49:54,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458224686] [2024-10-24 00:49:54,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:54,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:49:54,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:54,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:49:54,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:49:54,409 INFO L87 Difference]: Start difference. First operand 1292 states and 2211 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:49:55,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:55,992 INFO L93 Difference]: Finished difference Result 3301 states and 5736 transitions. [2024-10-24 00:49:55,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:49:55,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-10-24 00:49:55,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:56,006 INFO L225 Difference]: With dead ends: 3301 [2024-10-24 00:49:56,006 INFO L226 Difference]: Without dead ends: 2127 [2024-10-24 00:49:56,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:49:56,010 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 1456 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 2312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:56,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 919 Invalid, 2312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1764 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 00:49:56,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2024-10-24 00:49:56,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1943. [2024-10-24 00:49:56,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1943 states, 1557 states have (on average 1.6711624919717405) internal successors, (2602), 1564 states have internal predecessors, (2602), 357 states have call successors, (357), 25 states have call predecessors, (357), 28 states have return successors, (386), 353 states have call predecessors, (386), 354 states have call successors, (386) [2024-10-24 00:49:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 3345 transitions. [2024-10-24 00:49:56,110 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 3345 transitions. Word has length 143 [2024-10-24 00:49:56,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:56,111 INFO L471 AbstractCegarLoop]: Abstraction has 1943 states and 3345 transitions. [2024-10-24 00:49:56,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:49:56,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 3345 transitions. [2024-10-24 00:49:56,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 00:49:56,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:56,122 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:56,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 00:49:56,122 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:56,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:56,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1632521560, now seen corresponding path program 1 times [2024-10-24 00:49:56,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:56,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767400988] [2024-10-24 00:49:56,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:56,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:56,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:56,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:56,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:56,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:56,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:56,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:56,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:49:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:56,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:49:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:56,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:49:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:56,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:49:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:56,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:49:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:56,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:49:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:56,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:49:56,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:56,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 00:49:56,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:49:56,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:56,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767400988] [2024-10-24 00:49:56,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767400988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:56,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:56,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:49:56,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809901868] [2024-10-24 00:49:56,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:56,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:49:56,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:56,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:49:56,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:49:56,246 INFO L87 Difference]: Start difference. First operand 1943 states and 3345 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:49:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:57,868 INFO L93 Difference]: Finished difference Result 4825 states and 8454 transitions. [2024-10-24 00:49:57,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:49:57,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 126 [2024-10-24 00:49:57,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:57,887 INFO L225 Difference]: With dead ends: 4825 [2024-10-24 00:49:57,887 INFO L226 Difference]: Without dead ends: 3128 [2024-10-24 00:49:57,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:49:57,895 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 1455 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 2285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:57,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 907 Invalid, 2285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 00:49:57,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3128 states. [2024-10-24 00:49:58,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3128 to 2944. [2024-10-24 00:49:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2944 states, 2396 states have (on average 1.6769616026711185) internal successors, (4018), 2403 states have internal predecessors, (4018), 519 states have call successors, (519), 25 states have call predecessors, (519), 28 states have return successors, (564), 515 states have call predecessors, (564), 516 states have call successors, (564) [2024-10-24 00:49:58,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 5101 transitions. [2024-10-24 00:49:58,059 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 5101 transitions. Word has length 126 [2024-10-24 00:49:58,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:58,060 INFO L471 AbstractCegarLoop]: Abstraction has 2944 states and 5101 transitions. [2024-10-24 00:49:58,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:49:58,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 5101 transitions. [2024-10-24 00:49:58,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 00:49:58,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:58,074 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:58,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 00:49:58,074 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:58,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:58,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2046288569, now seen corresponding path program 1 times [2024-10-24 00:49:58,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:58,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960161433] [2024-10-24 00:49:58,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:58,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:58,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:58,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:58,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:58,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:58,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:58,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:58,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:58,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:58,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:58,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:58,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:49:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:58,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:49:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:58,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:49:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:58,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:49:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:58,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:49:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:58,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 00:49:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:58,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 00:49:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:58,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 00:49:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:58,191 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:49:58,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:58,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960161433] [2024-10-24 00:49:58,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960161433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:58,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:58,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:49:58,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991233274] [2024-10-24 00:49:58,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:58,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:49:58,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:58,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:49:58,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:49:58,192 INFO L87 Difference]: Start difference. First operand 2944 states and 5101 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:49:59,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:59,920 INFO L93 Difference]: Finished difference Result 7237 states and 12767 transitions. [2024-10-24 00:49:59,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:49:59,921 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 127 [2024-10-24 00:49:59,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:59,947 INFO L225 Difference]: With dead ends: 7237 [2024-10-24 00:49:59,948 INFO L226 Difference]: Without dead ends: 4748 [2024-10-24 00:49:59,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:49:59,957 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1451 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 1734 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 2289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 1734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:59,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 906 Invalid, 2289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 1734 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 00:49:59,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4748 states. [2024-10-24 00:50:00,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4748 to 4564. [2024-10-24 00:50:00,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4564 states, 3771 states have (on average 1.681251657385309) internal successors, (6340), 3778 states have internal predecessors, (6340), 764 states have call successors, (764), 25 states have call predecessors, (764), 28 states have return successors, (835), 760 states have call predecessors, (835), 761 states have call successors, (835) [2024-10-24 00:50:00,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4564 states to 4564 states and 7939 transitions. [2024-10-24 00:50:00,208 INFO L78 Accepts]: Start accepts. Automaton has 4564 states and 7939 transitions. Word has length 127 [2024-10-24 00:50:00,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:00,209 INFO L471 AbstractCegarLoop]: Abstraction has 4564 states and 7939 transitions. [2024-10-24 00:50:00,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:50:00,210 INFO L276 IsEmpty]: Start isEmpty. Operand 4564 states and 7939 transitions. [2024-10-24 00:50:00,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-24 00:50:00,224 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:00,224 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:00,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 00:50:00,225 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:00,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:00,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1209921954, now seen corresponding path program 1 times [2024-10-24 00:50:00,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:00,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700723999] [2024-10-24 00:50:00,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:00,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:50:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:50:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:50:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:50:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:50:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:50:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:50:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 00:50:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 00:50:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 00:50:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-24 00:50:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-24 00:50:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-24 00:50:00,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:00,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700723999] [2024-10-24 00:50:00,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700723999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:00,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:00,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:50:00,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951538182] [2024-10-24 00:50:00,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:00,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:50:00,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:00,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:50:00,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:50:00,359 INFO L87 Difference]: Start difference. First operand 4564 states and 7939 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:50:02,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:02,089 INFO L93 Difference]: Finished difference Result 11314 states and 20020 transitions. [2024-10-24 00:50:02,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:50:02,090 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2024-10-24 00:50:02,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:02,128 INFO L225 Difference]: With dead ends: 11314 [2024-10-24 00:50:02,128 INFO L226 Difference]: Without dead ends: 7508 [2024-10-24 00:50:02,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:50:02,150 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 1452 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 1767 mSolverCounterSat, 558 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 2325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 558 IncrementalHoareTripleChecker+Valid, 1767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:50:02,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1471 Valid, 935 Invalid, 2325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [558 Valid, 1767 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 00:50:02,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7508 states. [2024-10-24 00:50:02,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7508 to 7324. [2024-10-24 00:50:02,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7324 states, 6038 states have (on average 1.6753892017224246) internal successors, (10116), 6045 states have internal predecessors, (10116), 1257 states have call successors, (1257), 25 states have call predecessors, (1257), 28 states have return successors, (1372), 1253 states have call predecessors, (1372), 1254 states have call successors, (1372) [2024-10-24 00:50:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7324 states to 7324 states and 12745 transitions. [2024-10-24 00:50:02,560 INFO L78 Accepts]: Start accepts. Automaton has 7324 states and 12745 transitions. Word has length 146 [2024-10-24 00:50:02,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:02,561 INFO L471 AbstractCegarLoop]: Abstraction has 7324 states and 12745 transitions. [2024-10-24 00:50:02,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:50:02,562 INFO L276 IsEmpty]: Start isEmpty. Operand 7324 states and 12745 transitions. [2024-10-24 00:50:02,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-24 00:50:02,585 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:02,586 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:02,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 00:50:02,586 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:02,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:02,587 INFO L85 PathProgramCache]: Analyzing trace with hash 568121859, now seen corresponding path program 1 times [2024-10-24 00:50:02,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:02,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047886909] [2024-10-24 00:50:02,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:02,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:02,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:50:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:50:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:50:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:50:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:50:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:50:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 00:50:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 00:50:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 00:50:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,699 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:50:02,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:02,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047886909] [2024-10-24 00:50:02,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047886909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:02,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:02,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:50:02,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126755491] [2024-10-24 00:50:02,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:02,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:50:02,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:02,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:50:02,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:50:02,704 INFO L87 Difference]: Start difference. First operand 7324 states and 12745 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:50:04,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:04,440 INFO L93 Difference]: Finished difference Result 18673 states and 33040 transitions. [2024-10-24 00:50:04,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:50:04,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2024-10-24 00:50:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:04,484 INFO L225 Difference]: With dead ends: 18673 [2024-10-24 00:50:04,484 INFO L226 Difference]: Without dead ends: 12493 [2024-10-24 00:50:04,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:50:04,504 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 1446 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 2314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 554 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:50:04,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 913 Invalid, 2314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [554 Valid, 1760 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 00:50:04,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12493 states. [2024-10-24 00:50:04,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12493 to 12309. [2024-10-24 00:50:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12309 states, 10201 states have (on average 1.6753259484364278) internal successors, (17090), 10208 states have internal predecessors, (17090), 2079 states have call successors, (2079), 25 states have call predecessors, (2079), 28 states have return successors, (2272), 2075 states have call predecessors, (2272), 2076 states have call successors, (2272) [2024-10-24 00:50:05,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12309 states to 12309 states and 21441 transitions. [2024-10-24 00:50:05,066 INFO L78 Accepts]: Start accepts. Automaton has 12309 states and 21441 transitions. Word has length 129 [2024-10-24 00:50:05,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:05,067 INFO L471 AbstractCegarLoop]: Abstraction has 12309 states and 21441 transitions. [2024-10-24 00:50:05,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:50:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 12309 states and 21441 transitions. [2024-10-24 00:50:05,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-24 00:50:05,104 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:05,104 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:05,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 00:50:05,105 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:05,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:05,105 INFO L85 PathProgramCache]: Analyzing trace with hash 389711342, now seen corresponding path program 1 times [2024-10-24 00:50:05,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:05,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120248094] [2024-10-24 00:50:05,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:05,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:05,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:05,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:05,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:05,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:05,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:05,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:05,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:50:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:05,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:50:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:05,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:50:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:05,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:50:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:05,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:50:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:05,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:50:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:05,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 00:50:05,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:05,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 00:50:05,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:05,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 00:50:05,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:50:05,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:05,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120248094] [2024-10-24 00:50:05,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120248094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:05,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:05,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:50:05,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383436084] [2024-10-24 00:50:05,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:05,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:50:05,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:05,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:50:05,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:50:05,255 INFO L87 Difference]: Start difference. First operand 12309 states and 21441 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:50:07,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:07,139 INFO L93 Difference]: Finished difference Result 29639 states and 52223 transitions. [2024-10-24 00:50:07,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:50:07,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2024-10-24 00:50:07,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:07,224 INFO L225 Difference]: With dead ends: 29639 [2024-10-24 00:50:07,224 INFO L226 Difference]: Without dead ends: 19453 [2024-10-24 00:50:07,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:50:07,265 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1448 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1726 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 2283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 1726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:50:07,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 881 Invalid, 2283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 1726 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:50:07,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19453 states. [2024-10-24 00:50:08,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19453 to 19269. [2024-10-24 00:50:08,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19269 states, 15958 states have (on average 1.6532773530517608) internal successors, (26383), 15965 states have internal predecessors, (26383), 3282 states have call successors, (3282), 25 states have call predecessors, (3282), 28 states have return successors, (3619), 3278 states have call predecessors, (3619), 3279 states have call successors, (3619) [2024-10-24 00:50:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19269 states to 19269 states and 33284 transitions. [2024-10-24 00:50:08,138 INFO L78 Accepts]: Start accepts. Automaton has 19269 states and 33284 transitions. Word has length 130 [2024-10-24 00:50:08,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:08,139 INFO L471 AbstractCegarLoop]: Abstraction has 19269 states and 33284 transitions. [2024-10-24 00:50:08,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:50:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 19269 states and 33284 transitions. [2024-10-24 00:50:08,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-24 00:50:08,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:08,167 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:08,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 00:50:08,168 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:08,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:08,168 INFO L85 PathProgramCache]: Analyzing trace with hash 254848548, now seen corresponding path program 1 times [2024-10-24 00:50:08,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:08,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942415370] [2024-10-24 00:50:08,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:08,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:08,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:08,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:08,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:08,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:08,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:08,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:50:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:08,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:50:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:08,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:50:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:08,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:50:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:08,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:50:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:08,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:50:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:08,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 00:50:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:08,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 00:50:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:08,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 00:50:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:08,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 00:50:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:08,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-24 00:50:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:08,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-24 00:50:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:08,283 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-24 00:50:08,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:08,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942415370] [2024-10-24 00:50:08,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942415370] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:08,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:08,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:50:08,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204256931] [2024-10-24 00:50:08,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:08,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:50:08,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:08,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:50:08,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:50:08,285 INFO L87 Difference]: Start difference. First operand 19269 states and 33284 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:50:11,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:11,012 INFO L93 Difference]: Finished difference Result 51080 states and 89756 transitions. [2024-10-24 00:50:11,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:50:11,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 149 [2024-10-24 00:50:11,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:11,129 INFO L225 Difference]: With dead ends: 51080 [2024-10-24 00:50:11,129 INFO L226 Difference]: Without dead ends: 34582 [2024-10-24 00:50:11,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:50:11,174 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1446 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 1730 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 2298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 1730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 00:50:11,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 907 Invalid, 2298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 1730 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 00:50:11,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34582 states. [2024-10-24 00:50:12,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34582 to 34398. [2024-10-24 00:50:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34398 states, 28637 states have (on average 1.6505918916087579) internal successors, (47268), 28644 states have internal predecessors, (47268), 5732 states have call successors, (5732), 25 states have call predecessors, (5732), 28 states have return successors, (6343), 5728 states have call predecessors, (6343), 5729 states have call successors, (6343) [2024-10-24 00:50:12,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34398 states to 34398 states and 59343 transitions. [2024-10-24 00:50:12,581 INFO L78 Accepts]: Start accepts. Automaton has 34398 states and 59343 transitions. Word has length 149 [2024-10-24 00:50:12,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:12,582 INFO L471 AbstractCegarLoop]: Abstraction has 34398 states and 59343 transitions. [2024-10-24 00:50:12,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:50:12,582 INFO L276 IsEmpty]: Start isEmpty. Operand 34398 states and 59343 transitions. [2024-10-24 00:50:12,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 00:50:12,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:12,617 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:12,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 00:50:12,617 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:12,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:12,618 INFO L85 PathProgramCache]: Analyzing trace with hash -132332970, now seen corresponding path program 1 times [2024-10-24 00:50:12,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:12,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026097389] [2024-10-24 00:50:12,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:12,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:12,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:50:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:50:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:50:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:50:12,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:50:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:50:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 00:50:12,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 00:50:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 00:50:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-24 00:50:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-24 00:50:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-24 00:50:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-24 00:50:12,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:12,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026097389] [2024-10-24 00:50:12,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026097389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:12,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:12,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:50:12,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553439920] [2024-10-24 00:50:12,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:12,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:50:12,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:12,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:50:12,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:50:12,732 INFO L87 Difference]: Start difference. First operand 34398 states and 59343 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:50:16,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:16,165 INFO L93 Difference]: Finished difference Result 93962 states and 164350 transitions. [2024-10-24 00:50:16,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:50:16,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2024-10-24 00:50:16,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:16,500 INFO L225 Difference]: With dead ends: 93962 [2024-10-24 00:50:16,500 INFO L226 Difference]: Without dead ends: 63258 [2024-10-24 00:50:16,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:50:16,608 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 1443 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 559 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 2299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 559 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:50:16,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1462 Valid, 913 Invalid, 2299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [559 Valid, 1740 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 00:50:16,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63258 states. [2024-10-24 00:50:19,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63258 to 63074. [2024-10-24 00:50:19,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63074 states, 52800 states have (on average 1.646969696969697) internal successors, (86960), 52807 states have internal predecessors, (86960), 10245 states have call successors, (10245), 25 states have call predecessors, (10245), 28 states have return successors, (11388), 10241 states have call predecessors, (11388), 10242 states have call successors, (11388) [2024-10-24 00:50:19,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63074 states to 63074 states and 108593 transitions. [2024-10-24 00:50:19,570 INFO L78 Accepts]: Start accepts. Automaton has 63074 states and 108593 transitions. Word has length 150 [2024-10-24 00:50:19,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:19,570 INFO L471 AbstractCegarLoop]: Abstraction has 63074 states and 108593 transitions. [2024-10-24 00:50:19,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-24 00:50:19,570 INFO L276 IsEmpty]: Start isEmpty. Operand 63074 states and 108593 transitions. [2024-10-24 00:50:19,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-24 00:50:19,614 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:19,614 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:19,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 00:50:19,614 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:19,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:19,615 INFO L85 PathProgramCache]: Analyzing trace with hash -9357886, now seen corresponding path program 1 times [2024-10-24 00:50:19,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:19,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565509516] [2024-10-24 00:50:19,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:19,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:19,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:19,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:19,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:19,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:19,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:19,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:19,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:50:19,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:19,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:50:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:19,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:50:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:19,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:50:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:19,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:50:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:19,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 00:50:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:19,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:50:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:19,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 00:50:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:19,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-24 00:50:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:19,718 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:50:19,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:19,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565509516] [2024-10-24 00:50:19,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565509516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:19,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:19,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:50:19,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004608594] [2024-10-24 00:50:19,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:19,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:50:19,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:19,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:50:19,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:50:19,720 INFO L87 Difference]: Start difference. First operand 63074 states and 108593 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:50:23,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:23,645 INFO L93 Difference]: Finished difference Result 118342 states and 207502 transitions. [2024-10-24 00:50:23,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:50:23,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2024-10-24 00:50:23,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:24,118 INFO L225 Difference]: With dead ends: 118342 [2024-10-24 00:50:24,119 INFO L226 Difference]: Without dead ends: 118144 [2024-10-24 00:50:24,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:50:24,166 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 1439 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1457 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:50:24,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1457 Valid, 920 Invalid, 2302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 1747 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:50:24,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118144 states. [2024-10-24 00:50:28,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118144 to 117960. [2024-10-24 00:50:28,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117960 states, 99318 states have (on average 1.6423004893372803) internal successors, (163110), 99325 states have internal predecessors, (163110), 18613 states have call successors, (18613), 25 states have call predecessors, (18613), 28 states have return successors, (20802), 18609 states have call predecessors, (20802), 18610 states have call successors, (20802) [2024-10-24 00:50:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117960 states to 117960 states and 202525 transitions. [2024-10-24 00:50:28,535 INFO L78 Accepts]: Start accepts. Automaton has 117960 states and 202525 transitions. Word has length 133 [2024-10-24 00:50:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:28,535 INFO L471 AbstractCegarLoop]: Abstraction has 117960 states and 202525 transitions. [2024-10-24 00:50:28,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-24 00:50:28,536 INFO L276 IsEmpty]: Start isEmpty. Operand 117960 states and 202525 transitions. [2024-10-24 00:50:28,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-24 00:50:28,587 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:28,587 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:28,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 00:50:28,587 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:28,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:28,588 INFO L85 PathProgramCache]: Analyzing trace with hash -675184075, now seen corresponding path program 1 times [2024-10-24 00:50:28,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:28,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471313164] [2024-10-24 00:50:28,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:28,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:29,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:29,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:29,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:29,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:29,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:29,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:50:29,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:29,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:50:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:29,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:50:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:29,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:50:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:29,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:50:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:29,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 00:50:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:29,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 00:50:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:29,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 00:50:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:29,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-24 00:50:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:50:29,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:29,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471313164] [2024-10-24 00:50:29,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471313164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:29,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:29,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 00:50:29,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859529730] [2024-10-24 00:50:29,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:29,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 00:50:29,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:29,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 00:50:29,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:50:29,300 INFO L87 Difference]: Start difference. First operand 117960 states and 202525 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-24 00:50:35,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:35,827 INFO L93 Difference]: Finished difference Result 119103 states and 207719 transitions. [2024-10-24 00:50:35,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-24 00:50:35,827 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 134 [2024-10-24 00:50:35,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:36,317 INFO L225 Difference]: With dead ends: 119103 [2024-10-24 00:50:36,317 INFO L226 Difference]: Without dead ends: 118912 [2024-10-24 00:50:36,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=342, Invalid=918, Unknown=0, NotChecked=0, Total=1260 [2024-10-24 00:50:36,361 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 2747 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 5521 mSolverCounterSat, 976 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2764 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 6497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 976 IncrementalHoareTripleChecker+Valid, 5521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-24 00:50:36,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2764 Valid, 1224 Invalid, 6497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [976 Valid, 5521 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-24 00:50:36,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118912 states.