./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_product24.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_product24.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 d6572e4842c262533bee65d100c3a8328a4505c101a30c259390a3fe459f824d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 00:49:22,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 00:49:22,305 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:22,309 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 00:49:22,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 00:49:22,335 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 00:49:22,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 00:49:22,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 00:49:22,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 00:49:22,338 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 00:49:22,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 00:49:22,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 00:49:22,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 00:49:22,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 00:49:22,342 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 00:49:22,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 00:49:22,342 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 00:49:22,343 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 00:49:22,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 00:49:22,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 00:49:22,343 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 00:49:22,344 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 00:49:22,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 00:49:22,347 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 00:49:22,347 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 00:49:22,347 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 00:49:22,348 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 00:49:22,348 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 00:49:22,348 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 00:49:22,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 00:49:22,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 00:49:22,349 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 00:49:22,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:49:22,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 00:49:22,350 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 00:49:22,350 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 00:49:22,350 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 00:49:22,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 00:49:22,351 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 00:49:22,351 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 00:49:22,351 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 00:49:22,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 00:49:22,352 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 -> d6572e4842c262533bee65d100c3a8328a4505c101a30c259390a3fe459f824d [2024-10-24 00:49:22,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 00:49:22,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 00:49:22,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 00:49:22,608 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 00:49:22,608 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 00:49:22,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product24.cil.c [2024-10-24 00:49:24,011 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 00:49:24,359 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 00:49:24,360 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product24.cil.c [2024-10-24 00:49:24,382 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd585800/31079d2f98de4a7393deae6630f2aab4/FLAG05e68a9ed [2024-10-24 00:49:24,394 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfd585800/31079d2f98de4a7393deae6630f2aab4 [2024-10-24 00:49:24,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 00:49:24,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 00:49:24,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 00:49:24,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 00:49:24,405 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 00:49:24,406 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:49:24" (1/1) ... [2024-10-24 00:49:24,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b0dcd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:24, skipping insertion in model container [2024-10-24 00:49:24,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:49:24" (1/1) ... [2024-10-24 00:49:24,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 00:49:25,024 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_product24.cil.c[52737,52750] [2024-10-24 00:49:25,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:49:25,089 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 00:49:25,100 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2024-10-24 00:49:25,102 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [97] [2024-10-24 00:49:25,102 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [410] [2024-10-24 00:49:25,102 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [517] [2024-10-24 00:49:25,102 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1588] [2024-10-24 00:49:25,103 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1807] [2024-10-24 00:49:25,103 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2211] [2024-10-24 00:49:25,103 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2536] [2024-10-24 00:49:25,103 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2545] [2024-10-24 00:49:25,103 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2911] [2024-10-24 00:49:25,103 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [2928] [2024-10-24 00:49:25,169 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_product24.cil.c[52737,52750] [2024-10-24 00:49:25,193 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:49:25,235 INFO L204 MainTranslator]: Completed translation [2024-10-24 00:49:25,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:25 WrapperNode [2024-10-24 00:49:25,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 00:49:25,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 00:49:25,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 00:49:25,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 00:49:25,244 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:25" (1/1) ... [2024-10-24 00:49:25,277 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:25" (1/1) ... [2024-10-24 00:49:25,343 INFO L138 Inliner]: procedures = 131, calls = 200, calls flagged for inlining = 62, calls inlined = 57, statements flattened = 1029 [2024-10-24 00:49:25,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 00:49:25,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 00:49:25,348 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 00:49:25,348 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 00:49:25,364 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:25" (1/1) ... [2024-10-24 00:49:25,365 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:25" (1/1) ... [2024-10-24 00:49:25,374 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:25" (1/1) ... [2024-10-24 00:49:25,401 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:25,402 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:25" (1/1) ... [2024-10-24 00:49:25,402 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:25" (1/1) ... [2024-10-24 00:49:25,418 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:25" (1/1) ... [2024-10-24 00:49:25,450 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:25" (1/1) ... [2024-10-24 00:49:25,461 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:25" (1/1) ... [2024-10-24 00:49:25,472 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:25" (1/1) ... [2024-10-24 00:49:25,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 00:49:25,512 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 00:49:25,515 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 00:49:25,515 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 00:49:25,516 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:25" (1/1) ... [2024-10-24 00:49:25,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:49:25,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:49:25,571 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:25,573 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:25,620 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-24 00:49:25,620 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-24 00:49:25,621 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-24 00:49:25,621 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-24 00:49:25,621 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-24 00:49:25,621 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-24 00:49:25,621 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-24 00:49:25,622 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-24 00:49:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-24 00:49:25,623 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-24 00:49:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-24 00:49:25,623 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-24 00:49:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-24 00:49:25,623 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-24 00:49:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2024-10-24 00:49:25,624 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2024-10-24 00:49:25,624 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-24 00:49:25,624 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-24 00:49:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 00:49:25,625 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-24 00:49:25,626 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-24 00:49:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-24 00:49:25,626 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-24 00:49:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-24 00:49:25,626 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-24 00:49:25,626 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-24 00:49:25,626 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-24 00:49:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-24 00:49:25,627 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-24 00:49:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-24 00:49:25,627 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-24 00:49:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-24 00:49:25,627 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-24 00:49:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-24 00:49:25,627 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-24 00:49:25,627 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-24 00:49:25,628 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-24 00:49:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-24 00:49:25,628 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-24 00:49:25,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 00:49:25,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 00:49:25,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 00:49:25,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 00:49:25,629 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-24 00:49:25,629 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-24 00:49:25,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 00:49:25,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 00:49:25,836 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 00:49:25,839 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 00:49:26,716 INFO L? ?]: Removed 457 outVars from TransFormulas that were not future-live. [2024-10-24 00:49:26,717 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 00:49:26,779 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 00:49:26,779 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 00:49:26,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:49:26 BoogieIcfgContainer [2024-10-24 00:49:26,780 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 00:49:26,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 00:49:26,782 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 00:49:26,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 00:49:26,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:49:24" (1/3) ... [2024-10-24 00:49:26,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b67c910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:49:26, skipping insertion in model container [2024-10-24 00:49:26,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:49:25" (2/3) ... [2024-10-24 00:49:26,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b67c910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:49:26, skipping insertion in model container [2024-10-24 00:49:26,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:49:26" (3/3) ... [2024-10-24 00:49:26,789 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec3_product24.cil.c [2024-10-24 00:49:26,806 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 00:49:26,807 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 00:49:26,896 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 00:49:26,904 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;@104ae05d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 00:49:26,904 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 00:49:26,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 313 states, 237 states have (on average 1.5822784810126582) internal successors, (375), 241 states have internal predecessors, (375), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-24 00:49:26,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-24 00:49:26,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:26,929 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] [2024-10-24 00:49:26,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:26,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:26,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1175324009, now seen corresponding path program 1 times [2024-10-24 00:49:26,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:26,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842832910] [2024-10-24 00:49:26,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:26,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:27,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:27,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:27,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:27,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:49:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:27,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:49:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:27,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:49:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:27,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 00:49:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:27,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 00:49:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:27,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:49:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:27,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:49:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:27,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:49:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:27,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:49:27,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:27,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:49:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:27,708 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:27,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:27,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842832910] [2024-10-24 00:49:27,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842832910] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:49:27,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485308465] [2024-10-24 00:49:27,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:27,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:49:27,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:49:27,714 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:27,715 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:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 00:49:28,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:49:28,090 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:28,090 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:49:28,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485308465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:28,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:49:28,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-24 00:49:28,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240603807] [2024-10-24 00:49:28,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:28,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 00:49:28,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:28,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 00:49:28,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:49:28,129 INFO L87 Difference]: Start difference. First operand has 313 states, 237 states have (on average 1.5822784810126582) internal successors, (375), 241 states have internal predecessors, (375), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:49:28,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:28,248 INFO L93 Difference]: Finished difference Result 476 states and 722 transitions. [2024-10-24 00:49:28,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 00:49:28,252 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 96 [2024-10-24 00:49:28,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:28,269 INFO L225 Difference]: With dead ends: 476 [2024-10-24 00:49:28,270 INFO L226 Difference]: Without dead ends: 309 [2024-10-24 00:49:28,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 118 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:28,278 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:28,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 459 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:49:28,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-10-24 00:49:28,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-10-24 00:49:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 235 states have (on average 1.5659574468085107) internal successors, (368), 237 states have internal predecessors, (368), 54 states have call successors, (54), 20 states have call predecessors, (54), 19 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-24 00:49:28,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 473 transitions. [2024-10-24 00:49:28,368 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 473 transitions. Word has length 96 [2024-10-24 00:49:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:28,372 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 473 transitions. [2024-10-24 00:49:28,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:49:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 473 transitions. [2024-10-24 00:49:28,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 00:49:28,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:28,383 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] [2024-10-24 00:49:28,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 00:49:28,583 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:28,584 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:28,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:28,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1004144487, now seen corresponding path program 1 times [2024-10-24 00:49:28,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:28,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770011213] [2024-10-24 00:49:28,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:28,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:49:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:49:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:49:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:49:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 00:49:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:49:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:49:28,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:49:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:49:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:49:28,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:28,925 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,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:28,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770011213] [2024-10-24 00:49:28,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770011213] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:49:28,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044689408] [2024-10-24 00:49:28,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:28,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:49:28,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:49:28,930 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:28,931 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:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 1000 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 00:49:29,232 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:49:29,262 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,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:49:29,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044689408] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:29,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:49:29,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:49:29,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805869288] [2024-10-24 00:49:29,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:29,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:49:29,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:29,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:49:29,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:49:29,266 INFO L87 Difference]: Start difference. First operand 309 states and 473 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:49:29,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:29,347 INFO L93 Difference]: Finished difference Result 471 states and 705 transitions. [2024-10-24 00:49:29,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:49:29,347 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 97 [2024-10-24 00:49:29,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:29,354 INFO L225 Difference]: With dead ends: 471 [2024-10-24 00:49:29,354 INFO L226 Difference]: Without dead ends: 311 [2024-10-24 00:49:29,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 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:29,357 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 0 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:29,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 911 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:49:29,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-10-24 00:49:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2024-10-24 00:49:29,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 237 states have (on average 1.5611814345991561) internal successors, (370), 239 states have internal predecessors, (370), 54 states have call successors, (54), 20 states have call predecessors, (54), 19 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-24 00:49:29,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 475 transitions. [2024-10-24 00:49:29,415 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 475 transitions. Word has length 97 [2024-10-24 00:49:29,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:29,416 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 475 transitions. [2024-10-24 00:49:29,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:49:29,416 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 475 transitions. [2024-10-24 00:49:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 00:49:29,421 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:29,422 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:29,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 00:49:29,626 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:29,627 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:29,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:29,627 INFO L85 PathProgramCache]: Analyzing trace with hash -365461262, now seen corresponding path program 1 times [2024-10-24 00:49:29,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:29,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572430543] [2024-10-24 00:49:29,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:29,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:29,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:29,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:49:29,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:49:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:49:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 00:49:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:49:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:49:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:49:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:49:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:49:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:49:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:29,879 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:49:29,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:29,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572430543] [2024-10-24 00:49:29,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572430543] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:49:29,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489882816] [2024-10-24 00:49:29,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:29,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:49:29,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:49:29,886 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:29,887 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:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,175 INFO L255 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:49:30,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:49:30,202 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:49:30,202 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:49:30,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489882816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:30,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:49:30,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-24 00:49:30,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251342337] [2024-10-24 00:49:30,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:30,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:49:30,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:30,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:49:30,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:49:30,205 INFO L87 Difference]: Start difference. First operand 311 states and 475 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:49:30,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:30,278 INFO L93 Difference]: Finished difference Result 656 states and 1016 transitions. [2024-10-24 00:49:30,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:49:30,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2024-10-24 00:49:30,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:30,282 INFO L225 Difference]: With dead ends: 656 [2024-10-24 00:49:30,283 INFO L226 Difference]: Without dead ends: 367 [2024-10-24 00:49:30,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:49:30,286 INFO L432 NwaCegarLoop]: 465 mSDtfsCounter, 109 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:30,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 877 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:49:30,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-10-24 00:49:30,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 362. [2024-10-24 00:49:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 277 states have (on average 1.5776173285198556) internal successors, (437), 279 states have internal predecessors, (437), 65 states have call successors, (65), 20 states have call predecessors, (65), 19 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 00:49:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 564 transitions. [2024-10-24 00:49:30,308 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 564 transitions. Word has length 104 [2024-10-24 00:49:30,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:30,309 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 564 transitions. [2024-10-24 00:49:30,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:49:30,309 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 564 transitions. [2024-10-24 00:49:30,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 00:49:30,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:30,312 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:30,331 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:30,512 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:30,513 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:30,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:30,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1970030430, now seen corresponding path program 1 times [2024-10-24 00:49:30,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:30,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774330455] [2024-10-24 00:49:30,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:30,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:49:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:49:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:49:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 00:49:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:49:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:49:30,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:49:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:49:30,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:49:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:49:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:30,741 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:49:30,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:30,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774330455] [2024-10-24 00:49:30,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774330455] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:49:30,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488476486] [2024-10-24 00:49:30,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:30,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:49:30,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:49:30,744 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:30,746 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:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 00:49:31,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:49:31,099 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:31,102 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:49:31,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488476486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:31,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:49:31,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-24 00:49:31,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44500866] [2024-10-24 00:49:31,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:31,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:49:31,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:31,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:49:31,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:49:31,105 INFO L87 Difference]: Start difference. First operand 362 states and 564 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:49:31,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:31,227 INFO L93 Difference]: Finished difference Result 719 states and 1122 transitions. [2024-10-24 00:49:31,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:49:31,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 105 [2024-10-24 00:49:31,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:31,233 INFO L225 Difference]: With dead ends: 719 [2024-10-24 00:49:31,233 INFO L226 Difference]: Without dead ends: 364 [2024-10-24 00:49:31,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 124 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:31,237 INFO L432 NwaCegarLoop]: 448 mSDtfsCounter, 2 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1781 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:31,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1781 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:49:31,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-24 00:49:31,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2024-10-24 00:49:31,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 278 states have (on average 1.5755395683453237) internal successors, (438), 281 states have internal predecessors, (438), 65 states have call successors, (65), 20 states have call predecessors, (65), 20 states have return successors, (64), 62 states have call predecessors, (64), 62 states have call successors, (64) [2024-10-24 00:49:31,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 567 transitions. [2024-10-24 00:49:31,266 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 567 transitions. Word has length 105 [2024-10-24 00:49:31,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:31,266 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 567 transitions. [2024-10-24 00:49:31,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:49:31,268 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 567 transitions. [2024-10-24 00:49:31,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 00:49:31,271 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:31,272 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] [2024-10-24 00:49:31,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 00:49:31,473 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:31,473 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:31,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:31,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1427703417, now seen corresponding path program 1 times [2024-10-24 00:49:31,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:31,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798161064] [2024-10-24 00:49:31,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:31,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:31,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 00:49:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 00:49:31,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 00:49:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 00:49:31,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:49:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:49:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:49:31,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:49:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:49:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:31,798 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:31,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:31,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798161064] [2024-10-24 00:49:31,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798161064] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:49:31,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967435512] [2024-10-24 00:49:31,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:31,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:49:31,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:49:31,801 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:31,803 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:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 00:49:32,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:49:32,148 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:32,148 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:49:32,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967435512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:32,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:49:32,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-24 00:49:32,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632794928] [2024-10-24 00:49:32,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:32,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:49:32,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:32,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:49:32,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:49:32,152 INFO L87 Difference]: Start difference. First operand 364 states and 567 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:49:32,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:32,277 INFO L93 Difference]: Finished difference Result 721 states and 1127 transitions. [2024-10-24 00:49:32,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:49:32,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 106 [2024-10-24 00:49:32,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:32,281 INFO L225 Difference]: With dead ends: 721 [2024-10-24 00:49:32,283 INFO L226 Difference]: Without dead ends: 366 [2024-10-24 00:49:32,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 124 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:32,286 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 2 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1767 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:32,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1767 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:49:32,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-24 00:49:32,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2024-10-24 00:49:32,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 279 states have (on average 1.5734767025089607) internal successors, (439), 283 states have internal predecessors, (439), 65 states have call successors, (65), 20 states have call predecessors, (65), 21 states have return successors, (69), 62 states have call predecessors, (69), 62 states have call successors, (69) [2024-10-24 00:49:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 573 transitions. [2024-10-24 00:49:32,310 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 573 transitions. Word has length 106 [2024-10-24 00:49:32,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:32,311 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 573 transitions. [2024-10-24 00:49:32,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:49:32,311 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 573 transitions. [2024-10-24 00:49:32,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 00:49:32,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:32,313 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] [2024-10-24 00:49:32,332 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:32,514 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:32,514 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:32,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:32,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1142427840, now seen corresponding path program 1 times [2024-10-24 00:49:32,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:32,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550660830] [2024-10-24 00:49:32,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:32,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:32,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:32,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:32,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 00:49:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:49:32,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 00:49:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:49:32,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:49:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:49:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:49:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:49:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:32,746 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:32,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:32,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550660830] [2024-10-24 00:49:32,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550660830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:32,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:32,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:49:32,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186227592] [2024-10-24 00:49:32,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:32,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:49:32,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:32,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:49:32,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:49:32,749 INFO L87 Difference]: Start difference. First operand 366 states and 573 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:49:34,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:34,990 INFO L93 Difference]: Finished difference Result 873 states and 1384 transitions. [2024-10-24 00:49:34,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:49:34,991 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 107 [2024-10-24 00:49:34,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:34,995 INFO L225 Difference]: With dead ends: 873 [2024-10-24 00:49:34,995 INFO L226 Difference]: Without dead ends: 526 [2024-10-24 00:49:34,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:49:34,999 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 1019 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 2596 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1020 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 2942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 2596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:34,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1020 Valid, 1015 Invalid, 2942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 2596 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 00:49:35,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-10-24 00:49:35,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 366. [2024-10-24 00:49:35,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 279 states have (on average 1.5734767025089607) internal successors, (439), 283 states have internal predecessors, (439), 65 states have call successors, (65), 20 states have call predecessors, (65), 21 states have return successors, (68), 62 states have call predecessors, (68), 62 states have call successors, (68) [2024-10-24 00:49:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 572 transitions. [2024-10-24 00:49:35,048 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 572 transitions. Word has length 107 [2024-10-24 00:49:35,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:35,049 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 572 transitions. [2024-10-24 00:49:35,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:49:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 572 transitions. [2024-10-24 00:49:35,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 00:49:35,054 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:35,054 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] [2024-10-24 00:49:35,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 00:49:35,054 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:35,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:35,055 INFO L85 PathProgramCache]: Analyzing trace with hash -565605437, now seen corresponding path program 2 times [2024-10-24 00:49:35,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:35,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694312998] [2024-10-24 00:49:35,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:35,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:35,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:35,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:35,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:35,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:35,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:35,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:35,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:35,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 00:49:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:35,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:49:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:35,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 00:49:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:35,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:49:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:35,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:49:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:35,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:49:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:35,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:49:35,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:35,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:49:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:35,264 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-24 00:49:35,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:35,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694312998] [2024-10-24 00:49:35,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694312998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:35,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:35,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:49:35,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503711291] [2024-10-24 00:49:35,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:35,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:49:35,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:35,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:49:35,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:49:35,267 INFO L87 Difference]: Start difference. First operand 366 states and 572 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:49:37,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:37,379 INFO L93 Difference]: Finished difference Result 875 states and 1387 transitions. [2024-10-24 00:49:37,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 00:49:37,380 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 108 [2024-10-24 00:49:37,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:37,384 INFO L225 Difference]: With dead ends: 875 [2024-10-24 00:49:37,384 INFO L226 Difference]: Without dead ends: 528 [2024-10-24 00:49:37,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-24 00:49:37,387 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1014 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 2628 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 2972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 2628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:37,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 1016 Invalid, 2972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 2628 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 00:49:37,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-10-24 00:49:37,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 368. [2024-10-24 00:49:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 280 states have (on average 1.5714285714285714) internal successors, (440), 285 states have internal predecessors, (440), 65 states have call successors, (65), 20 states have call predecessors, (65), 22 states have return successors, (70), 62 states have call predecessors, (70), 62 states have call successors, (70) [2024-10-24 00:49:37,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 575 transitions. [2024-10-24 00:49:37,439 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 575 transitions. Word has length 108 [2024-10-24 00:49:37,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:37,439 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 575 transitions. [2024-10-24 00:49:37,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:49:37,440 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 575 transitions. [2024-10-24 00:49:37,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 00:49:37,442 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:37,442 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] [2024-10-24 00:49:37,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 00:49:37,443 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:37,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:37,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1907365467, now seen corresponding path program 1 times [2024-10-24 00:49:37,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:37,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970003023] [2024-10-24 00:49:37,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:37,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:37,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:49:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 00:49:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:49:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:49:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:49:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:49:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:49:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:37,699 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:37,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:37,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970003023] [2024-10-24 00:49:37,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970003023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:37,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:37,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:49:37,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093451782] [2024-10-24 00:49:37,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:37,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:49:37,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:37,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:49:37,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:49:37,704 INFO L87 Difference]: Start difference. First operand 368 states and 575 transitions. Second operand has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 00:49:40,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:40,446 INFO L93 Difference]: Finished difference Result 873 states and 1382 transitions. [2024-10-24 00:49:40,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:49:40,447 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 109 [2024-10-24 00:49:40,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:40,452 INFO L225 Difference]: With dead ends: 873 [2024-10-24 00:49:40,452 INFO L226 Difference]: Without dead ends: 528 [2024-10-24 00:49:40,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 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:40,454 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1031 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 4234 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 4592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 4234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:40,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 1408 Invalid, 4592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 4234 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-24 00:49:40,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2024-10-24 00:49:40,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 368. [2024-10-24 00:49:40,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 280 states have (on average 1.5714285714285714) internal successors, (440), 285 states have internal predecessors, (440), 65 states have call successors, (65), 20 states have call predecessors, (65), 22 states have return successors, (69), 62 states have call predecessors, (69), 62 states have call successors, (69) [2024-10-24 00:49:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 574 transitions. [2024-10-24 00:49:40,487 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 574 transitions. Word has length 109 [2024-10-24 00:49:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:40,488 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 574 transitions. [2024-10-24 00:49:40,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 00:49:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 574 transitions. [2024-10-24 00:49:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 00:49:40,491 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:40,491 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] [2024-10-24 00:49:40,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 00:49:40,491 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:40,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:40,492 INFO L85 PathProgramCache]: Analyzing trace with hash 882857144, now seen corresponding path program 2 times [2024-10-24 00:49:40,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:40,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767518453] [2024-10-24 00:49:40,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:40,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:40,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:40,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:40,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:40,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:40,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:40,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:40,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 00:49:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:40,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:49:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:40,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:49:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:40,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:49:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:40,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:49:40,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:40,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:49:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:40,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:49:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:40,764 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:40,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:40,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767518453] [2024-10-24 00:49:40,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767518453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:40,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:40,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-24 00:49:40,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619289464] [2024-10-24 00:49:40,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:40,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 00:49:40,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:40,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 00:49:40,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-24 00:49:40,767 INFO L87 Difference]: Start difference. First operand 368 states and 574 transitions. Second operand has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 00:49:43,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:43,174 INFO L93 Difference]: Finished difference Result 875 states and 1388 transitions. [2024-10-24 00:49:43,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 00:49:43,175 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 110 [2024-10-24 00:49:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:43,178 INFO L225 Difference]: With dead ends: 875 [2024-10-24 00:49:43,178 INFO L226 Difference]: Without dead ends: 530 [2024-10-24 00:49:43,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 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:43,180 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1027 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 4253 mSolverCounterSat, 355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 4608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 355 IncrementalHoareTripleChecker+Valid, 4253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:43,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 1408 Invalid, 4608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [355 Valid, 4253 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 00:49:43,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-10-24 00:49:43,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 370. [2024-10-24 00:49:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 281 states have (on average 1.5693950177935942) internal successors, (441), 287 states have internal predecessors, (441), 65 states have call successors, (65), 20 states have call predecessors, (65), 23 states have return successors, (74), 62 states have call predecessors, (74), 62 states have call successors, (74) [2024-10-24 00:49:43,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 580 transitions. [2024-10-24 00:49:43,210 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 580 transitions. Word has length 110 [2024-10-24 00:49:43,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:43,210 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 580 transitions. [2024-10-24 00:49:43,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 00:49:43,210 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 580 transitions. [2024-10-24 00:49:43,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 00:49:43,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:43,212 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] [2024-10-24 00:49:43,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 00:49:43,213 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:43,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:43,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1905315124, now seen corresponding path program 1 times [2024-10-24 00:49:43,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:43,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296934950] [2024-10-24 00:49:43,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:43,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:43,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:43,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:43,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:43,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:43,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:43,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:43,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:43,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 00:49:43,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:43,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:49:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:43,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:49:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:43,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:49:43,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:43,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:49:43,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:43,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:49:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:43,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:49:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:43,399 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-10-24 00:49:43,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:43,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296934950] [2024-10-24 00:49:43,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296934950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:43,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:43,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 00:49:43,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634746206] [2024-10-24 00:49:43,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:43,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 00:49:43,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:43,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 00:49:43,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:49:43,402 INFO L87 Difference]: Start difference. First operand 370 states and 580 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:49:45,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:45,160 INFO L93 Difference]: Finished difference Result 877 states and 1391 transitions. [2024-10-24 00:49:45,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 00:49:45,161 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2024-10-24 00:49:45,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:45,166 INFO L225 Difference]: With dead ends: 877 [2024-10-24 00:49:45,167 INFO L226 Difference]: Without dead ends: 530 [2024-10-24 00:49:45,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-24 00:49:45,170 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1014 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 2616 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 2962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 2616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:45,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 1008 Invalid, 2962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 2616 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 00:49:45,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2024-10-24 00:49:45,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 370. [2024-10-24 00:49:45,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 281 states have (on average 1.5693950177935942) internal successors, (441), 287 states have internal predecessors, (441), 65 states have call successors, (65), 20 states have call predecessors, (65), 23 states have return successors, (74), 62 states have call predecessors, (74), 62 states have call successors, (74) [2024-10-24 00:49:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 580 transitions. [2024-10-24 00:49:45,222 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 580 transitions. Word has length 111 [2024-10-24 00:49:45,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:45,223 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 580 transitions. [2024-10-24 00:49:45,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:49:45,223 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 580 transitions. [2024-10-24 00:49:45,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 00:49:45,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:45,226 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] [2024-10-24 00:49:45,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 00:49:45,226 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:45,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:45,227 INFO L85 PathProgramCache]: Analyzing trace with hash -937964470, now seen corresponding path program 1 times [2024-10-24 00:49:45,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:45,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099257097] [2024-10-24 00:49:45,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:45,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:45,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 00:49:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:49:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:49:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:49:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:49:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:49:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:49:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,486 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-24 00:49:45,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:45,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099257097] [2024-10-24 00:49:45,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099257097] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:49:45,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077115841] [2024-10-24 00:49:45,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:45,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:49:45,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:49:45,489 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:45,490 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:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:45,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:49:45,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:49:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:49:45,818 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:49:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-24 00:49:45,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077115841] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:49:45,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:49:45,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-10-24 00:49:45,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659157691] [2024-10-24 00:49:45,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:49:45,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 00:49:45,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:45,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 00:49:45,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-24 00:49:45,902 INFO L87 Difference]: Start difference. First operand 370 states and 580 transitions. Second operand has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (32), 6 states have call predecessors, (32), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-24 00:49:48,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:48,466 INFO L93 Difference]: Finished difference Result 1224 states and 2033 transitions. [2024-10-24 00:49:48,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 00:49:48,466 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (32), 6 states have call predecessors, (32), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 111 [2024-10-24 00:49:48,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:48,472 INFO L225 Difference]: With dead ends: 1224 [2024-10-24 00:49:48,472 INFO L226 Difference]: Without dead ends: 880 [2024-10-24 00:49:48,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 243 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:48,475 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 2196 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 4214 mSolverCounterSat, 663 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2213 SdHoareTripleChecker+Valid, 1518 SdHoareTripleChecker+Invalid, 4877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 663 IncrementalHoareTripleChecker+Valid, 4214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:48,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2213 Valid, 1518 Invalid, 4877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [663 Valid, 4214 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-24 00:49:48,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-10-24 00:49:48,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 705. [2024-10-24 00:49:48,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 552 states have (on average 1.6195652173913044) internal successors, (894), 558 states have internal predecessors, (894), 129 states have call successors, (129), 20 states have call predecessors, (129), 23 states have return successors, (148), 126 states have call predecessors, (148), 126 states have call successors, (148) [2024-10-24 00:49:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 1171 transitions. [2024-10-24 00:49:48,522 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 1171 transitions. Word has length 111 [2024-10-24 00:49:48,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:48,523 INFO L471 AbstractCegarLoop]: Abstraction has 705 states and 1171 transitions. [2024-10-24 00:49:48,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (32), 6 states have call predecessors, (32), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-24 00:49:48,523 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 1171 transitions. [2024-10-24 00:49:48,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-24 00:49:48,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:48,527 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:48,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-24 00:49:48,727 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:48,728 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:48,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:48,728 INFO L85 PathProgramCache]: Analyzing trace with hash -981538707, now seen corresponding path program 1 times [2024-10-24 00:49:48,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:48,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224789514] [2024-10-24 00:49:48,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:48,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:48,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:48,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:49:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:49:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:49:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:49:48,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:49:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:49:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 00:49:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:48,865 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:48,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:48,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224789514] [2024-10-24 00:49:48,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224789514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:48,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:48,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:49:48,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286862261] [2024-10-24 00:49:48,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:48,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:49:48,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:48,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:49:48,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:49:48,868 INFO L87 Difference]: Start difference. First operand 705 states and 1171 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:49:50,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:50,369 INFO L93 Difference]: Finished difference Result 1819 states and 3092 transitions. [2024-10-24 00:49:50,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:49:50,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2024-10-24 00:49:50,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:50,376 INFO L225 Difference]: With dead ends: 1819 [2024-10-24 00:49:50,376 INFO L226 Difference]: Without dead ends: 1182 [2024-10-24 00:49:50,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:49:50,380 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1130 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:50,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 790 Invalid, 1912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:49:50,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2024-10-24 00:49:50,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 1017. [2024-10-24 00:49:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 800 states have (on average 1.6325) internal successors, (1306), 806 states have internal predecessors, (1306), 193 states have call successors, (193), 20 states have call predecessors, (193), 23 states have return successors, (222), 190 states have call predecessors, (222), 190 states have call successors, (222) [2024-10-24 00:49:50,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1721 transitions. [2024-10-24 00:49:50,441 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1721 transitions. Word has length 115 [2024-10-24 00:49:50,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:50,441 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1721 transitions. [2024-10-24 00:49:50,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:49:50,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1721 transitions. [2024-10-24 00:49:50,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-24 00:49:50,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:50,448 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:49:50,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 00:49:50,448 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:50,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:50,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1472888400, now seen corresponding path program 1 times [2024-10-24 00:49:50,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:50,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541740085] [2024-10-24 00:49:50,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:50,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:49:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:49:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:49:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:49:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:49:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:49:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 00:49:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:50,572 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:50,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:50,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541740085] [2024-10-24 00:49:50,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541740085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:50,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:50,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:49:50,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618239257] [2024-10-24 00:49:50,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:50,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:49:50,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:50,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:49:50,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:49:50,574 INFO L87 Difference]: Start difference. First operand 1017 states and 1721 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:49:51,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:51,846 INFO L93 Difference]: Finished difference Result 2588 states and 4440 transitions. [2024-10-24 00:49:51,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:49:51,847 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2024-10-24 00:49:51,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:51,856 INFO L225 Difference]: With dead ends: 2588 [2024-10-24 00:49:51,856 INFO L226 Difference]: Without dead ends: 1689 [2024-10-24 00:49:51,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:49:51,860 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1127 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:51,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 744 Invalid, 1887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 00:49:51,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1689 states. [2024-10-24 00:49:51,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1524. [2024-10-24 00:49:51,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1524 states, 1212 states have (on average 1.6386138613861385) internal successors, (1986), 1218 states have internal predecessors, (1986), 288 states have call successors, (288), 20 states have call predecessors, (288), 23 states have return successors, (317), 285 states have call predecessors, (317), 285 states have call successors, (317) [2024-10-24 00:49:51,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1524 states to 1524 states and 2591 transitions. [2024-10-24 00:49:51,942 INFO L78 Accepts]: Start accepts. Automaton has 1524 states and 2591 transitions. Word has length 116 [2024-10-24 00:49:51,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:51,943 INFO L471 AbstractCegarLoop]: Abstraction has 1524 states and 2591 transitions. [2024-10-24 00:49:51,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:49:51,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1524 states and 2591 transitions. [2024-10-24 00:49:51,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 00:49:51,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:51,951 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] [2024-10-24 00:49:51,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 00:49:51,951 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:51,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:51,951 INFO L85 PathProgramCache]: Analyzing trace with hash -65702629, now seen corresponding path program 1 times [2024-10-24 00:49:51,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:51,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862071697] [2024-10-24 00:49:51,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:51,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:52,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:49:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:49:52,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:49:52,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:49:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:49:52,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:49:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 00:49:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:52,062 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,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:52,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862071697] [2024-10-24 00:49:52,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862071697] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:52,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:52,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:49:52,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965203938] [2024-10-24 00:49:52,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:52,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:49:52,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:52,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:49:52,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:49:52,064 INFO L87 Difference]: Start difference. First operand 1524 states and 2591 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:49:53,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:53,674 INFO L93 Difference]: Finished difference Result 3734 states and 6465 transitions. [2024-10-24 00:49:53,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:49:53,675 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2024-10-24 00:49:53,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:53,691 INFO L225 Difference]: With dead ends: 3734 [2024-10-24 00:49:53,692 INFO L226 Difference]: Without dead ends: 2456 [2024-10-24 00:49:53,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:49:53,699 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1125 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:53,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 737 Invalid, 1873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 00:49:53,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2456 states. [2024-10-24 00:49:53,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2456 to 2291. [2024-10-24 00:49:53,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2291 states, 1856 states have (on average 1.6438577586206897) internal successors, (3051), 1862 states have internal predecessors, (3051), 411 states have call successors, (411), 20 states have call predecessors, (411), 23 states have return successors, (456), 408 states have call predecessors, (456), 408 states have call successors, (456) [2024-10-24 00:49:53,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3918 transitions. [2024-10-24 00:49:53,812 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 3918 transitions. Word has length 117 [2024-10-24 00:49:53,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:53,813 INFO L471 AbstractCegarLoop]: Abstraction has 2291 states and 3918 transitions. [2024-10-24 00:49:53,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:49:53,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 3918 transitions. [2024-10-24 00:49:53,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 00:49:53,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:53,823 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] [2024-10-24 00:49:53,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 00:49:53,824 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:53,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:53,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1819111119, now seen corresponding path program 1 times [2024-10-24 00:49:53,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:53,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975819303] [2024-10-24 00:49:53,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:53,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:49:53,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:49:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:49:53,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:49:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:49:53,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:49:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 00:49:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:53,980 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:53,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:53,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975819303] [2024-10-24 00:49:53,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975819303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:53,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:53,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:49:53,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7644877] [2024-10-24 00:49:53,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:53,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:49:53,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:53,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:49:53,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:49:53,982 INFO L87 Difference]: Start difference. First operand 2291 states and 3918 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:49:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:55,333 INFO L93 Difference]: Finished difference Result 5516 states and 9623 transitions. [2024-10-24 00:49:55,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:49:55,333 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2024-10-24 00:49:55,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:55,355 INFO L225 Difference]: With dead ends: 5516 [2024-10-24 00:49:55,355 INFO L226 Difference]: Without dead ends: 3680 [2024-10-24 00:49:55,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:49:55,366 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1112 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 1877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:55,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 736 Invalid, 1877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 00:49:55,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2024-10-24 00:49:55,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3515. [2024-10-24 00:49:55,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3515 states, 2901 states have (on average 1.6473629782833505) internal successors, (4779), 2907 states have internal predecessors, (4779), 590 states have call successors, (590), 20 states have call predecessors, (590), 23 states have return successors, (661), 587 states have call predecessors, (661), 587 states have call successors, (661) [2024-10-24 00:49:55,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 6030 transitions. [2024-10-24 00:49:55,554 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 6030 transitions. Word has length 118 [2024-10-24 00:49:55,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:55,554 INFO L471 AbstractCegarLoop]: Abstraction has 3515 states and 6030 transitions. [2024-10-24 00:49:55,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:49:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 6030 transitions. [2024-10-24 00:49:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 00:49:55,567 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:55,567 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] [2024-10-24 00:49:55,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 00:49:55,568 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:55,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:55,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1600890359, now seen corresponding path program 1 times [2024-10-24 00:49:55,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:55,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271144991] [2024-10-24 00:49:55,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:55,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:55,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:55,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:49:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:49:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:49:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:49:55,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:49:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:49:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 00:49:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:55,675 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:55,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:55,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271144991] [2024-10-24 00:49:55,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271144991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:55,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:55,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:49:55,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136326060] [2024-10-24 00:49:55,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:55,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:49:55,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:55,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:49:55,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:49:55,678 INFO L87 Difference]: Start difference. First operand 3515 states and 6030 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:49:57,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:57,238 INFO L93 Difference]: Finished difference Result 8495 states and 14863 transitions. [2024-10-24 00:49:57,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:49:57,239 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2024-10-24 00:49:57,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:57,274 INFO L225 Difference]: With dead ends: 8495 [2024-10-24 00:49:57,274 INFO L226 Difference]: Without dead ends: 5738 [2024-10-24 00:49:57,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:49:57,288 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1112 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1127 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:57,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1127 Valid, 746 Invalid, 1894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:49:57,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5738 states. [2024-10-24 00:49:57,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5738 to 5573. [2024-10-24 00:49:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5573 states, 4583 states have (on average 1.6369190486580842) internal successors, (7502), 4589 states have internal predecessors, (7502), 966 states have call successors, (966), 20 states have call predecessors, (966), 23 states have return successors, (1081), 963 states have call predecessors, (1081), 963 states have call successors, (1081) [2024-10-24 00:49:57,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5573 states to 5573 states and 9549 transitions. [2024-10-24 00:49:57,669 INFO L78 Accepts]: Start accepts. Automaton has 5573 states and 9549 transitions. Word has length 119 [2024-10-24 00:49:57,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:57,669 INFO L471 AbstractCegarLoop]: Abstraction has 5573 states and 9549 transitions. [2024-10-24 00:49:57,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:49:57,670 INFO L276 IsEmpty]: Start isEmpty. Operand 5573 states and 9549 transitions. [2024-10-24 00:49:57,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 00:49:57,690 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:57,690 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] [2024-10-24 00:49:57,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 00:49:57,691 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:57,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:57,691 INFO L85 PathProgramCache]: Analyzing trace with hash -383367083, now seen corresponding path program 1 times [2024-10-24 00:49:57,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:57,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206563926] [2024-10-24 00:49:57,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:57,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:57,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:49:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:49:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:49:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:49:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:49:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 00:49:57,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:49:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:57,812 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:57,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:57,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206563926] [2024-10-24 00:49:57,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206563926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:57,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:57,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:49:57,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628577826] [2024-10-24 00:49:57,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:57,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:49:57,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:57,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:49:57,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:49:57,814 INFO L87 Difference]: Start difference. First operand 5573 states and 9549 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:49:59,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:49:59,232 INFO L93 Difference]: Finished difference Result 13856 states and 24220 transitions. [2024-10-24 00:49:59,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:49:59,233 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2024-10-24 00:49:59,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:49:59,294 INFO L225 Difference]: With dead ends: 13856 [2024-10-24 00:49:59,294 INFO L226 Difference]: Without dead ends: 9427 [2024-10-24 00:49:59,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:49:59,312 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 1109 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:49:59,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 744 Invalid, 1901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 00:49:59,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9427 states. [2024-10-24 00:49:59,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9427 to 9262. [2024-10-24 00:49:59,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9262 states, 7666 states have (on average 1.6347508478998174) internal successors, (12532), 7672 states have internal predecessors, (12532), 1572 states have call successors, (1572), 20 states have call predecessors, (1572), 23 states have return successors, (1765), 1569 states have call predecessors, (1765), 1569 states have call successors, (1765) [2024-10-24 00:49:59,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9262 states to 9262 states and 15869 transitions. [2024-10-24 00:49:59,738 INFO L78 Accepts]: Start accepts. Automaton has 9262 states and 15869 transitions. Word has length 120 [2024-10-24 00:49:59,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:49:59,739 INFO L471 AbstractCegarLoop]: Abstraction has 9262 states and 15869 transitions. [2024-10-24 00:49:59,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:49:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand 9262 states and 15869 transitions. [2024-10-24 00:49:59,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 00:49:59,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:49:59,761 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] [2024-10-24 00:49:59,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 00:49:59,761 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:49:59,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:49:59,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1435348229, now seen corresponding path program 1 times [2024-10-24 00:49:59,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:49:59,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199909636] [2024-10-24 00:49:59,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:49:59,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:49:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:59,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:49:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:59,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:49:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:59,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:49:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:59,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:49:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:59,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:49:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:59,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:49:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:59,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:49:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:59,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:49:59,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:59,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:49:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:59,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:49:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:59,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:49:59,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:59,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 00:49:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:59,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 00:49:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:49:59,876 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:59,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:49:59,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199909636] [2024-10-24 00:49:59,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199909636] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:49:59,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:49:59,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:49:59,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567934414] [2024-10-24 00:49:59,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:49:59,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:49:59,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:49:59,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:49:59,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:49:59,880 INFO L87 Difference]: Start difference. First operand 9262 states and 15869 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, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:50:01,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:01,448 INFO L93 Difference]: Finished difference Result 24048 states and 41984 transitions. [2024-10-24 00:50:01,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:50:01,449 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, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2024-10-24 00:50:01,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:01,521 INFO L225 Difference]: With dead ends: 24048 [2024-10-24 00:50:01,521 INFO L226 Difference]: Without dead ends: 16387 [2024-10-24 00:50:01,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:50:01,555 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 1117 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 1503 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:50:01,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 782 Invalid, 1911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1503 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 00:50:01,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16387 states. [2024-10-24 00:50:02,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16387 to 16222. [2024-10-24 00:50:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16222 states, 13423 states have (on average 1.6259405498025776) internal successors, (21825), 13429 states have internal predecessors, (21825), 2775 states have call successors, (2775), 20 states have call predecessors, (2775), 23 states have return successors, (3112), 2772 states have call predecessors, (3112), 2772 states have call successors, (3112) [2024-10-24 00:50:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16222 states to 16222 states and 27712 transitions. [2024-10-24 00:50:02,311 INFO L78 Accepts]: Start accepts. Automaton has 16222 states and 27712 transitions. Word has length 121 [2024-10-24 00:50:02,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:02,311 INFO L471 AbstractCegarLoop]: Abstraction has 16222 states and 27712 transitions. [2024-10-24 00:50:02,311 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, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:50:02,312 INFO L276 IsEmpty]: Start isEmpty. Operand 16222 states and 27712 transitions. [2024-10-24 00:50:02,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 00:50:02,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:02,347 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] [2024-10-24 00:50:02,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 00:50:02,347 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:02,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:02,348 INFO L85 PathProgramCache]: Analyzing trace with hash -879642378, now seen corresponding path program 1 times [2024-10-24 00:50:02,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:02,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151146909] [2024-10-24 00:50:02,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:02,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:02,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:50:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:50:02,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:50:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:50:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:50:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:50:02,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 00:50:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 00:50:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:02,472 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,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:02,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151146909] [2024-10-24 00:50:02,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151146909] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:02,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:02,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:50:02,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047306349] [2024-10-24 00:50:02,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:02,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:50:02,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:02,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:50:02,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:50:02,475 INFO L87 Difference]: Start difference. First operand 16222 states and 27712 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:50:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:04,370 INFO L93 Difference]: Finished difference Result 43023 states and 74996 transitions. [2024-10-24 00:50:04,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:50:04,371 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2024-10-24 00:50:04,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:04,494 INFO L225 Difference]: With dead ends: 43023 [2024-10-24 00:50:04,495 INFO L226 Difference]: Without dead ends: 29050 [2024-10-24 00:50:04,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:50:04,543 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1104 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:50:04,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 737 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 00:50:04,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29050 states. [2024-10-24 00:50:05,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29050 to 28885. [2024-10-24 00:50:06,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28885 states, 24047 states have (on average 1.622281365658918) internal successors, (39011), 24053 states have internal predecessors, (39011), 4814 states have call successors, (4814), 20 states have call predecessors, (4814), 23 states have return successors, (5425), 4811 states have call predecessors, (5425), 4811 states have call successors, (5425) [2024-10-24 00:50:06,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28885 states to 28885 states and 49250 transitions. [2024-10-24 00:50:06,149 INFO L78 Accepts]: Start accepts. Automaton has 28885 states and 49250 transitions. Word has length 122 [2024-10-24 00:50:06,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:06,150 INFO L471 AbstractCegarLoop]: Abstraction has 28885 states and 49250 transitions. [2024-10-24 00:50:06,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:50:06,150 INFO L276 IsEmpty]: Start isEmpty. Operand 28885 states and 49250 transitions. [2024-10-24 00:50:06,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-24 00:50:06,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:06,189 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:06,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 00:50:06,190 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:06,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:06,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1087460985, now seen corresponding path program 1 times [2024-10-24 00:50:06,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:06,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970529314] [2024-10-24 00:50:06,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:06,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:06,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:06,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:06,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:06,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:06,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:06,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:06,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:06,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:06,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:50:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:06,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:50:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:06,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:50:06,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:06,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:50:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:06,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:50:06,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:06,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:50:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:06,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 00:50:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:06,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 00:50:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:06,315 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:06,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:06,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970529314] [2024-10-24 00:50:06,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970529314] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:06,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:06,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:50:06,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997156973] [2024-10-24 00:50:06,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:06,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:50:06,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:06,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:50:06,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:50:06,318 INFO L87 Difference]: Start difference. First operand 28885 states and 49250 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:50:09,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:09,010 INFO L93 Difference]: Finished difference Result 78795 states and 136555 transitions. [2024-10-24 00:50:09,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:50:09,010 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2024-10-24 00:50:09,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:09,445 INFO L225 Difference]: With dead ends: 78795 [2024-10-24 00:50:09,445 INFO L226 Difference]: Without dead ends: 52938 [2024-10-24 00:50:09,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:50:09,529 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 1104 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:50:09,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 743 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:50:09,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52938 states. [2024-10-24 00:50:11,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52938 to 52773. [2024-10-24 00:50:11,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52773 states, 44220 states have (on average 1.6173903211216645) internal successors, (71521), 44226 states have internal predecessors, (71521), 8529 states have call successors, (8529), 20 states have call predecessors, (8529), 23 states have return successors, (9672), 8526 states have call predecessors, (9672), 8526 states have call successors, (9672) [2024-10-24 00:50:12,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52773 states to 52773 states and 89722 transitions. [2024-10-24 00:50:12,099 INFO L78 Accepts]: Start accepts. Automaton has 52773 states and 89722 transitions. Word has length 123 [2024-10-24 00:50:12,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:12,100 INFO L471 AbstractCegarLoop]: Abstraction has 52773 states and 89722 transitions. [2024-10-24 00:50:12,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:50:12,101 INFO L276 IsEmpty]: Start isEmpty. Operand 52773 states and 89722 transitions. [2024-10-24 00:50:12,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 00:50:12,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:12,142 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:50:12,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 00:50:12,142 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:12,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:12,143 INFO L85 PathProgramCache]: Analyzing trace with hash 2143369590, now seen corresponding path program 1 times [2024-10-24 00:50:12,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:12,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742313346] [2024-10-24 00:50:12,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:12,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:50:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:50:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:50:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:50:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:50:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:50:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 00:50:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 00:50:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:12,257 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:12,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:12,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742313346] [2024-10-24 00:50:12,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742313346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:12,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:12,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 00:50:12,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504914237] [2024-10-24 00:50:12,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:12,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 00:50:12,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:12,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 00:50:12,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 00:50:12,261 INFO L87 Difference]: Start difference. First operand 52773 states and 89722 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:50:15,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:15,790 INFO L93 Difference]: Finished difference Result 98570 states and 171260 transitions. [2024-10-24 00:50:15,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:50:15,790 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2024-10-24 00:50:15,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:16,261 INFO L225 Difference]: With dead ends: 98570 [2024-10-24 00:50:16,261 INFO L226 Difference]: Without dead ends: 98410 [2024-10-24 00:50:16,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:50:16,314 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 1098 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1112 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 00:50:16,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1112 Valid, 753 Invalid, 1918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 00:50:16,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98410 states. [2024-10-24 00:50:19,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98410 to 98245. [2024-10-24 00:50:19,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98245 states, 82893 states have (on average 1.611113121735249) internal successors, (133550), 82899 states have internal predecessors, (133550), 15328 states have call successors, (15328), 20 states have call predecessors, (15328), 23 states have return successors, (17517), 15325 states have call predecessors, (17517), 15325 states have call successors, (17517) [2024-10-24 00:50:20,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98245 states to 98245 states and 166395 transitions. [2024-10-24 00:50:20,838 INFO L78 Accepts]: Start accepts. Automaton has 98245 states and 166395 transitions. Word has length 124 [2024-10-24 00:50:20,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:20,839 INFO L471 AbstractCegarLoop]: Abstraction has 98245 states and 166395 transitions. [2024-10-24 00:50:20,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:50:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 98245 states and 166395 transitions. [2024-10-24 00:50:20,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 00:50:20,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:20,890 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:50:20,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 00:50:20,890 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:20,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:20,891 INFO L85 PathProgramCache]: Analyzing trace with hash -505694106, now seen corresponding path program 1 times [2024-10-24 00:50:20,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:20,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019966778] [2024-10-24 00:50:20,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:20,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:21,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:21,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:21,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:21,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:21,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:21,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:50:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:21,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:50:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:21,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:50:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:21,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:50:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:21,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:50:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:21,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:50:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:21,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 00:50:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:21,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 00:50:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:21,188 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:21,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:21,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019966778] [2024-10-24 00:50:21,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019966778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:21,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:21,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 00:50:21,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684770659] [2024-10-24 00:50:21,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:21,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 00:50:21,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:21,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 00:50:21,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:50:21,190 INFO L87 Difference]: Start difference. First operand 98245 states and 166395 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:50:28,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:50:28,179 INFO L93 Difference]: Finished difference Result 99412 states and 171486 transitions. [2024-10-24 00:50:28,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-24 00:50:28,180 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 125 [2024-10-24 00:50:28,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:50:28,623 INFO L225 Difference]: With dead ends: 99412 [2024-10-24 00:50:28,623 INFO L226 Difference]: Without dead ends: 99257 [2024-10-24 00:50:28,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=366, Invalid=1116, Unknown=0, NotChecked=0, Total=1482 [2024-10-24 00:50:28,670 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 2494 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 6272 mSolverCounterSat, 793 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2494 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 7065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 793 IncrementalHoareTripleChecker+Valid, 6272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:50:28,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2494 Valid, 972 Invalid, 7065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [793 Valid, 6272 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-24 00:50:28,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99257 states. [2024-10-24 00:50:32,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99257 to 98672. [2024-10-24 00:50:32,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98672 states, 83219 states have (on average 1.6106297840637354) internal successors, (134035), 83228 states have internal predecessors, (134035), 15391 states have call successors, (15391), 53 states have call predecessors, (15391), 61 states have return successors, (17588), 15390 states have call predecessors, (17588), 15385 states have call successors, (17588) [2024-10-24 00:50:32,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98672 states to 98672 states and 167014 transitions. [2024-10-24 00:50:32,574 INFO L78 Accepts]: Start accepts. Automaton has 98672 states and 167014 transitions. Word has length 125 [2024-10-24 00:50:32,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:50:32,575 INFO L471 AbstractCegarLoop]: Abstraction has 98672 states and 167014 transitions. [2024-10-24 00:50:32,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 6 states have internal predecessors, (83), 3 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:50:32,575 INFO L276 IsEmpty]: Start isEmpty. Operand 98672 states and 167014 transitions. [2024-10-24 00:50:32,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 00:50:32,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:50:32,619 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:50:32,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 00:50:32,620 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:50:32,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:50:32,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1377884372, now seen corresponding path program 1 times [2024-10-24 00:50:32,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:50:32,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072320013] [2024-10-24 00:50:32,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:50:32,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:50:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:32,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:50:32,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:32,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:50:32,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:32,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:50:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:32,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:50:32,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:32,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:50:32,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:32,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:50:32,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:32,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:50:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:32,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:50:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:32,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:50:32,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:32,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:50:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:32,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:50:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:32,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:50:32,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:32,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 00:50:32,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:50:32,898 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:32,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:50:32,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072320013] [2024-10-24 00:50:32,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072320013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:50:32,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:50:32,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 00:50:32,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826401401] [2024-10-24 00:50:32,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:50:32,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 00:50:32,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:50:32,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 00:50:32,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:50:32,900 INFO L87 Difference]: Start difference. First operand 98672 states and 167014 transitions. Second operand has 14 states, 12 states have (on average 7.0) internal successors, (84), 9 states have internal predecessors, (84), 6 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13)