./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product27.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product27.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c4d0e54eab5e94cf1a4af64165a2546f1c45e063bd8600195a743522777000c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 19:29:26,132 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 19:29:26,197 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 19:29:26,213 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 19:29:26,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 19:29:26,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 19:29:26,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 19:29:26,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 19:29:26,234 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 19:29:26,235 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 19:29:26,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 19:29:26,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 19:29:26,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 19:29:26,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 19:29:26,236 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 19:29:26,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 19:29:26,237 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 19:29:26,238 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 19:29:26,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 19:29:26,238 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 19:29:26,239 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 19:29:26,239 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 19:29:26,240 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 19:29:26,240 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 19:29:26,240 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 19:29:26,241 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 19:29:26,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 19:29:26,241 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 19:29:26,242 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 19:29:26,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 19:29:26,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 19:29:26,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 19:29:26,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:29:26,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 19:29:26,244 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 19:29:26,244 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 19:29:26,244 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 19:29:26,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 19:29:26,245 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 19:29:26,245 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 19:29:26,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 19:29:26,246 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 19:29:26,246 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c4d0e54eab5e94cf1a4af64165a2546f1c45e063bd8600195a743522777000c [2024-10-12 19:29:26,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 19:29:26,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 19:29:26,527 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 19:29:26,528 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 19:29:26,529 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 19:29:26,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product27.cil.c [2024-10-12 19:29:27,928 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 19:29:28,227 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 19:29:28,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product27.cil.c [2024-10-12 19:29:28,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54802b9a6/8fd8418b2a1a47798283c537fe405fcf/FLAG4d99e8ab1 [2024-10-12 19:29:28,266 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54802b9a6/8fd8418b2a1a47798283c537fe405fcf [2024-10-12 19:29:28,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 19:29:28,269 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 19:29:28,271 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 19:29:28,271 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 19:29:28,275 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 19:29:28,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:29:28" (1/1) ... [2024-10-12 19:29:28,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29120b4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:29:28, skipping insertion in model container [2024-10-12 19:29:28,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 07:29:28" (1/1) ... [2024-10-12 19:29:28,333 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 19:29:28,824 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product27.cil.c[40661,40674] [2024-10-12 19:29:28,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:29:28,912 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 19:29:28,922 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2024-10-12 19:29:28,924 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [167] [2024-10-12 19:29:28,924 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [184] [2024-10-12 19:29:28,924 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [550] [2024-10-12 19:29:28,924 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [612] [2024-10-12 19:29:28,925 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [650] [2024-10-12 19:29:28,925 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1054] [2024-10-12 19:29:28,926 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1435] [2024-10-12 19:29:28,926 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1756] [2024-10-12 19:29:28,926 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1978] [2024-10-12 19:29:28,926 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1987] [2024-10-12 19:29:28,995 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product27.cil.c[40661,40674] [2024-10-12 19:29:29,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 19:29:29,120 INFO L204 MainTranslator]: Completed translation [2024-10-12 19:29:29,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:29:29 WrapperNode [2024-10-12 19:29:29,121 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 19:29:29,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 19:29:29,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 19:29:29,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 19:29:29,129 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:29:29" (1/1) ... [2024-10-12 19:29:29,169 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:29:29" (1/1) ... [2024-10-12 19:29:29,245 INFO L138 Inliner]: procedures = 134, calls = 215, calls flagged for inlining = 63, calls inlined = 60, statements flattened = 1103 [2024-10-12 19:29:29,249 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 19:29:29,250 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 19:29:29,250 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 19:29:29,250 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 19:29:29,262 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:29:29" (1/1) ... [2024-10-12 19:29:29,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:29:29" (1/1) ... [2024-10-12 19:29:29,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:29:29" (1/1) ... [2024-10-12 19:29:29,315 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-12 19:29:29,315 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:29:29" (1/1) ... [2024-10-12 19:29:29,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:29:29" (1/1) ... [2024-10-12 19:29:29,348 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:29:29" (1/1) ... [2024-10-12 19:29:29,357 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:29:29" (1/1) ... [2024-10-12 19:29:29,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:29:29" (1/1) ... [2024-10-12 19:29:29,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:29:29" (1/1) ... [2024-10-12 19:29:29,377 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 19:29:29,378 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 19:29:29,378 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 19:29:29,378 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 19:29:29,379 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:29:29" (1/1) ... [2024-10-12 19:29:29,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 19:29:29,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:29:29,415 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-12 19:29:29,424 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-12 19:29:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2024-10-12 19:29:29,466 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2024-10-12 19:29:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2024-10-12 19:29:29,466 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2024-10-12 19:29:29,466 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-12 19:29:29,466 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-12 19:29:29,467 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2024-10-12 19:29:29,467 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2024-10-12 19:29:29,467 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-12 19:29:29,467 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-12 19:29:29,467 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-12 19:29:29,468 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-12 19:29:29,468 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-12 19:29:29,468 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-12 19:29:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-12 19:29:29,469 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-12 19:29:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-12 19:29:29,469 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-12 19:29:29,469 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-12 19:29:29,470 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-12 19:29:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2024-10-12 19:29:29,470 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2024-10-12 19:29:29,470 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-12 19:29:29,470 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-12 19:29:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 19:29:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-12 19:29:29,471 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-12 19:29:29,471 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-12 19:29:29,471 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-12 19:29:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2024-10-12 19:29:29,472 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2024-10-12 19:29:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-12 19:29:29,472 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-12 19:29:29,472 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-10-12 19:29:29,472 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-10-12 19:29:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-12 19:29:29,473 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-12 19:29:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-12 19:29:29,473 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-12 19:29:29,473 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-12 19:29:29,473 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-12 19:29:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-12 19:29:29,474 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-12 19:29:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-12 19:29:29,474 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-12 19:29:29,474 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-12 19:29:29,474 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-12 19:29:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 19:29:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-12 19:29:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-12 19:29:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-12 19:29:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-12 19:29:29,475 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-12 19:29:29,475 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2024-10-12 19:29:29,476 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2024-10-12 19:29:29,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 19:29:29,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 19:29:29,679 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 19:29:29,682 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 19:29:30,661 INFO L? ?]: Removed 564 outVars from TransFormulas that were not future-live. [2024-10-12 19:29:30,662 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 19:29:30,732 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 19:29:30,732 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 19:29:30,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:29:30 BoogieIcfgContainer [2024-10-12 19:29:30,733 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 19:29:30,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 19:29:30,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 19:29:30,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 19:29:30,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 07:29:28" (1/3) ... [2024-10-12 19:29:30,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78cb21f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:29:30, skipping insertion in model container [2024-10-12 19:29:30,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 07:29:29" (2/3) ... [2024-10-12 19:29:30,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78cb21f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 07:29:30, skipping insertion in model container [2024-10-12 19:29:30,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 07:29:30" (3/3) ... [2024-10-12 19:29:30,742 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec3_product27.cil.c [2024-10-12 19:29:30,758 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 19:29:30,759 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 19:29:30,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 19:29:30,860 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;@4dd6ca9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 19:29:30,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 19:29:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand has 390 states, 297 states have (on average 1.6094276094276094) internal successors, (478), 302 states have internal predecessors, (478), 66 states have call successors, (66), 25 states have call predecessors, (66), 25 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-12 19:29:30,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-12 19:29:30,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:30,907 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:30,907 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:30,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:30,914 INFO L85 PathProgramCache]: Analyzing trace with hash 615660377, now seen corresponding path program 1 times [2024-10-12 19:29:30,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:30,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635693020] [2024-10-12 19:29:30,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:30,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:31,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:31,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:29:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:29:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:29:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-12 19:29:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-12 19:29:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 19:29:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:29:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:29:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 19:29:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:29:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:29:31,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:31,835 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-12 19:29:31,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:31,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635693020] [2024-10-12 19:29:31,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635693020] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:29:31,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622660457] [2024-10-12 19:29:31,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:31,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:29:31,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:29:31,840 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-12 19:29:31,842 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-12 19:29:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:32,196 INFO L255 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-12 19:29:32,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:29:32,228 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-12 19:29:32,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:29:32,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622660457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:32,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:29:32,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-12 19:29:32,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239347513] [2024-10-12 19:29:32,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:32,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 19:29:32,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:32,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 19:29:32,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:29:32,273 INFO L87 Difference]: Start difference. First operand has 390 states, 297 states have (on average 1.6094276094276094) internal successors, (478), 302 states have internal predecessors, (478), 66 states have call successors, (66), 25 states have call predecessors, (66), 25 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 19:29:32,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:32,403 INFO L93 Difference]: Finished difference Result 591 states and 912 transitions. [2024-10-12 19:29:32,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 19:29:32,406 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2024-10-12 19:29:32,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:32,428 INFO L225 Difference]: With dead ends: 591 [2024-10-12 19:29:32,429 INFO L226 Difference]: Without dead ends: 386 [2024-10-12 19:29:32,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:29:32,444 INFO L432 NwaCegarLoop]: 584 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:32,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 584 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:29:32,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-10-12 19:29:32,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2024-10-12 19:29:32,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 295 states have (on average 1.5966101694915253) internal successors, (471), 298 states have internal predecessors, (471), 66 states have call successors, (66), 25 states have call predecessors, (66), 24 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-12 19:29:32,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 600 transitions. [2024-10-12 19:29:32,526 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 600 transitions. Word has length 105 [2024-10-12 19:29:32,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:32,529 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 600 transitions. [2024-10-12 19:29:32,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 19:29:32,529 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 600 transitions. [2024-10-12 19:29:32,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-12 19:29:32,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:32,537 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:32,554 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-12 19:29:32,742 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-12 19:29:32,743 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:32,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:32,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1569228992, now seen corresponding path program 1 times [2024-10-12 19:29:32,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:32,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208403849] [2024-10-12 19:29:32,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:32,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:32,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:32,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:32,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:32,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:33,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:29:33,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:33,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:29:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:33,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:29:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:33,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-12 19:29:33,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:33,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-12 19:29:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:33,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:29:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:33,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:29:33,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:33,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-12 19:29:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:33,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 19:29:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:33,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 19:29:33,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:33,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 19:29:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:33,093 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-12 19:29:33,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:33,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208403849] [2024-10-12 19:29:33,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208403849] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:29:33,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463939923] [2024-10-12 19:29:33,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:33,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:29:33,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:29:33,102 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-12 19:29:33,104 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-12 19:29:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:33,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 1073 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 19:29:33,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:29:33,481 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-12 19:29:33,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:29:33,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463939923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:33,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:29:33,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-12 19:29:33,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998498991] [2024-10-12 19:29:33,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:33,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:29:33,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:33,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:29:33,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:29:33,486 INFO L87 Difference]: Start difference. First operand 386 states and 600 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 19:29:33,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:33,582 INFO L93 Difference]: Finished difference Result 586 states and 892 transitions. [2024-10-12 19:29:33,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:29:33,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 106 [2024-10-12 19:29:33,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:33,590 INFO L225 Difference]: With dead ends: 586 [2024-10-12 19:29:33,591 INFO L226 Difference]: Without dead ends: 388 [2024-10-12 19:29:33,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:29:33,593 INFO L432 NwaCegarLoop]: 581 mSDtfsCounter, 0 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:33,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1161 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:29:33,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-10-12 19:29:33,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2024-10-12 19:29:33,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 297 states have (on average 1.5925925925925926) internal successors, (473), 300 states have internal predecessors, (473), 66 states have call successors, (66), 25 states have call predecessors, (66), 24 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-12 19:29:33,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 602 transitions. [2024-10-12 19:29:33,636 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 602 transitions. Word has length 106 [2024-10-12 19:29:33,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:33,636 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 602 transitions. [2024-10-12 19:29:33,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 19:29:33,637 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 602 transitions. [2024-10-12 19:29:33,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-12 19:29:33,644 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:33,644 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:33,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-12 19:29:33,845 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-12 19:29:33,846 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:33,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:33,847 INFO L85 PathProgramCache]: Analyzing trace with hash 929256607, now seen corresponding path program 1 times [2024-10-12 19:29:33,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:33,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249600814] [2024-10-12 19:29:33,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:33,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:33,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:34,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:34,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:34,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:34,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:29:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:34,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:29:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:34,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:29:34,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:34,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-12 19:29:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:34,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:29:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:34,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:29:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:34,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:29:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:34,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 19:29:34,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:34,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:29:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:34,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 19:29:34,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:34,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 19:29:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:34,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 19:29:34,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:34,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:29:34,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:34,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-12 19:29:34,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:34,180 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-12 19:29:34,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:34,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249600814] [2024-10-12 19:29:34,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249600814] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:29:34,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [669813574] [2024-10-12 19:29:34,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:34,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:29:34,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:29:34,184 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-12 19:29:34,186 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-12 19:29:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:34,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 1166 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 19:29:34,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:29:34,529 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-12 19:29:34,529 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:29:34,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [669813574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:34,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:29:34,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-12 19:29:34,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116640078] [2024-10-12 19:29:34,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:34,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 19:29:34,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:34,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 19:29:34,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:29:34,532 INFO L87 Difference]: Start difference. First operand 388 states and 602 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-12 19:29:34,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:34,597 INFO L93 Difference]: Finished difference Result 828 states and 1303 transitions. [2024-10-12 19:29:34,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 19:29:34,598 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2024-10-12 19:29:34,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:34,602 INFO L225 Difference]: With dead ends: 828 [2024-10-12 19:29:34,604 INFO L226 Difference]: Without dead ends: 462 [2024-10-12 19:29:34,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:29:34,606 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 136 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:34,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1133 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 19:29:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-12 19:29:34,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 457. [2024-10-12 19:29:34,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 352 states have (on average 1.6107954545454546) internal successors, (567), 355 states have internal predecessors, (567), 80 states have call successors, (80), 25 states have call predecessors, (80), 24 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2024-10-12 19:29:34,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 724 transitions. [2024-10-12 19:29:34,635 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 724 transitions. Word has length 131 [2024-10-12 19:29:34,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:34,635 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 724 transitions. [2024-10-12 19:29:34,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-12 19:29:34,636 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 724 transitions. [2024-10-12 19:29:34,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-12 19:29:34,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:34,639 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:34,658 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-12 19:29:34,840 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-12 19:29:34,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:34,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:34,841 INFO L85 PathProgramCache]: Analyzing trace with hash 669860306, now seen corresponding path program 1 times [2024-10-12 19:29:34,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:34,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499557250] [2024-10-12 19:29:34,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:34,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:34,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:35,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:35,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:35,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:35,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:35,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-12 19:29:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:35,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-12 19:29:35,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:35,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-12 19:29:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:35,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-12 19:29:35,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:35,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 19:29:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:35,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:29:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:35,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 19:29:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:35,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 19:29:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:35,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 19:29:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:35,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 19:29:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:35,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 19:29:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:35,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 19:29:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:35,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 19:29:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:35,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 19:29:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:35,174 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-12 19:29:35,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:35,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499557250] [2024-10-12 19:29:35,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499557250] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:29:35,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431240999] [2024-10-12 19:29:35,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:35,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:29:35,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:29:35,180 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-12 19:29:35,182 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-12 19:29:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:35,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-12 19:29:35,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:29:35,595 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-12 19:29:35,597 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:29:35,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431240999] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:35,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:29:35,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-12 19:29:35,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669974490] [2024-10-12 19:29:35,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:35,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:29:35,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:35,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:29:35,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:29:35,602 INFO L87 Difference]: Start difference. First operand 457 states and 724 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-12 19:29:35,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:35,721 INFO L93 Difference]: Finished difference Result 909 states and 1442 transitions. [2024-10-12 19:29:35,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:29:35,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 132 [2024-10-12 19:29:35,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:35,725 INFO L225 Difference]: With dead ends: 909 [2024-10-12 19:29:35,726 INFO L226 Difference]: Without dead ends: 459 [2024-10-12 19:29:35,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:29:35,729 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 2 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2281 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:35,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2281 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:29:35,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-12 19:29:35,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2024-10-12 19:29:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 353 states have (on average 1.6090651558073654) internal successors, (568), 357 states have internal predecessors, (568), 80 states have call successors, (80), 25 states have call predecessors, (80), 25 states have return successors, (79), 76 states have call predecessors, (79), 77 states have call successors, (79) [2024-10-12 19:29:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 727 transitions. [2024-10-12 19:29:35,753 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 727 transitions. Word has length 132 [2024-10-12 19:29:35,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:35,754 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 727 transitions. [2024-10-12 19:29:35,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-12 19:29:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 727 transitions. [2024-10-12 19:29:35,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-12 19:29:35,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:35,758 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:35,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-12 19:29:35,958 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-12 19:29:35,959 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:35,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:35,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1008654336, now seen corresponding path program 1 times [2024-10-12 19:29:35,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:35,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368336924] [2024-10-12 19:29:35,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:35,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:36,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:36,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:36,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:36,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:36,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:36,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-12 19:29:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:36,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-12 19:29:36,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:36,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-12 19:29:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:36,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 19:29:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:36,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:29:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:36,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 19:29:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:36,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:29:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:36,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 19:29:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:36,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 19:29:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:36,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 19:29:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:36,220 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-12 19:29:36,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:36,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368336924] [2024-10-12 19:29:36,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368336924] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:29:36,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814004269] [2024-10-12 19:29:36,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:36,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:29:36,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:29:36,223 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-12 19:29:36,245 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-12 19:29:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:36,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 19:29:36,553 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:29:36,604 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-12 19:29:36,606 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 19:29:36,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814004269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:36,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 19:29:36,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-12 19:29:36,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543915379] [2024-10-12 19:29:36,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:36,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-12 19:29:36,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:36,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 19:29:36,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-12 19:29:36,609 INFO L87 Difference]: Start difference. First operand 459 states and 727 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-12 19:29:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:36,725 INFO L93 Difference]: Finished difference Result 911 states and 1447 transitions. [2024-10-12 19:29:36,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 19:29:36,725 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2024-10-12 19:29:36,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:36,729 INFO L225 Difference]: With dead ends: 911 [2024-10-12 19:29:36,730 INFO L226 Difference]: Without dead ends: 461 [2024-10-12 19:29:36,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-12 19:29:36,732 INFO L432 NwaCegarLoop]: 571 mSDtfsCounter, 2 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2267 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:36,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2267 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 19:29:36,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2024-10-12 19:29:36,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 461. [2024-10-12 19:29:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 354 states have (on average 1.6073446327683616) internal successors, (569), 359 states have internal predecessors, (569), 80 states have call successors, (80), 25 states have call predecessors, (80), 26 states have return successors, (84), 76 states have call predecessors, (84), 77 states have call successors, (84) [2024-10-12 19:29:36,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 733 transitions. [2024-10-12 19:29:36,764 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 733 transitions. Word has length 115 [2024-10-12 19:29:36,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:36,765 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 733 transitions. [2024-10-12 19:29:36,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-12 19:29:36,765 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 733 transitions. [2024-10-12 19:29:36,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-12 19:29:36,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:36,768 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:36,786 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-12 19:29:36,972 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-12 19:29:36,973 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:36,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:36,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1634900594, now seen corresponding path program 1 times [2024-10-12 19:29:36,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:36,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041889771] [2024-10-12 19:29:36,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:36,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:37,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:37,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:37,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:37,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:37,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:37,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:37,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-12 19:29:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:37,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-12 19:29:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:37,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-12 19:29:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:37,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:29:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:37,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 19:29:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:37,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:29:37,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:37,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 19:29:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:37,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:29:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:37,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 19:29:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:37,190 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-12 19:29:37,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:37,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041889771] [2024-10-12 19:29:37,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041889771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:37,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:37,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:29:37,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13354934] [2024-10-12 19:29:37,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:37,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:29:37,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:37,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:29:37,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:29:37,193 INFO L87 Difference]: Start difference. First operand 461 states and 733 transitions. Second operand has 9 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-12 19:29:39,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:39,667 INFO L93 Difference]: Finished difference Result 1082 states and 1756 transitions. [2024-10-12 19:29:39,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 19:29:39,668 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2024-10-12 19:29:39,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:39,673 INFO L225 Difference]: With dead ends: 1082 [2024-10-12 19:29:39,673 INFO L226 Difference]: Without dead ends: 640 [2024-10-12 19:29:39,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:29:39,676 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 1329 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 3081 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1330 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 3576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 3081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:39,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1330 Valid, 1247 Invalid, 3576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 3081 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 19:29:39,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-10-12 19:29:39,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 461. [2024-10-12 19:29:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 354 states have (on average 1.6073446327683616) internal successors, (569), 359 states have internal predecessors, (569), 80 states have call successors, (80), 25 states have call predecessors, (80), 26 states have return successors, (83), 76 states have call predecessors, (83), 77 states have call successors, (83) [2024-10-12 19:29:39,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 732 transitions. [2024-10-12 19:29:39,739 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 732 transitions. Word has length 116 [2024-10-12 19:29:39,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:39,739 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 732 transitions. [2024-10-12 19:29:39,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-12 19:29:39,740 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 732 transitions. [2024-10-12 19:29:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-10-12 19:29:39,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:39,742 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:39,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 19:29:39,743 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:39,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:39,743 INFO L85 PathProgramCache]: Analyzing trace with hash -92926302, now seen corresponding path program 1 times [2024-10-12 19:29:39,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:39,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974340418] [2024-10-12 19:29:39,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:39,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:39,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:39,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:39,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:39,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:39,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:39,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:39,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:39,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:39,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-12 19:29:39,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:39,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-12 19:29:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:39,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-12 19:29:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:39,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:29:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:39,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:29:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:39,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:29:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:39,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:29:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:39,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:29:39,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:39,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 19:29:39,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:39,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-12 19:29:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:39,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-12 19:29:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:39,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-12 19:29:39,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:39,958 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-12 19:29:39,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:39,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974340418] [2024-10-12 19:29:39,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974340418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:39,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:39,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:29:39,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367136548] [2024-10-12 19:29:39,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:39,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:29:39,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:39,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:29:39,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:29:39,960 INFO L87 Difference]: Start difference. First operand 461 states and 732 transitions. Second operand has 9 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-12 19:29:42,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:42,392 INFO L93 Difference]: Finished difference Result 1084 states and 1759 transitions. [2024-10-12 19:29:42,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-12 19:29:42,393 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 135 [2024-10-12 19:29:42,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:42,398 INFO L225 Difference]: With dead ends: 1084 [2024-10-12 19:29:42,398 INFO L226 Difference]: Without dead ends: 642 [2024-10-12 19:29:42,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-12 19:29:42,402 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 1327 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 3084 mSolverCounterSat, 485 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1329 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 3569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 485 IncrementalHoareTripleChecker+Valid, 3084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:42,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1329 Valid, 1245 Invalid, 3569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [485 Valid, 3084 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-12 19:29:42,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-10-12 19:29:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 463. [2024-10-12 19:29:42,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 355 states have (on average 1.6056338028169015) internal successors, (570), 361 states have internal predecessors, (570), 80 states have call successors, (80), 25 states have call predecessors, (80), 27 states have return successors, (85), 76 states have call predecessors, (85), 77 states have call successors, (85) [2024-10-12 19:29:42,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 735 transitions. [2024-10-12 19:29:42,449 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 735 transitions. Word has length 135 [2024-10-12 19:29:42,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:42,449 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 735 transitions. [2024-10-12 19:29:42,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-12 19:29:42,450 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 735 transitions. [2024-10-12 19:29:42,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-12 19:29:42,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:42,453 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:42,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 19:29:42,454 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:42,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:42,454 INFO L85 PathProgramCache]: Analyzing trace with hash -923375831, now seen corresponding path program 1 times [2024-10-12 19:29:42,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:42,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695223075] [2024-10-12 19:29:42,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:42,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:42,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:42,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:42,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:42,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:42,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:42,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:42,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:29:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:42,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:29:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:42,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 19:29:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:42,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:29:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:42,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:29:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:42,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 19:29:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:42,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 19:29:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:42,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:29:42,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:42,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-12 19:29:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:42,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 19:29:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:42,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-12 19:29:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-12 19:29:42,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:42,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695223075] [2024-10-12 19:29:42,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695223075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:42,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:42,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-12 19:29:42,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617405816] [2024-10-12 19:29:42,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:42,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-12 19:29:42,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:42,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-12 19:29:42,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-12 19:29:42,705 INFO L87 Difference]: Start difference. First operand 463 states and 735 transitions. Second operand has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-12 19:29:44,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:44,958 INFO L93 Difference]: Finished difference Result 1084 states and 1758 transitions. [2024-10-12 19:29:44,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-12 19:29:44,958 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 136 [2024-10-12 19:29:44,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:44,963 INFO L225 Difference]: With dead ends: 1084 [2024-10-12 19:29:44,963 INFO L226 Difference]: Without dead ends: 642 [2024-10-12 19:29:44,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-10-12 19:29:44,965 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1325 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 3084 mSolverCounterSat, 476 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1326 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 3560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 476 IncrementalHoareTripleChecker+Valid, 3084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:44,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1326 Valid, 1242 Invalid, 3560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [476 Valid, 3084 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-12 19:29:44,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-10-12 19:29:44,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 463. [2024-10-12 19:29:45,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 355 states have (on average 1.6056338028169015) internal successors, (570), 361 states have internal predecessors, (570), 80 states have call successors, (80), 25 states have call predecessors, (80), 27 states have return successors, (85), 76 states have call predecessors, (85), 77 states have call successors, (85) [2024-10-12 19:29:45,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 735 transitions. [2024-10-12 19:29:45,003 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 735 transitions. Word has length 136 [2024-10-12 19:29:45,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:45,004 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 735 transitions. [2024-10-12 19:29:45,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (21), 6 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2024-10-12 19:29:45,004 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 735 transitions. [2024-10-12 19:29:45,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-12 19:29:45,006 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:45,006 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:45,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 19:29:45,007 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:45,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:45,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1484276503, now seen corresponding path program 1 times [2024-10-12 19:29:45,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:45,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092935295] [2024-10-12 19:29:45,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:45,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:45,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:45,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-12 19:29:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-12 19:29:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 19:29:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 19:29:45,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:29:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:29:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 19:29:45,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 19:29:45,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:45,226 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-12 19:29:45,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:45,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092935295] [2024-10-12 19:29:45,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092935295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:45,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:45,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 19:29:45,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915828799] [2024-10-12 19:29:45,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:45,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 19:29:45,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:45,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 19:29:45,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:29:45,228 INFO L87 Difference]: Start difference. First operand 463 states and 735 transitions. Second operand has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-12 19:29:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:48,071 INFO L93 Difference]: Finished difference Result 1082 states and 1753 transitions. [2024-10-12 19:29:48,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:29:48,072 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 118 [2024-10-12 19:29:48,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:48,076 INFO L225 Difference]: With dead ends: 1082 [2024-10-12 19:29:48,076 INFO L226 Difference]: Without dead ends: 642 [2024-10-12 19:29:48,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-12 19:29:48,078 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1330 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 5090 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 1728 SdHoareTripleChecker+Invalid, 5583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 5090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:48,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 1728 Invalid, 5583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [493 Valid, 5090 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-12 19:29:48,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2024-10-12 19:29:48,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 463. [2024-10-12 19:29:48,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 355 states have (on average 1.6056338028169015) internal successors, (570), 361 states have internal predecessors, (570), 80 states have call successors, (80), 25 states have call predecessors, (80), 27 states have return successors, (84), 76 states have call predecessors, (84), 77 states have call successors, (84) [2024-10-12 19:29:48,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 734 transitions. [2024-10-12 19:29:48,115 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 734 transitions. Word has length 118 [2024-10-12 19:29:48,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:48,116 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 734 transitions. [2024-10-12 19:29:48,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-12 19:29:48,116 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 734 transitions. [2024-10-12 19:29:48,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-12 19:29:48,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:48,118 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:48,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 19:29:48,118 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:48,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:48,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1098031065, now seen corresponding path program 2 times [2024-10-12 19:29:48,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:48,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936333898] [2024-10-12 19:29:48,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:48,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:48,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:48,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:48,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:48,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:48,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:48,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:48,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:48,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:48,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:48,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:48,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-12 19:29:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:48,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:29:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:48,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 19:29:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:48,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:29:48,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:48,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-12 19:29:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:48,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-12 19:29:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:48,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 19:29:48,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:48,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 19:29:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:48,337 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-12 19:29:48,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:48,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936333898] [2024-10-12 19:29:48,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936333898] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:48,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:48,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-12 19:29:48,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027483424] [2024-10-12 19:29:48,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:48,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-12 19:29:48,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:48,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-12 19:29:48,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-12 19:29:48,339 INFO L87 Difference]: Start difference. First operand 463 states and 734 transitions. Second operand has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-12 19:29:51,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:51,009 INFO L93 Difference]: Finished difference Result 1084 states and 1759 transitions. [2024-10-12 19:29:51,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-12 19:29:51,009 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 119 [2024-10-12 19:29:51,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:51,028 INFO L225 Difference]: With dead ends: 1084 [2024-10-12 19:29:51,028 INFO L226 Difference]: Without dead ends: 644 [2024-10-12 19:29:51,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-12 19:29:51,030 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 1323 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 5176 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1324 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 5647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 5176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:51,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1324 Valid, 1729 Invalid, 5647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 5176 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-12 19:29:51,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2024-10-12 19:29:51,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 465. [2024-10-12 19:29:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 356 states have (on average 1.603932584269663) internal successors, (571), 363 states have internal predecessors, (571), 80 states have call successors, (80), 25 states have call predecessors, (80), 28 states have return successors, (89), 76 states have call predecessors, (89), 77 states have call successors, (89) [2024-10-12 19:29:51,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 740 transitions. [2024-10-12 19:29:51,070 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 740 transitions. Word has length 119 [2024-10-12 19:29:51,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:51,071 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 740 transitions. [2024-10-12 19:29:51,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-12 19:29:51,071 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 740 transitions. [2024-10-12 19:29:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-12 19:29:51,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:51,074 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:51,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 19:29:51,074 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:51,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:51,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1025119802, now seen corresponding path program 1 times [2024-10-12 19:29:51,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:51,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143090947] [2024-10-12 19:29:51,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:51,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:51,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-12 19:29:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:29:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:29:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 19:29:51,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:29:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-12 19:29:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 19:29:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-12 19:29:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:29:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-12 19:29:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-12 19:29:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,325 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-12 19:29:51,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:51,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143090947] [2024-10-12 19:29:51,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143090947] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 19:29:51,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397448111] [2024-10-12 19:29:51,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:51,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 19:29:51,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 19:29:51,328 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-12 19:29:51,329 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-12 19:29:51,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:51,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 1177 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-12 19:29:51,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 19:29:51,672 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-12 19:29:51,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-12 19:29:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-12 19:29:51,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397448111] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-12 19:29:51,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-12 19:29:51,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-10-12 19:29:51,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435077780] [2024-10-12 19:29:51,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-12 19:29:51,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-12 19:29:51,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:51,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-12 19:29:51,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-12 19:29:51,768 INFO L87 Difference]: Start difference. First operand 465 states and 740 transitions. Second operand has 15 states, 14 states have (on average 10.071428571428571) internal successors, (141), 11 states have internal predecessors, (141), 4 states have call successors, (42), 6 states have call predecessors, (42), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) [2024-10-12 19:29:54,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:54,802 INFO L93 Difference]: Finished difference Result 1523 states and 2570 transitions. [2024-10-12 19:29:54,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-12 19:29:54,802 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 10.071428571428571) internal successors, (141), 11 states have internal predecessors, (141), 4 states have call successors, (42), 6 states have call predecessors, (42), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) Word has length 138 [2024-10-12 19:29:54,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:54,811 INFO L225 Difference]: With dead ends: 1523 [2024-10-12 19:29:54,811 INFO L226 Difference]: Without dead ends: 1084 [2024-10-12 19:29:54,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 305 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2024-10-12 19:29:54,814 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 2765 mSDsluCounter, 1750 mSDsCounter, 0 mSdLazyCounter, 4983 mSolverCounterSat, 890 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2785 SdHoareTripleChecker+Valid, 1936 SdHoareTripleChecker+Invalid, 5873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 890 IncrementalHoareTripleChecker+Valid, 4983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:54,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2785 Valid, 1936 Invalid, 5873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [890 Valid, 4983 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 19:29:54,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2024-10-12 19:29:54,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 890. [2024-10-12 19:29:54,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 702 states have (on average 1.650997150997151) internal successors, (1159), 709 states have internal predecessors, (1159), 159 states have call successors, (159), 25 states have call predecessors, (159), 28 states have return successors, (178), 155 states have call predecessors, (178), 156 states have call successors, (178) [2024-10-12 19:29:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1496 transitions. [2024-10-12 19:29:54,870 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1496 transitions. Word has length 138 [2024-10-12 19:29:54,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:54,871 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1496 transitions. [2024-10-12 19:29:54,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 10.071428571428571) internal successors, (141), 11 states have internal predecessors, (141), 4 states have call successors, (42), 6 states have call predecessors, (42), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) [2024-10-12 19:29:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1496 transitions. [2024-10-12 19:29:54,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-12 19:29:54,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:54,876 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-12 19:29:54,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-12 19:29:55,077 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-12 19:29:55,077 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:55,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:55,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1889822118, now seen corresponding path program 1 times [2024-10-12 19:29:55,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:55,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347520444] [2024-10-12 19:29:55,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:55,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:55,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:55,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:55,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:55,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:55,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:55,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:55,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:55,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:55,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-12 19:29:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:55,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:29:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:55,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-12 19:29:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:55,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:29:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:55,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:29:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:55,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 19:29:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:55,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 19:29:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:55,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 19:29:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:55,223 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-12 19:29:55,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:55,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347520444] [2024-10-12 19:29:55,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347520444] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:55,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:55,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:29:55,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171785651] [2024-10-12 19:29:55,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:55,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:29:55,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:55,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:29:55,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:29:55,226 INFO L87 Difference]: Start difference. First operand 890 states and 1496 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 19:29:56,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:56,870 INFO L93 Difference]: Finished difference Result 2298 states and 3959 transitions. [2024-10-12 19:29:56,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:29:56,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 124 [2024-10-12 19:29:56,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:56,881 INFO L225 Difference]: With dead ends: 2298 [2024-10-12 19:29:56,881 INFO L226 Difference]: Without dead ends: 1476 [2024-10-12 19:29:56,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:29:56,886 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 1457 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 2305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:56,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 921 Invalid, 2305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 19:29:56,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2024-10-12 19:29:56,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1292. [2024-10-12 19:29:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1025 states have (on average 1.664390243902439) internal successors, (1706), 1032 states have internal predecessors, (1706), 238 states have call successors, (238), 25 states have call predecessors, (238), 28 states have return successors, (267), 234 states have call predecessors, (267), 235 states have call successors, (267) [2024-10-12 19:29:56,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 2211 transitions. [2024-10-12 19:29:56,959 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 2211 transitions. Word has length 124 [2024-10-12 19:29:56,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:56,960 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 2211 transitions. [2024-10-12 19:29:56,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 19:29:56,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 2211 transitions. [2024-10-12 19:29:56,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-12 19:29:56,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:56,967 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:29:56,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 19:29:56,967 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:56,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:56,968 INFO L85 PathProgramCache]: Analyzing trace with hash -708475126, now seen corresponding path program 1 times [2024-10-12 19:29:56,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:56,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146971759] [2024-10-12 19:29:56,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:56,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:57,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:57,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:57,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:57,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:57,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:57,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:57,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-12 19:29:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:57,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:29:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:57,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-12 19:29:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:57,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:29:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:57,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 19:29:57,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:57,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 19:29:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:57,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-12 19:29:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:57,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 19:29:57,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:57,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 19:29:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:57,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:29:57,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:57,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 19:29:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-12 19:29:57,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:57,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146971759] [2024-10-12 19:29:57,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146971759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:57,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:57,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:29:57,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586798677] [2024-10-12 19:29:57,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:57,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:29:57,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:57,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:29:57,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:29:57,125 INFO L87 Difference]: Start difference. First operand 1292 states and 2211 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-12 19:29:58,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:29:58,672 INFO L93 Difference]: Finished difference Result 3301 states and 5736 transitions. [2024-10-12 19:29:58,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:29:58,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-10-12 19:29:58,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:29:58,685 INFO L225 Difference]: With dead ends: 3301 [2024-10-12 19:29:58,685 INFO L226 Difference]: Without dead ends: 2127 [2024-10-12 19:29:58,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:29:58,690 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 1456 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 2312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:29:58,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 919 Invalid, 2312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1764 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 19:29:58,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2127 states. [2024-10-12 19:29:58,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2127 to 1943. [2024-10-12 19:29:58,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1943 states, 1557 states have (on average 1.6711624919717405) internal successors, (2602), 1564 states have internal predecessors, (2602), 357 states have call successors, (357), 25 states have call predecessors, (357), 28 states have return successors, (386), 353 states have call predecessors, (386), 354 states have call successors, (386) [2024-10-12 19:29:58,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1943 states to 1943 states and 3345 transitions. [2024-10-12 19:29:58,787 INFO L78 Accepts]: Start accepts. Automaton has 1943 states and 3345 transitions. Word has length 143 [2024-10-12 19:29:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:29:58,788 INFO L471 AbstractCegarLoop]: Abstraction has 1943 states and 3345 transitions. [2024-10-12 19:29:58,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-12 19:29:58,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1943 states and 3345 transitions. [2024-10-12 19:29:58,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-12 19:29:58,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:29:58,799 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-12 19:29:58,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 19:29:58,799 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:29:58,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:29:58,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1632521560, now seen corresponding path program 1 times [2024-10-12 19:29:58,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:29:58,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942517579] [2024-10-12 19:29:58,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:29:58,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:29:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:58,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:29:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:58,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:29:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:58,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:29:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:58,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:29:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:58,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:29:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:58,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:29:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:58,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-12 19:29:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:58,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:29:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:58,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-12 19:29:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:58,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-12 19:29:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:58,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-12 19:29:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:58,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-12 19:29:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:58,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 19:29:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:58,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-12 19:29:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:29:58,899 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-12 19:29:58,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:29:58,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942517579] [2024-10-12 19:29:58,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942517579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:29:58,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:29:58,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:29:58,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344215418] [2024-10-12 19:29:58,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:29:58,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:29:58,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:29:58,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:29:58,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:29:58,901 INFO L87 Difference]: Start difference. First operand 1943 states and 3345 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 19:30:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:00,578 INFO L93 Difference]: Finished difference Result 4825 states and 8454 transitions. [2024-10-12 19:30:00,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:30:00,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 126 [2024-10-12 19:30:00,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:00,597 INFO L225 Difference]: With dead ends: 4825 [2024-10-12 19:30:00,598 INFO L226 Difference]: Without dead ends: 3128 [2024-10-12 19:30:00,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:30:00,606 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 1455 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 1736 mSolverCounterSat, 557 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 2293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 557 IncrementalHoareTripleChecker+Valid, 1736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:00,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 907 Invalid, 2293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [557 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 19:30:00,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3128 states. [2024-10-12 19:30:00,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3128 to 2944. [2024-10-12 19:30:00,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2944 states, 2396 states have (on average 1.6769616026711185) internal successors, (4018), 2403 states have internal predecessors, (4018), 519 states have call successors, (519), 25 states have call predecessors, (519), 28 states have return successors, (564), 515 states have call predecessors, (564), 516 states have call successors, (564) [2024-10-12 19:30:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 5101 transitions. [2024-10-12 19:30:00,793 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 5101 transitions. Word has length 126 [2024-10-12 19:30:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:30:00,793 INFO L471 AbstractCegarLoop]: Abstraction has 2944 states and 5101 transitions. [2024-10-12 19:30:00,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 19:30:00,794 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 5101 transitions. [2024-10-12 19:30:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-12 19:30:00,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:00,808 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:30:00,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 19:30:00,808 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:00,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:00,809 INFO L85 PathProgramCache]: Analyzing trace with hash -2046288569, now seen corresponding path program 1 times [2024-10-12 19:30:00,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:00,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855467870] [2024-10-12 19:30:00,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:00,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:00,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:00,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:00,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:00,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:00,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:30:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:00,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:30:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:00,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:30:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:00,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-12 19:30:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:00,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:30:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:00,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-12 19:30:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:00,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 19:30:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:00,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 19:30:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:00,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 19:30:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:00,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 19:30:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:00,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 19:30:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:00,927 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-12 19:30:00,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:00,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855467870] [2024-10-12 19:30:00,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855467870] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:30:00,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:30:00,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:30:00,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888912665] [2024-10-12 19:30:00,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:30:00,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:30:00,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:00,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:30:00,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:30:00,929 INFO L87 Difference]: Start difference. First operand 2944 states and 5101 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 19:30:02,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:02,491 INFO L93 Difference]: Finished difference Result 7237 states and 12767 transitions. [2024-10-12 19:30:02,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:30:02,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 127 [2024-10-12 19:30:02,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:02,517 INFO L225 Difference]: With dead ends: 7237 [2024-10-12 19:30:02,517 INFO L226 Difference]: Without dead ends: 4748 [2024-10-12 19:30:02,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:30:02,526 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1451 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 551 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 2286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 551 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:02,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 906 Invalid, 2286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [551 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 19:30:02,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4748 states. [2024-10-12 19:30:02,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4748 to 4564. [2024-10-12 19:30:02,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4564 states, 3771 states have (on average 1.681251657385309) internal successors, (6340), 3778 states have internal predecessors, (6340), 764 states have call successors, (764), 25 states have call predecessors, (764), 28 states have return successors, (835), 760 states have call predecessors, (835), 761 states have call successors, (835) [2024-10-12 19:30:02,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4564 states to 4564 states and 7939 transitions. [2024-10-12 19:30:02,756 INFO L78 Accepts]: Start accepts. Automaton has 4564 states and 7939 transitions. Word has length 127 [2024-10-12 19:30:02,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:30:02,757 INFO L471 AbstractCegarLoop]: Abstraction has 4564 states and 7939 transitions. [2024-10-12 19:30:02,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 19:30:02,757 INFO L276 IsEmpty]: Start isEmpty. Operand 4564 states and 7939 transitions. [2024-10-12 19:30:02,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-12 19:30:02,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:02,772 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:30:02,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 19:30:02,773 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:02,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:02,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1209921954, now seen corresponding path program 1 times [2024-10-12 19:30:02,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:02,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387384931] [2024-10-12 19:30:02,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:02,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:02,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:02,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:02,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:02,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:02,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:30:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:02,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:30:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:02,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:30:02,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:02,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-12 19:30:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:02,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:30:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:02,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-12 19:30:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:02,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-12 19:30:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:02,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:30:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:02,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-12 19:30:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:02,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 19:30:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:02,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 19:30:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:02,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-12 19:30:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:02,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-12 19:30:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:02,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-12 19:30:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:02,934 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-12 19:30:02,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:02,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387384931] [2024-10-12 19:30:02,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387384931] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:30:02,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:30:02,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:30:02,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104973642] [2024-10-12 19:30:02,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:30:02,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:30:02,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:02,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:30:02,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:30:02,937 INFO L87 Difference]: Start difference. First operand 4564 states and 7939 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-12 19:30:04,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:04,632 INFO L93 Difference]: Finished difference Result 11314 states and 20020 transitions. [2024-10-12 19:30:04,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:30:04,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 146 [2024-10-12 19:30:04,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:04,669 INFO L225 Difference]: With dead ends: 11314 [2024-10-12 19:30:04,669 INFO L226 Difference]: Without dead ends: 7508 [2024-10-12 19:30:04,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:30:04,683 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 1452 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 561 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1471 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 561 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:04,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1471 Valid, 935 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [561 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-12 19:30:04,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7508 states. [2024-10-12 19:30:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7508 to 7324. [2024-10-12 19:30:05,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7324 states, 6038 states have (on average 1.6753892017224246) internal successors, (10116), 6045 states have internal predecessors, (10116), 1257 states have call successors, (1257), 25 states have call predecessors, (1257), 28 states have return successors, (1372), 1253 states have call predecessors, (1372), 1254 states have call successors, (1372) [2024-10-12 19:30:05,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7324 states to 7324 states and 12745 transitions. [2024-10-12 19:30:05,064 INFO L78 Accepts]: Start accepts. Automaton has 7324 states and 12745 transitions. Word has length 146 [2024-10-12 19:30:05,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:30:05,065 INFO L471 AbstractCegarLoop]: Abstraction has 7324 states and 12745 transitions. [2024-10-12 19:30:05,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-12 19:30:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 7324 states and 12745 transitions. [2024-10-12 19:30:05,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-12 19:30:05,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:05,091 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:30:05,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 19:30:05,091 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:05,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:05,091 INFO L85 PathProgramCache]: Analyzing trace with hash 568121859, now seen corresponding path program 1 times [2024-10-12 19:30:05,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:05,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691136451] [2024-10-12 19:30:05,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:05,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:05,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:05,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:05,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:05,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:05,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:05,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:30:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:05,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:30:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:05,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:30:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:05,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-12 19:30:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:05,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:30:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:05,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-12 19:30:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:05,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-12 19:30:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:05,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-12 19:30:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:05,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 19:30:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:05,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-12 19:30:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:05,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-12 19:30:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:05,198 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-12 19:30:05,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:05,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691136451] [2024-10-12 19:30:05,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691136451] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:30:05,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:30:05,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:30:05,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441473614] [2024-10-12 19:30:05,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:30:05,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:30:05,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:05,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:30:05,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:30:05,201 INFO L87 Difference]: Start difference. First operand 7324 states and 12745 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 19:30:06,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:06,877 INFO L93 Difference]: Finished difference Result 18673 states and 33040 transitions. [2024-10-12 19:30:06,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:30:06,878 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2024-10-12 19:30:06,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:06,929 INFO L225 Difference]: With dead ends: 18673 [2024-10-12 19:30:06,929 INFO L226 Difference]: Without dead ends: 12493 [2024-10-12 19:30:06,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:30:06,953 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 1446 mSDsluCounter, 712 mSDsCounter, 0 mSdLazyCounter, 1766 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 2316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 1766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:06,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 913 Invalid, 2316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 1766 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 19:30:06,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12493 states. [2024-10-12 19:30:07,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12493 to 12309. [2024-10-12 19:30:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12309 states, 10201 states have (on average 1.6753259484364278) internal successors, (17090), 10208 states have internal predecessors, (17090), 2079 states have call successors, (2079), 25 states have call predecessors, (2079), 28 states have return successors, (2272), 2075 states have call predecessors, (2272), 2076 states have call successors, (2272) [2024-10-12 19:30:07,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12309 states to 12309 states and 21441 transitions. [2024-10-12 19:30:07,487 INFO L78 Accepts]: Start accepts. Automaton has 12309 states and 21441 transitions. Word has length 129 [2024-10-12 19:30:07,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:30:07,487 INFO L471 AbstractCegarLoop]: Abstraction has 12309 states and 21441 transitions. [2024-10-12 19:30:07,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 19:30:07,488 INFO L276 IsEmpty]: Start isEmpty. Operand 12309 states and 21441 transitions. [2024-10-12 19:30:07,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-12 19:30:07,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:07,599 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:30:07,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 19:30:07,599 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:07,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:07,600 INFO L85 PathProgramCache]: Analyzing trace with hash 389711342, now seen corresponding path program 1 times [2024-10-12 19:30:07,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:07,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479574813] [2024-10-12 19:30:07,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:07,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:07,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:07,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:07,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:07,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:07,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:30:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:07,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:30:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:07,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:30:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:07,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-12 19:30:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:07,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-12 19:30:07,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:07,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-12 19:30:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:07,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-12 19:30:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:07,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-12 19:30:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:07,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-12 19:30:07,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:07,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 19:30:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:07,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 19:30:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:07,736 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-12 19:30:07,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:07,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479574813] [2024-10-12 19:30:07,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479574813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:30:07,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:30:07,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:30:07,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417764122] [2024-10-12 19:30:07,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:30:07,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:30:07,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:07,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:30:07,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:30:07,739 INFO L87 Difference]: Start difference. First operand 12309 states and 21441 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 19:30:09,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:09,644 INFO L93 Difference]: Finished difference Result 29639 states and 52223 transitions. [2024-10-12 19:30:09,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:30:09,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2024-10-12 19:30:09,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:09,727 INFO L225 Difference]: With dead ends: 29639 [2024-10-12 19:30:09,727 INFO L226 Difference]: Without dead ends: 19453 [2024-10-12 19:30:09,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:30:09,764 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1448 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1728 mSolverCounterSat, 560 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 2288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 560 IncrementalHoareTripleChecker+Valid, 1728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:09,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 881 Invalid, 2288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [560 Valid, 1728 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-12 19:30:09,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19453 states. [2024-10-12 19:30:10,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19453 to 19269. [2024-10-12 19:30:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19269 states, 15958 states have (on average 1.6532773530517608) internal successors, (26383), 15965 states have internal predecessors, (26383), 3282 states have call successors, (3282), 25 states have call predecessors, (3282), 28 states have return successors, (3619), 3278 states have call predecessors, (3619), 3279 states have call successors, (3619) [2024-10-12 19:30:10,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19269 states to 19269 states and 33284 transitions. [2024-10-12 19:30:10,608 INFO L78 Accepts]: Start accepts. Automaton has 19269 states and 33284 transitions. Word has length 130 [2024-10-12 19:30:10,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:30:10,608 INFO L471 AbstractCegarLoop]: Abstraction has 19269 states and 33284 transitions. [2024-10-12 19:30:10,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 19:30:10,609 INFO L276 IsEmpty]: Start isEmpty. Operand 19269 states and 33284 transitions. [2024-10-12 19:30:10,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-12 19:30:10,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:10,634 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:30:10,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 19:30:10,634 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:10,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:10,634 INFO L85 PathProgramCache]: Analyzing trace with hash 254848548, now seen corresponding path program 1 times [2024-10-12 19:30:10,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:10,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545095601] [2024-10-12 19:30:10,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:10,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:10,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:10,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:10,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:10,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:10,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:30:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:10,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:30:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:10,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:30:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:10,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-12 19:30:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:10,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-12 19:30:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:10,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-12 19:30:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:10,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-12 19:30:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:10,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 19:30:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:10,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 19:30:10,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:10,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-12 19:30:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:10,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-12 19:30:10,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:10,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-12 19:30:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:10,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-12 19:30:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:10,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-12 19:30:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-12 19:30:10,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:10,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545095601] [2024-10-12 19:30:10,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545095601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:30:10,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:30:10,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:30:10,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312923572] [2024-10-12 19:30:10,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:30:10,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:30:10,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:10,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:30:10,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:30:10,830 INFO L87 Difference]: Start difference. First operand 19269 states and 33284 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-12 19:30:13,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:13,381 INFO L93 Difference]: Finished difference Result 51080 states and 89756 transitions. [2024-10-12 19:30:13,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:30:13,382 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 149 [2024-10-12 19:30:13,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:13,557 INFO L225 Difference]: With dead ends: 51080 [2024-10-12 19:30:13,558 INFO L226 Difference]: Without dead ends: 34582 [2024-10-12 19:30:13,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:30:13,632 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1446 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 559 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 2294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 559 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:13,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 907 Invalid, 2294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [559 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-12 19:30:13,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34582 states. [2024-10-12 19:30:14,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34582 to 34398. [2024-10-12 19:30:14,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34398 states, 28637 states have (on average 1.6505918916087579) internal successors, (47268), 28644 states have internal predecessors, (47268), 5732 states have call successors, (5732), 25 states have call predecessors, (5732), 28 states have return successors, (6343), 5728 states have call predecessors, (6343), 5729 states have call successors, (6343) [2024-10-12 19:30:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34398 states to 34398 states and 59343 transitions. [2024-10-12 19:30:15,104 INFO L78 Accepts]: Start accepts. Automaton has 34398 states and 59343 transitions. Word has length 149 [2024-10-12 19:30:15,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:30:15,105 INFO L471 AbstractCegarLoop]: Abstraction has 34398 states and 59343 transitions. [2024-10-12 19:30:15,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-12 19:30:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 34398 states and 59343 transitions. [2024-10-12 19:30:15,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-12 19:30:15,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:15,143 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:30:15,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 19:30:15,143 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:15,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:15,144 INFO L85 PathProgramCache]: Analyzing trace with hash -132332970, now seen corresponding path program 1 times [2024-10-12 19:30:15,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:15,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422908953] [2024-10-12 19:30:15,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:15,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:15,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:15,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:15,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:15,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:15,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:30:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:15,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:30:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:15,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:30:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:15,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-12 19:30:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:15,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-12 19:30:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:15,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-12 19:30:15,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:15,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-12 19:30:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:15,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 19:30:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:15,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-12 19:30:15,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:15,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-12 19:30:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:15,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-12 19:30:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:15,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-12 19:30:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:15,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-12 19:30:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:15,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-12 19:30:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:15,267 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-12 19:30:15,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:15,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422908953] [2024-10-12 19:30:15,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422908953] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:30:15,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:30:15,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:30:15,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626372782] [2024-10-12 19:30:15,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:30:15,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:30:15,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:15,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:30:15,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:30:15,270 INFO L87 Difference]: Start difference. First operand 34398 states and 59343 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-12 19:30:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:18,396 INFO L93 Difference]: Finished difference Result 93962 states and 164350 transitions. [2024-10-12 19:30:18,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:30:18,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2024-10-12 19:30:18,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:18,700 INFO L225 Difference]: With dead ends: 93962 [2024-10-12 19:30:18,701 INFO L226 Difference]: Without dead ends: 63258 [2024-10-12 19:30:18,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:30:18,813 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 1443 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 1737 mSolverCounterSat, 563 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 2300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 563 IncrementalHoareTripleChecker+Valid, 1737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:18,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1462 Valid, 913 Invalid, 2300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [563 Valid, 1737 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-12 19:30:18,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63258 states. [2024-10-12 19:30:20,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63258 to 63074. [2024-10-12 19:30:20,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63074 states, 52800 states have (on average 1.646969696969697) internal successors, (86960), 52807 states have internal predecessors, (86960), 10245 states have call successors, (10245), 25 states have call predecessors, (10245), 28 states have return successors, (11388), 10241 states have call predecessors, (11388), 10242 states have call successors, (11388) [2024-10-12 19:30:21,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63074 states to 63074 states and 108593 transitions. [2024-10-12 19:30:21,130 INFO L78 Accepts]: Start accepts. Automaton has 63074 states and 108593 transitions. Word has length 150 [2024-10-12 19:30:21,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:30:21,131 INFO L471 AbstractCegarLoop]: Abstraction has 63074 states and 108593 transitions. [2024-10-12 19:30:21,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-10-12 19:30:21,131 INFO L276 IsEmpty]: Start isEmpty. Operand 63074 states and 108593 transitions. [2024-10-12 19:30:21,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-12 19:30:21,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:21,174 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:30:21,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 19:30:21,175 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:21,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:21,175 INFO L85 PathProgramCache]: Analyzing trace with hash -9357886, now seen corresponding path program 1 times [2024-10-12 19:30:21,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:21,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472903856] [2024-10-12 19:30:21,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:21,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:21,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:21,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:21,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:21,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:21,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:30:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:21,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:30:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:21,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:30:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:21,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-12 19:30:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:21,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-12 19:30:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:21,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-12 19:30:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:21,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-12 19:30:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:21,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-12 19:30:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:21,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-12 19:30:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:21,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-12 19:30:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:21,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-12 19:30:21,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:21,294 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-12 19:30:21,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:21,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472903856] [2024-10-12 19:30:21,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472903856] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:30:21,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:30:21,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-12 19:30:21,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026124147] [2024-10-12 19:30:21,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:30:21,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-12 19:30:21,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:21,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-12 19:30:21,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-12 19:30:21,296 INFO L87 Difference]: Start difference. First operand 63074 states and 108593 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 19:30:25,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:25,575 INFO L93 Difference]: Finished difference Result 118342 states and 207502 transitions. [2024-10-12 19:30:25,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-12 19:30:25,576 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2024-10-12 19:30:25,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:26,160 INFO L225 Difference]: With dead ends: 118342 [2024-10-12 19:30:26,160 INFO L226 Difference]: Without dead ends: 118144 [2024-10-12 19:30:26,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-12 19:30:26,224 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 1439 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 1746 mSolverCounterSat, 556 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1457 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 556 IncrementalHoareTripleChecker+Valid, 1746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:26,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1457 Valid, 920 Invalid, 2302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [556 Valid, 1746 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-12 19:30:26,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118144 states. [2024-10-12 19:30:29,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118144 to 117960. [2024-10-12 19:30:29,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117960 states, 99318 states have (on average 1.6423004893372803) internal successors, (163110), 99325 states have internal predecessors, (163110), 18613 states have call successors, (18613), 25 states have call predecessors, (18613), 28 states have return successors, (20802), 18609 states have call predecessors, (20802), 18610 states have call successors, (20802) [2024-10-12 19:30:30,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117960 states to 117960 states and 202525 transitions. [2024-10-12 19:30:30,724 INFO L78 Accepts]: Start accepts. Automaton has 117960 states and 202525 transitions. Word has length 133 [2024-10-12 19:30:30,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 19:30:30,725 INFO L471 AbstractCegarLoop]: Abstraction has 117960 states and 202525 transitions. [2024-10-12 19:30:30,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-12 19:30:30,725 INFO L276 IsEmpty]: Start isEmpty. Operand 117960 states and 202525 transitions. [2024-10-12 19:30:30,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-12 19:30:30,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 19:30:30,795 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 19:30:30,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 19:30:30,795 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 19:30:30,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 19:30:30,796 INFO L85 PathProgramCache]: Analyzing trace with hash -675184075, now seen corresponding path program 1 times [2024-10-12 19:30:30,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 19:30:30,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911785015] [2024-10-12 19:30:30,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 19:30:30,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 19:30:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:31,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-12 19:30:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:31,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-12 19:30:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:31,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-12 19:30:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:31,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-12 19:30:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:31,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-12 19:30:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:31,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-12 19:30:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:31,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-12 19:30:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:31,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-12 19:30:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:31,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-12 19:30:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:31,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-12 19:30:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:31,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-12 19:30:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:31,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-12 19:30:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:31,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-12 19:30:31,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:31,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-12 19:30:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 19:30:31,099 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-12 19:30:31,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 19:30:31,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911785015] [2024-10-12 19:30:31,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911785015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 19:30:31,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 19:30:31,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-12 19:30:31,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172146509] [2024-10-12 19:30:31,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 19:30:31,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-12 19:30:31,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 19:30:31,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-12 19:30:31,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-12 19:30:31,102 INFO L87 Difference]: Start difference. First operand 117960 states and 202525 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-12 19:30:37,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 19:30:37,946 INFO L93 Difference]: Finished difference Result 119103 states and 207719 transitions. [2024-10-12 19:30:37,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-12 19:30:37,948 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (18), 7 states have call predecessors, (18), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 134 [2024-10-12 19:30:37,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 19:30:38,521 INFO L225 Difference]: With dead ends: 119103 [2024-10-12 19:30:38,521 INFO L226 Difference]: Without dead ends: 118912 [2024-10-12 19:30:38,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=342, Invalid=918, Unknown=0, NotChecked=0, Total=1260 [2024-10-12 19:30:38,587 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 2747 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 5481 mSolverCounterSat, 976 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2764 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 6457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 976 IncrementalHoareTripleChecker+Valid, 5481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-12 19:30:38,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2764 Valid, 1224 Invalid, 6457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [976 Valid, 5481 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-12 19:30:38,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118912 states.