/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 02:29:11,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 02:29:11,588 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 02:29:11,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 02:29:11,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 02:29:11,627 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 02:29:11,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 02:29:11,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 02:29:11,637 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 02:29:11,640 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 02:29:11,641 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 02:29:11,642 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 02:29:11,642 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 02:29:11,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 02:29:11,643 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 02:29:11,644 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 02:29:11,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 02:29:11,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 02:29:11,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 02:29:11,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 02:29:11,648 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 02:29:11,651 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 02:29:11,652 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 02:29:11,654 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 02:29:11,655 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 02:29:11,667 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 02:29:11,667 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 02:29:11,667 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 02:29:11,668 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 02:29:11,668 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 02:29:11,669 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 02:29:11,669 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 02:29:11,670 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 02:29:11,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 02:29:11,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 02:29:11,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 02:29:11,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 02:29:11,672 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 02:29:11,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 02:29:11,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 02:29:11,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 02:29:11,677 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 02:29:11,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-03-20 02:29:11,705 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 02:29:11,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 02:29:11,705 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-03-20 02:29:11,706 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-03-20 02:29:11,706 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-03-20 02:29:11,706 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-03-20 02:29:11,707 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-03-20 02:29:11,707 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-03-20 02:29:11,707 INFO L138 SettingsManager]: * Use SBE=true [2022-03-20 02:29:11,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 02:29:11,709 INFO L138 SettingsManager]: * sizeof long=4 [2022-03-20 02:29:11,709 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 02:29:11,709 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-03-20 02:29:11,709 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 02:29:11,709 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 02:29:11,710 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 02:29:11,710 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 02:29:11,711 INFO L138 SettingsManager]: * sizeof long double=12 [2022-03-20 02:29:11,711 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 02:29:11,711 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 02:29:11,711 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 02:29:11,711 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 02:29:11,711 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 02:29:11,711 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 02:29:11,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 02:29:11,712 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 02:29:11,712 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-03-20 02:29:11,712 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-03-20 02:29:11,712 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-03-20 02:29:11,712 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-03-20 02:29:11,712 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-03-20 02:29:11,712 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-03-20 02:29:11,713 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 02:29:11,713 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-03-20 02:29:11,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 02:29:11,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 02:29:11,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 02:29:11,950 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 02:29:11,950 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 02:29:11,951 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-03-20 02:29:12,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82876559/4a47855a1d294404a91c053334742a9f/FLAG6230ec7ae [2022-03-20 02:29:12,480 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 02:29:12,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-03-20 02:29:12,499 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82876559/4a47855a1d294404a91c053334742a9f/FLAG6230ec7ae [2022-03-20 02:29:12,821 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a82876559/4a47855a1d294404a91c053334742a9f [2022-03-20 02:29:12,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 02:29:12,824 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-20 02:29:12,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 02:29:12,836 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 02:29:12,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 02:29:12,839 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 02:29:12" (1/1) ... [2022-03-20 02:29:12,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@494b402b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:12, skipping insertion in model container [2022-03-20 02:29:12,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 02:29:12" (1/1) ... [2022-03-20 02:29:12,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 02:29:12,891 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 02:29:13,227 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2022-03-20 02:29:13,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 02:29:13,239 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 02:29:13,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2022-03-20 02:29:13,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 02:29:13,366 INFO L208 MainTranslator]: Completed translation [2022-03-20 02:29:13,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:13 WrapperNode [2022-03-20 02:29:13,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 02:29:13,376 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 02:29:13,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 02:29:13,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 02:29:13,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:13" (1/1) ... [2022-03-20 02:29:13,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:13" (1/1) ... [2022-03-20 02:29:13,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:13" (1/1) ... [2022-03-20 02:29:13,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:13" (1/1) ... [2022-03-20 02:29:13,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:13" (1/1) ... [2022-03-20 02:29:13,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:13" (1/1) ... [2022-03-20 02:29:13,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:13" (1/1) ... [2022-03-20 02:29:13,519 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 02:29:13,520 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 02:29:13,520 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 02:29:13,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 02:29:13,521 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:13" (1/1) ... [2022-03-20 02:29:13,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 02:29:13,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 02:29:13,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-03-20 02:29:13,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-03-20 02:29:13,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 02:29:13,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 02:29:13,596 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 02:29:13,597 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-03-20 02:29:13,598 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2022-03-20 02:29:13,598 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2022-03-20 02:29:13,598 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2022-03-20 02:29:13,598 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2022-03-20 02:29:13,598 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2022-03-20 02:29:13,598 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2022-03-20 02:29:13,598 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2022-03-20 02:29:13,598 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-03-20 02:29:13,598 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 02:29:13,598 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-03-20 02:29:13,599 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-03-20 02:29:13,599 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-03-20 02:29:13,599 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-03-20 02:29:13,599 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-03-20 02:29:13,599 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-03-20 02:29:13,599 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-03-20 02:29:13,599 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-03-20 02:29:13,599 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-03-20 02:29:13,599 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-03-20 02:29:13,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-03-20 02:29:13,600 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-03-20 02:29:13,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-03-20 02:29:13,600 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2022-03-20 02:29:13,600 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2022-03-20 02:29:13,600 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2022-03-20 02:29:13,600 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2022-03-20 02:29:13,600 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-03-20 02:29:13,600 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 02:29:13,600 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 02:29:13,600 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 02:29:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 02:29:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-03-20 02:29:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 02:29:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-03-20 02:29:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2022-03-20 02:29:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2022-03-20 02:29:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2022-03-20 02:29:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2022-03-20 02:29:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2022-03-20 02:29:13,601 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2022-03-20 02:29:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-03-20 02:29:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-03-20 02:29:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-03-20 02:29:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-03-20 02:29:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-03-20 02:29:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-03-20 02:29:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-03-20 02:29:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-03-20 02:29:13,602 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-03-20 02:29:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-03-20 02:29:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-03-20 02:29:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2022-03-20 02:29:13,603 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2022-03-20 02:29:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2022-03-20 02:29:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2022-03-20 02:29:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-03-20 02:29:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-03-20 02:29:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-03-20 02:29:13,604 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2022-03-20 02:29:13,605 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-03-20 02:29:13,605 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 02:29:13,605 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-03-20 02:29:13,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 02:29:13,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 02:29:13,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 02:29:13,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 02:29:13,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 02:29:13,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 02:29:13,873 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 02:29:13,874 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 02:29:13,910 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:13,936 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-20 02:29:13,936 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-20 02:29:13,942 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:13,950 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-20 02:29:13,950 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-20 02:29:13,954 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:14,125 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-03-20 02:29:14,125 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-03-20 02:29:14,127 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:14,176 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2022-03-20 02:29:14,176 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2022-03-20 02:29:14,185 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:14,214 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-03-20 02:29:14,214 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-03-20 02:29:14,313 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:14,319 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-20 02:29:14,319 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-20 02:29:14,319 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:14,324 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-20 02:29:14,325 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-20 02:29:14,325 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:14,337 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-20 02:29:14,337 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-20 02:29:14,367 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:14,388 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-03-20 02:29:14,388 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-03-20 02:29:14,391 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:14,500 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-03-20 02:29:14,500 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-03-20 02:29:14,533 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:14,537 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-20 02:29:14,537 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-20 02:29:14,537 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:14,542 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-20 02:29:14,542 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-20 02:29:14,542 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-03-20 02:29:14,546 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-03-20 02:29:14,546 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-03-20 02:29:14,557 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 02:29:14,566 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 02:29:14,567 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-20 02:29:14,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 02:29:14 BoogieIcfgContainer [2022-03-20 02:29:14,569 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 02:29:14,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 02:29:14,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 02:29:14,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 02:29:14,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 02:29:12" (1/3) ... [2022-03-20 02:29:14,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df4d24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 02:29:14, skipping insertion in model container [2022-03-20 02:29:14,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 02:29:13" (2/3) ... [2022-03-20 02:29:14,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@df4d24b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 02:29:14, skipping insertion in model container [2022-03-20 02:29:14,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 02:29:14" (3/3) ... [2022-03-20 02:29:14,578 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2022-03-20 02:29:14,583 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-03-20 02:29:14,584 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 02:29:14,675 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 02:29:14,682 INFO L340 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 [2022-03-20 02:29:14,682 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 02:29:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand has 389 states, 288 states have (on average 1.46875) internal successors, (423), 314 states have internal predecessors, (423), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 66 states have call predecessors, (71), 71 states have call successors, (71) [2022-03-20 02:29:14,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-03-20 02:29:14,741 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:14,742 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:14,743 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:14,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:14,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1386555085, now seen corresponding path program 1 times [2022-03-20 02:29:14,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:14,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701645351] [2022-03-20 02:29:14,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:14,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:15,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:15,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:15,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:15,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:15,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701645351] [2022-03-20 02:29:15,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701645351] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:15,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:15,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-03-20 02:29:15,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468432309] [2022-03-20 02:29:15,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:15,188 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-03-20 02:29:15,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:15,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-03-20 02:29:15,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-20 02:29:15,219 INFO L87 Difference]: Start difference. First operand has 389 states, 288 states have (on average 1.46875) internal successors, (423), 314 states have internal predecessors, (423), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 66 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 02:29:16,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:16,367 INFO L93 Difference]: Finished difference Result 666 states and 978 transitions. [2022-03-20 02:29:16,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-03-20 02:29:16,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-03-20 02:29:16,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:16,381 INFO L225 Difference]: With dead ends: 666 [2022-03-20 02:29:16,381 INFO L226 Difference]: Without dead ends: 422 [2022-03-20 02:29:16,386 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-03-20 02:29:16,389 INFO L913 BasicCegarLoop]: 496 mSDtfsCounter, 408 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:16,390 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 735 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-20 02:29:16,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-03-20 02:29:16,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380. [2022-03-20 02:29:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 282 states have (on average 1.429078014184397) internal successors, (403), 306 states have internal predecessors, (403), 71 states have call successors, (71), 28 states have call predecessors, (71), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-03-20 02:29:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2022-03-20 02:29:16,498 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2022-03-20 02:29:16,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:16,499 INFO L478 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2022-03-20 02:29:16,499 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-03-20 02:29:16,499 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2022-03-20 02:29:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-03-20 02:29:16,500 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:16,500 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:16,501 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 02:29:16,501 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:16,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:16,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1836211626, now seen corresponding path program 1 times [2022-03-20 02:29:16,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:16,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293116550] [2022-03-20 02:29:16,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:16,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:16,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:16,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:16,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:16,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:16,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293116550] [2022-03-20 02:29:16,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293116550] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:16,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:16,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 02:29:16,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567558117] [2022-03-20 02:29:16,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:16,683 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 02:29:16,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:16,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 02:29:16,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 02:29:16,684 INFO L87 Difference]: Start difference. First operand 380 states and 523 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 02:29:18,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:18,114 INFO L93 Difference]: Finished difference Result 747 states and 1022 transitions. [2022-03-20 02:29:18,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 02:29:18,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-03-20 02:29:18,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:18,122 INFO L225 Difference]: With dead ends: 747 [2022-03-20 02:29:18,122 INFO L226 Difference]: Without dead ends: 584 [2022-03-20 02:29:18,126 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-20 02:29:18,127 INFO L913 BasicCegarLoop]: 634 mSDtfsCounter, 717 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:18,128 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [723 Valid, 892 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-20 02:29:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-03-20 02:29:18,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 525. [2022-03-20 02:29:18,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 405 states have (on average 1.3530864197530865) internal successors, (548), 410 states have internal predecessors, (548), 78 states have call successors, (78), 41 states have call predecessors, (78), 41 states have return successors, (90), 75 states have call predecessors, (90), 66 states have call successors, (90) [2022-03-20 02:29:18,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 716 transitions. [2022-03-20 02:29:18,175 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 716 transitions. Word has length 25 [2022-03-20 02:29:18,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:18,176 INFO L478 AbstractCegarLoop]: Abstraction has 525 states and 716 transitions. [2022-03-20 02:29:18,177 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 02:29:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 716 transitions. [2022-03-20 02:29:18,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-03-20 02:29:18,178 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:18,179 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:18,179 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-03-20 02:29:18,179 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:18,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:18,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1775067862, now seen corresponding path program 1 times [2022-03-20 02:29:18,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:18,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578946819] [2022-03-20 02:29:18,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:18,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:18,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:18,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:18,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:18,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:18,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:18,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578946819] [2022-03-20 02:29:18,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578946819] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:18,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:18,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 02:29:18,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943946955] [2022-03-20 02:29:18,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:18,378 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 02:29:18,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:18,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 02:29:18,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 02:29:18,379 INFO L87 Difference]: Start difference. First operand 525 states and 716 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 02:29:19,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:19,137 INFO L93 Difference]: Finished difference Result 695 states and 934 transitions. [2022-03-20 02:29:19,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 02:29:19,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-03-20 02:29:19,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:19,143 INFO L225 Difference]: With dead ends: 695 [2022-03-20 02:29:19,143 INFO L226 Difference]: Without dead ends: 676 [2022-03-20 02:29:19,144 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-20 02:29:19,149 INFO L913 BasicCegarLoop]: 459 mSDtfsCounter, 946 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 953 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:19,150 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [953 Valid, 603 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-20 02:29:19,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-03-20 02:29:19,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 583. [2022-03-20 02:29:19,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 450 states have (on average 1.3488888888888888) internal successors, (607), 463 states have internal predecessors, (607), 82 states have call successors, (82), 46 states have call predecessors, (82), 50 states have return successors, (101), 78 states have call predecessors, (101), 72 states have call successors, (101) [2022-03-20 02:29:19,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 790 transitions. [2022-03-20 02:29:19,208 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 790 transitions. Word has length 31 [2022-03-20 02:29:19,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:19,208 INFO L478 AbstractCegarLoop]: Abstraction has 583 states and 790 transitions. [2022-03-20 02:29:19,208 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 02:29:19,209 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 790 transitions. [2022-03-20 02:29:19,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-03-20 02:29:19,214 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:19,214 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:19,214 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-03-20 02:29:19,215 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:19,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:19,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1405496584, now seen corresponding path program 1 times [2022-03-20 02:29:19,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:19,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256162908] [2022-03-20 02:29:19,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:19,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:19,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:19,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:19,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:19,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:19,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:19,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256162908] [2022-03-20 02:29:19,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256162908] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:19,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:19,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 02:29:19,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77952809] [2022-03-20 02:29:19,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:19,395 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 02:29:19,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:19,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 02:29:19,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 02:29:19,396 INFO L87 Difference]: Start difference. First operand 583 states and 790 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 02:29:20,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:20,622 INFO L93 Difference]: Finished difference Result 1117 states and 1501 transitions. [2022-03-20 02:29:20,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 02:29:20,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-03-20 02:29:20,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:20,630 INFO L225 Difference]: With dead ends: 1117 [2022-03-20 02:29:20,631 INFO L226 Difference]: Without dead ends: 819 [2022-03-20 02:29:20,632 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-03-20 02:29:20,633 INFO L913 BasicCegarLoop]: 541 mSDtfsCounter, 724 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:20,633 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [732 Valid, 744 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-20 02:29:20,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2022-03-20 02:29:20,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 771. [2022-03-20 02:29:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 606 states have (on average 1.33993399339934) internal successors, (812), 616 states have internal predecessors, (812), 99 states have call successors, (99), 61 states have call predecessors, (99), 65 states have return successors, (136), 97 states have call predecessors, (136), 91 states have call successors, (136) [2022-03-20 02:29:20,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1047 transitions. [2022-03-20 02:29:20,714 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1047 transitions. Word has length 33 [2022-03-20 02:29:20,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:20,714 INFO L478 AbstractCegarLoop]: Abstraction has 771 states and 1047 transitions. [2022-03-20 02:29:20,714 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 02:29:20,715 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1047 transitions. [2022-03-20 02:29:20,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-20 02:29:20,716 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:20,716 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:20,716 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-03-20 02:29:20,716 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:20,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:20,717 INFO L85 PathProgramCache]: Analyzing trace with hash -918102906, now seen corresponding path program 1 times [2022-03-20 02:29:20,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:20,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046607858] [2022-03-20 02:29:20,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:20,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:20,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:20,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:20,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:20,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-03-20 02:29:20,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:20,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:20,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:20,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:20,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046607858] [2022-03-20 02:29:20,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046607858] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:20,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:20,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 02:29:20,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364618262] [2022-03-20 02:29:20,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:20,866 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 02:29:20,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:20,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 02:29:20,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-20 02:29:20,867 INFO L87 Difference]: Start difference. First operand 771 states and 1047 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:29:22,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:22,014 INFO L93 Difference]: Finished difference Result 865 states and 1163 transitions. [2022-03-20 02:29:22,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 02:29:22,015 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 39 [2022-03-20 02:29:22,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:22,024 INFO L225 Difference]: With dead ends: 865 [2022-03-20 02:29:22,025 INFO L226 Difference]: Without dead ends: 860 [2022-03-20 02:29:22,025 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-03-20 02:29:22,026 INFO L913 BasicCegarLoop]: 476 mSDtfsCounter, 516 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:22,026 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [517 Valid, 945 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-20 02:29:22,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-03-20 02:29:22,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 808. [2022-03-20 02:29:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 636 states have (on average 1.3333333333333333) internal successors, (848), 648 states have internal predecessors, (848), 99 states have call successors, (99), 61 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2022-03-20 02:29:22,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1090 transitions. [2022-03-20 02:29:22,081 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1090 transitions. Word has length 39 [2022-03-20 02:29:22,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:22,083 INFO L478 AbstractCegarLoop]: Abstraction has 808 states and 1090 transitions. [2022-03-20 02:29:22,083 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:29:22,084 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1090 transitions. [2022-03-20 02:29:22,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-03-20 02:29:22,084 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:22,086 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:22,086 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-03-20 02:29:22,087 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:22,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:22,088 INFO L85 PathProgramCache]: Analyzing trace with hash 726893149, now seen corresponding path program 1 times [2022-03-20 02:29:22,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:22,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850513723] [2022-03-20 02:29:22,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:22,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:22,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:22,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:22,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:22,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:22,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850513723] [2022-03-20 02:29:22,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850513723] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:22,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:22,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 02:29:22,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335934064] [2022-03-20 02:29:22,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:22,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 02:29:22,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:22,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 02:29:22,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-03-20 02:29:22,253 INFO L87 Difference]: Start difference. First operand 808 states and 1090 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 02:29:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:23,415 INFO L93 Difference]: Finished difference Result 842 states and 1132 transitions. [2022-03-20 02:29:23,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 02:29:23,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-03-20 02:29:23,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:23,420 INFO L225 Difference]: With dead ends: 842 [2022-03-20 02:29:23,420 INFO L226 Difference]: Without dead ends: 839 [2022-03-20 02:29:23,420 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-03-20 02:29:23,421 INFO L913 BasicCegarLoop]: 467 mSDtfsCounter, 256 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:23,421 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 743 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-20 02:29:23,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-03-20 02:29:23,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 819. [2022-03-20 02:29:23,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.3323029366306027) internal successors, (862), 658 states have internal predecessors, (862), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2022-03-20 02:29:23,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1104 transitions. [2022-03-20 02:29:23,471 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1104 transitions. Word has length 38 [2022-03-20 02:29:23,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:23,471 INFO L478 AbstractCegarLoop]: Abstraction has 819 states and 1104 transitions. [2022-03-20 02:29:23,471 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 02:29:23,472 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1104 transitions. [2022-03-20 02:29:23,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-20 02:29:23,472 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:23,473 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:23,473 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-03-20 02:29:23,473 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:23,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:23,473 INFO L85 PathProgramCache]: Analyzing trace with hash 2055229827, now seen corresponding path program 1 times [2022-03-20 02:29:23,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:23,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759344965] [2022-03-20 02:29:23,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:23,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:23,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:23,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:23,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:23,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-03-20 02:29:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:23,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:23,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:23,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759344965] [2022-03-20 02:29:23,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759344965] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:23,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:23,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 02:29:23,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825025882] [2022-03-20 02:29:23,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:23,766 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 02:29:23,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:23,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 02:29:23,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:23,767 INFO L87 Difference]: Start difference. First operand 819 states and 1104 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 02:29:25,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:25,751 INFO L93 Difference]: Finished difference Result 877 states and 1176 transitions. [2022-03-20 02:29:25,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 02:29:25,752 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2022-03-20 02:29:25,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:25,755 INFO L225 Difference]: With dead ends: 877 [2022-03-20 02:29:25,756 INFO L226 Difference]: Without dead ends: 871 [2022-03-20 02:29:25,756 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2022-03-20 02:29:25,760 INFO L913 BasicCegarLoop]: 455 mSDtfsCounter, 1349 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 2031 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1364 SdHoareTripleChecker+Valid, 1168 SdHoareTripleChecker+Invalid, 2390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 2031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:25,760 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1364 Valid, 1168 Invalid, 2390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 2031 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-03-20 02:29:25,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-03-20 02:29:25,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2022-03-20 02:29:25,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.330757341576507) internal successors, (861), 658 states have internal predecessors, (861), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2022-03-20 02:29:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1103 transitions. [2022-03-20 02:29:25,818 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1103 transitions. Word has length 40 [2022-03-20 02:29:25,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:25,818 INFO L478 AbstractCegarLoop]: Abstraction has 819 states and 1103 transitions. [2022-03-20 02:29:25,819 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 02:29:25,819 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1103 transitions. [2022-03-20 02:29:25,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-03-20 02:29:25,820 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:25,821 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:25,821 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-03-20 02:29:25,821 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:25,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:25,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1850451194, now seen corresponding path program 1 times [2022-03-20 02:29:25,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:25,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116236310] [2022-03-20 02:29:25,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:25,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:25,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:25,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:25,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:25,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:25,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-03-20 02:29:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:26,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:26,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:26,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:26,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116236310] [2022-03-20 02:29:26,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116236310] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:26,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:26,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 02:29:26,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904463823] [2022-03-20 02:29:26,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:26,047 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 02:29:26,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:26,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 02:29:26,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:26,048 INFO L87 Difference]: Start difference. First operand 819 states and 1103 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 02:29:27,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:27,687 INFO L93 Difference]: Finished difference Result 877 states and 1175 transitions. [2022-03-20 02:29:27,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 02:29:27,688 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2022-03-20 02:29:27,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:27,695 INFO L225 Difference]: With dead ends: 877 [2022-03-20 02:29:27,695 INFO L226 Difference]: Without dead ends: 871 [2022-03-20 02:29:27,696 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2022-03-20 02:29:27,696 INFO L913 BasicCegarLoop]: 456 mSDtfsCounter, 1635 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1650 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 478 IncrementalHoareTripleChecker+Valid, 1346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:27,697 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1650 Valid, 885 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [478 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-20 02:29:27,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-03-20 02:29:27,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2022-03-20 02:29:27,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.3292117465224111) internal successors, (860), 658 states have internal predecessors, (860), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2022-03-20 02:29:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1102 transitions. [2022-03-20 02:29:27,758 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1102 transitions. Word has length 40 [2022-03-20 02:29:27,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:27,759 INFO L478 AbstractCegarLoop]: Abstraction has 819 states and 1102 transitions. [2022-03-20 02:29:27,759 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 02:29:27,759 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1102 transitions. [2022-03-20 02:29:27,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-20 02:29:27,760 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:27,760 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:27,761 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-03-20 02:29:27,761 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:27,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:27,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1612959141, now seen corresponding path program 1 times [2022-03-20 02:29:27,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:27,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820282002] [2022-03-20 02:29:27,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:27,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:27,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:27,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:27,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:27,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-03-20 02:29:27,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:27,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:27,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:27,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:27,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820282002] [2022-03-20 02:29:27,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820282002] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:27,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:27,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 02:29:27,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443256949] [2022-03-20 02:29:27,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:27,946 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 02:29:27,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:27,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 02:29:27,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-03-20 02:29:27,947 INFO L87 Difference]: Start difference. First operand 819 states and 1102 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:29:29,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:29,201 INFO L93 Difference]: Finished difference Result 882 states and 1180 transitions. [2022-03-20 02:29:29,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 02:29:29,202 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2022-03-20 02:29:29,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:29,206 INFO L225 Difference]: With dead ends: 882 [2022-03-20 02:29:29,206 INFO L226 Difference]: Without dead ends: 867 [2022-03-20 02:29:29,206 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:29,207 INFO L913 BasicCegarLoop]: 479 mSDtfsCounter, 671 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:29,207 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [680 Valid, 1258 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-20 02:29:29,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2022-03-20 02:29:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 817. [2022-03-20 02:29:29,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 646 states have (on average 1.328173374613003) internal successors, (858), 657 states have internal predecessors, (858), 98 states have call successors, (98), 62 states have call predecessors, (98), 72 states have return successors, (142), 99 states have call predecessors, (142), 90 states have call successors, (142) [2022-03-20 02:29:29,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1098 transitions. [2022-03-20 02:29:29,262 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1098 transitions. Word has length 41 [2022-03-20 02:29:29,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:29,262 INFO L478 AbstractCegarLoop]: Abstraction has 817 states and 1098 transitions. [2022-03-20 02:29:29,263 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:29:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1098 transitions. [2022-03-20 02:29:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-20 02:29:29,264 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:29,264 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:29,264 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-03-20 02:29:29,264 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:29,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:29,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1434972884, now seen corresponding path program 1 times [2022-03-20 02:29:29,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:29,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080876976] [2022-03-20 02:29:29,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:29,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:29,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:29,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:29,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:29,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-03-20 02:29:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:29,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:29:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:29,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:29,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:29,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080876976] [2022-03-20 02:29:29,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080876976] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:29,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:29,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 02:29:29,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238019495] [2022-03-20 02:29:29,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:29,456 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 02:29:29,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:29,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 02:29:29,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-03-20 02:29:29,457 INFO L87 Difference]: Start difference. First operand 817 states and 1098 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:29:30,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:30,626 INFO L93 Difference]: Finished difference Result 880 states and 1176 transitions. [2022-03-20 02:29:30,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 02:29:30,626 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2022-03-20 02:29:30,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:30,630 INFO L225 Difference]: With dead ends: 880 [2022-03-20 02:29:30,631 INFO L226 Difference]: Without dead ends: 860 [2022-03-20 02:29:30,631 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:30,632 INFO L913 BasicCegarLoop]: 475 mSDtfsCounter, 515 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1301 SdHoareTripleChecker+Invalid, 1855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:30,632 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 1301 Invalid, 1855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-20 02:29:30,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-03-20 02:29:30,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 810. [2022-03-20 02:29:30,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 642 states have (on average 1.3286604361370717) internal successors, (853), 653 states have internal predecessors, (853), 96 states have call successors, (96), 61 states have call predecessors, (96), 71 states have return successors, (140), 97 states have call predecessors, (140), 88 states have call successors, (140) [2022-03-20 02:29:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1089 transitions. [2022-03-20 02:29:30,685 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1089 transitions. Word has length 42 [2022-03-20 02:29:30,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:30,685 INFO L478 AbstractCegarLoop]: Abstraction has 810 states and 1089 transitions. [2022-03-20 02:29:30,685 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:29:30,685 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1089 transitions. [2022-03-20 02:29:30,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-03-20 02:29:30,686 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:30,686 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:30,686 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-03-20 02:29:30,687 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:30,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:30,687 INFO L85 PathProgramCache]: Analyzing trace with hash 2069240196, now seen corresponding path program 1 times [2022-03-20 02:29:30,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:30,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958708048] [2022-03-20 02:29:30,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:30,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:30,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:30,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:30,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:30,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:30,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 02:29:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:30,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:30,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:30,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958708048] [2022-03-20 02:29:30,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958708048] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:30,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:30,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 02:29:30,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198315940] [2022-03-20 02:29:30,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:30,898 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 02:29:30,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:30,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 02:29:30,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-20 02:29:30,898 INFO L87 Difference]: Start difference. First operand 810 states and 1089 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-03-20 02:29:32,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:32,059 INFO L93 Difference]: Finished difference Result 857 states and 1144 transitions. [2022-03-20 02:29:32,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 02:29:32,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2022-03-20 02:29:32,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:32,063 INFO L225 Difference]: With dead ends: 857 [2022-03-20 02:29:32,064 INFO L226 Difference]: Without dead ends: 835 [2022-03-20 02:29:32,064 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:32,065 INFO L913 BasicCegarLoop]: 456 mSDtfsCounter, 391 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 1509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:32,065 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 1012 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-20 02:29:32,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-03-20 02:29:32,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 812. [2022-03-20 02:29:32,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 644 states have (on average 1.3276397515527951) internal successors, (855), 655 states have internal predecessors, (855), 96 states have call successors, (96), 61 states have call predecessors, (96), 71 states have return successors, (140), 97 states have call predecessors, (140), 88 states have call successors, (140) [2022-03-20 02:29:32,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1091 transitions. [2022-03-20 02:29:32,121 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1091 transitions. Word has length 42 [2022-03-20 02:29:32,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:32,121 INFO L478 AbstractCegarLoop]: Abstraction has 812 states and 1091 transitions. [2022-03-20 02:29:32,121 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-03-20 02:29:32,121 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1091 transitions. [2022-03-20 02:29:32,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-03-20 02:29:32,122 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:32,123 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:32,123 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-03-20 02:29:32,123 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:32,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:32,123 INFO L85 PathProgramCache]: Analyzing trace with hash -289846458, now seen corresponding path program 1 times [2022-03-20 02:29:32,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:32,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077133832] [2022-03-20 02:29:32,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:32,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:32,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:32,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:32,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:32,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-03-20 02:29:32,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:32,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:32,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:32,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077133832] [2022-03-20 02:29:32,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077133832] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:32,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:32,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 02:29:32,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220839315] [2022-03-20 02:29:32,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:32,300 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 02:29:32,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:32,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 02:29:32,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-03-20 02:29:32,301 INFO L87 Difference]: Start difference. First operand 812 states and 1091 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-03-20 02:29:33,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:33,610 INFO L93 Difference]: Finished difference Result 908 states and 1209 transitions. [2022-03-20 02:29:33,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 02:29:33,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-03-20 02:29:33,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:33,615 INFO L225 Difference]: With dead ends: 908 [2022-03-20 02:29:33,615 INFO L226 Difference]: Without dead ends: 840 [2022-03-20 02:29:33,616 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:33,616 INFO L913 BasicCegarLoop]: 432 mSDtfsCounter, 378 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1868 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:33,616 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 914 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1868 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-20 02:29:33,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-03-20 02:29:33,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 816. [2022-03-20 02:29:33,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 647 states have (on average 1.3261205564142196) internal successors, (858), 658 states have internal predecessors, (858), 96 states have call successors, (96), 61 states have call predecessors, (96), 72 states have return successors, (142), 98 states have call predecessors, (142), 88 states have call successors, (142) [2022-03-20 02:29:33,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2022-03-20 02:29:33,669 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 44 [2022-03-20 02:29:33,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:33,669 INFO L478 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2022-03-20 02:29:33,669 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-03-20 02:29:33,669 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2022-03-20 02:29:33,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-03-20 02:29:33,670 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:33,670 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:33,671 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-03-20 02:29:33,671 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:33,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:33,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1666051445, now seen corresponding path program 1 times [2022-03-20 02:29:33,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:33,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851102971] [2022-03-20 02:29:33,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:33,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:33,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:33,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:33,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:33,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:33,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 02:29:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:33,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:33,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:33,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851102971] [2022-03-20 02:29:33,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851102971] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:33,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:33,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 02:29:33,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653183265] [2022-03-20 02:29:33,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:33,843 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 02:29:33,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:33,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 02:29:33,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-20 02:29:33,844 INFO L87 Difference]: Start difference. First operand 816 states and 1096 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-03-20 02:29:35,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:35,115 INFO L93 Difference]: Finished difference Result 860 states and 1147 transitions. [2022-03-20 02:29:35,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 02:29:35,116 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-03-20 02:29:35,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:35,120 INFO L225 Difference]: With dead ends: 860 [2022-03-20 02:29:35,120 INFO L226 Difference]: Without dead ends: 838 [2022-03-20 02:29:35,120 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-03-20 02:29:35,121 INFO L913 BasicCegarLoop]: 458 mSDtfsCounter, 295 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:35,121 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [300 Valid, 1001 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-20 02:29:35,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-03-20 02:29:35,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 816. [2022-03-20 02:29:35,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 647 states have (on average 1.3261205564142196) internal successors, (858), 658 states have internal predecessors, (858), 96 states have call successors, (96), 61 states have call predecessors, (96), 72 states have return successors, (142), 98 states have call predecessors, (142), 88 states have call successors, (142) [2022-03-20 02:29:35,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2022-03-20 02:29:35,175 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 43 [2022-03-20 02:29:35,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:35,176 INFO L478 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2022-03-20 02:29:35,176 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-03-20 02:29:35,176 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2022-03-20 02:29:35,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-03-20 02:29:35,177 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:35,177 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:35,177 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-03-20 02:29:35,178 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:35,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:35,178 INFO L85 PathProgramCache]: Analyzing trace with hash -233101078, now seen corresponding path program 1 times [2022-03-20 02:29:35,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:35,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657507443] [2022-03-20 02:29:35,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:35,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:35,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:35,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:35,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:35,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 02:29:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:35,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-03-20 02:29:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:35,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:35,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:35,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657507443] [2022-03-20 02:29:35,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657507443] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:35,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:35,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 02:29:35,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792790770] [2022-03-20 02:29:35,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:35,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 02:29:35,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:35,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 02:29:35,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-03-20 02:29:35,355 INFO L87 Difference]: Start difference. First operand 816 states and 1096 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:29:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:36,378 INFO L93 Difference]: Finished difference Result 861 states and 1149 transitions. [2022-03-20 02:29:36,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 02:29:36,378 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2022-03-20 02:29:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:36,382 INFO L225 Difference]: With dead ends: 861 [2022-03-20 02:29:36,382 INFO L226 Difference]: Without dead ends: 843 [2022-03-20 02:29:36,383 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-03-20 02:29:36,383 INFO L913 BasicCegarLoop]: 457 mSDtfsCounter, 784 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:36,384 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [788 Valid, 1326 Invalid, 1752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-20 02:29:36,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-03-20 02:29:36,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 814. [2022-03-20 02:29:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 646 states have (on average 1.325077399380805) internal successors, (856), 657 states have internal predecessors, (856), 95 states have call successors, (95), 61 states have call predecessors, (95), 72 states have return successors, (141), 97 states have call predecessors, (141), 87 states have call successors, (141) [2022-03-20 02:29:36,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1092 transitions. [2022-03-20 02:29:36,438 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1092 transitions. Word has length 45 [2022-03-20 02:29:36,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:36,438 INFO L478 AbstractCegarLoop]: Abstraction has 814 states and 1092 transitions. [2022-03-20 02:29:36,438 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:29:36,438 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1092 transitions. [2022-03-20 02:29:36,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-03-20 02:29:36,439 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:36,439 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:36,439 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-03-20 02:29:36,440 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:36,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:36,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1086119000, now seen corresponding path program 1 times [2022-03-20 02:29:36,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:36,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653362770] [2022-03-20 02:29:36,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:36,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:36,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:36,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:36,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:36,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 02:29:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:36,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-03-20 02:29:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:36,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:36,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653362770] [2022-03-20 02:29:36,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653362770] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:36,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:36,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 02:29:36,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449105170] [2022-03-20 02:29:36,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:36,619 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 02:29:36,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:36,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 02:29:36,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-03-20 02:29:36,620 INFO L87 Difference]: Start difference. First operand 814 states and 1092 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:29:37,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:37,656 INFO L93 Difference]: Finished difference Result 880 states and 1173 transitions. [2022-03-20 02:29:37,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 02:29:37,657 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2022-03-20 02:29:37,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:37,660 INFO L225 Difference]: With dead ends: 880 [2022-03-20 02:29:37,660 INFO L226 Difference]: Without dead ends: 804 [2022-03-20 02:29:37,661 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-03-20 02:29:37,661 INFO L913 BasicCegarLoop]: 486 mSDtfsCounter, 730 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 1278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:37,662 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [734 Valid, 878 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-20 02:29:37,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-03-20 02:29:37,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 775. [2022-03-20 02:29:37,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 616 states have (on average 1.3246753246753247) internal successors, (816), 628 states have internal predecessors, (816), 93 states have call successors, (93), 60 states have call predecessors, (93), 65 states have return successors, (132), 88 states have call predecessors, (132), 85 states have call successors, (132) [2022-03-20 02:29:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1041 transitions. [2022-03-20 02:29:37,710 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1041 transitions. Word has length 46 [2022-03-20 02:29:37,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:37,711 INFO L478 AbstractCegarLoop]: Abstraction has 775 states and 1041 transitions. [2022-03-20 02:29:37,711 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:29:37,711 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-03-20 02:29:37,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-03-20 02:29:37,712 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:37,712 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:37,712 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-03-20 02:29:37,712 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:37,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:37,713 INFO L85 PathProgramCache]: Analyzing trace with hash 380283320, now seen corresponding path program 1 times [2022-03-20 02:29:37,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:37,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123379503] [2022-03-20 02:29:37,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:37,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:37,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:37,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:37,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:37,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-03-20 02:29:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:37,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:37,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:37,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123379503] [2022-03-20 02:29:37,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123379503] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:37,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:37,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-03-20 02:29:37,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515844570] [2022-03-20 02:29:37,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:37,841 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-03-20 02:29:37,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:37,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-03-20 02:29:37,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-03-20 02:29:37,842 INFO L87 Difference]: Start difference. First operand 775 states and 1041 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-03-20 02:29:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:38,987 INFO L93 Difference]: Finished difference Result 1134 states and 1535 transitions. [2022-03-20 02:29:38,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 02:29:38,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2022-03-20 02:29:38,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:38,992 INFO L225 Difference]: With dead ends: 1134 [2022-03-20 02:29:38,992 INFO L226 Difference]: Without dead ends: 1131 [2022-03-20 02:29:38,993 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-03-20 02:29:38,993 INFO L913 BasicCegarLoop]: 533 mSDtfsCounter, 583 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:38,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [600 Valid, 782 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-20 02:29:38,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2022-03-20 02:29:39,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 888. [2022-03-20 02:29:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 707 states have (on average 1.3295615275813295) internal successors, (940), 721 states have internal predecessors, (940), 103 states have call successors, (103), 70 states have call predecessors, (103), 77 states have return successors, (152), 98 states have call predecessors, (152), 95 states have call successors, (152) [2022-03-20 02:29:39,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1195 transitions. [2022-03-20 02:29:39,082 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1195 transitions. Word has length 47 [2022-03-20 02:29:39,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:39,082 INFO L478 AbstractCegarLoop]: Abstraction has 888 states and 1195 transitions. [2022-03-20 02:29:39,083 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-03-20 02:29:39,083 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1195 transitions. [2022-03-20 02:29:39,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-03-20 02:29:39,084 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:39,099 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:39,099 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-03-20 02:29:39,100 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:39,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:39,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1845769478, now seen corresponding path program 1 times [2022-03-20 02:29:39,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:39,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750591537] [2022-03-20 02:29:39,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:39,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:39,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:29:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 02:29:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:39,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:39,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:39,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750591537] [2022-03-20 02:29:39,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750591537] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:39,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:39,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 02:29:39,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587006790] [2022-03-20 02:29:39,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:39,285 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 02:29:39,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:39,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 02:29:39,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-03-20 02:29:39,286 INFO L87 Difference]: Start difference. First operand 888 states and 1195 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:29:40,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:40,591 INFO L93 Difference]: Finished difference Result 933 states and 1248 transitions. [2022-03-20 02:29:40,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-03-20 02:29:40,591 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-03-20 02:29:40,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:40,595 INFO L225 Difference]: With dead ends: 933 [2022-03-20 02:29:40,595 INFO L226 Difference]: Without dead ends: 915 [2022-03-20 02:29:40,596 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-03-20 02:29:40,596 INFO L913 BasicCegarLoop]: 448 mSDtfsCounter, 308 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:40,597 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 1261 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-20 02:29:40,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2022-03-20 02:29:40,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 886. [2022-03-20 02:29:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 706 states have (on average 1.3286118980169972) internal successors, (938), 720 states have internal predecessors, (938), 102 states have call successors, (102), 70 states have call predecessors, (102), 77 states have return successors, (151), 97 states have call predecessors, (151), 94 states have call successors, (151) [2022-03-20 02:29:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1191 transitions. [2022-03-20 02:29:40,684 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1191 transitions. Word has length 47 [2022-03-20 02:29:40,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:40,684 INFO L478 AbstractCegarLoop]: Abstraction has 886 states and 1191 transitions. [2022-03-20 02:29:40,685 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:29:40,685 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1191 transitions. [2022-03-20 02:29:40,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-20 02:29:40,686 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:40,686 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:40,686 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-03-20 02:29:40,686 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:40,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:40,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1334176634, now seen corresponding path program 1 times [2022-03-20 02:29:40,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:40,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95187559] [2022-03-20 02:29:40,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:40,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:40,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:40,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:40,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:40,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-03-20 02:29:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:40,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:40,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:40,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95187559] [2022-03-20 02:29:40,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95187559] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:40,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:40,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 02:29:40,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106648161] [2022-03-20 02:29:40,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:40,895 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 02:29:40,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:40,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 02:29:40,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-03-20 02:29:40,896 INFO L87 Difference]: Start difference. First operand 886 states and 1191 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-03-20 02:29:42,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:42,587 INFO L93 Difference]: Finished difference Result 1483 states and 1950 transitions. [2022-03-20 02:29:42,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 02:29:42,588 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2022-03-20 02:29:42,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:42,592 INFO L225 Difference]: With dead ends: 1483 [2022-03-20 02:29:42,593 INFO L226 Difference]: Without dead ends: 936 [2022-03-20 02:29:42,597 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-03-20 02:29:42,598 INFO L913 BasicCegarLoop]: 558 mSDtfsCounter, 1837 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 1227 mSolverCounterSat, 568 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1849 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 568 IncrementalHoareTripleChecker+Valid, 1227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:42,600 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1849 Valid, 784 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [568 Valid, 1227 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-20 02:29:42,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2022-03-20 02:29:42,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 877. [2022-03-20 02:29:42,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 697 states have (on average 1.3156384505021521) internal successors, (917), 711 states have internal predecessors, (917), 102 states have call successors, (102), 70 states have call predecessors, (102), 77 states have return successors, (151), 97 states have call predecessors, (151), 94 states have call successors, (151) [2022-03-20 02:29:42,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1170 transitions. [2022-03-20 02:29:42,678 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1170 transitions. Word has length 48 [2022-03-20 02:29:42,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:42,678 INFO L478 AbstractCegarLoop]: Abstraction has 877 states and 1170 transitions. [2022-03-20 02:29:42,678 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-03-20 02:29:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1170 transitions. [2022-03-20 02:29:42,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-20 02:29:42,679 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:42,679 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:42,679 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-03-20 02:29:42,680 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:42,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:42,680 INFO L85 PathProgramCache]: Analyzing trace with hash -934618588, now seen corresponding path program 1 times [2022-03-20 02:29:42,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:42,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081524847] [2022-03-20 02:29:42,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:42,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:42,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:42,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:42,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:42,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:42,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 02:29:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:42,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:42,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:42,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:42,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081524847] [2022-03-20 02:29:42,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081524847] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:42,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:42,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 02:29:42,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944971838] [2022-03-20 02:29:42,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:42,890 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 02:29:42,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:42,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 02:29:42,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:29:42,892 INFO L87 Difference]: Start difference. First operand 877 states and 1170 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 02:29:44,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:44,475 INFO L93 Difference]: Finished difference Result 1151 states and 1528 transitions. [2022-03-20 02:29:44,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-03-20 02:29:44,475 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-03-20 02:29:44,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:44,480 INFO L225 Difference]: With dead ends: 1151 [2022-03-20 02:29:44,480 INFO L226 Difference]: Without dead ends: 1075 [2022-03-20 02:29:44,481 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2022-03-20 02:29:44,482 INFO L913 BasicCegarLoop]: 545 mSDtfsCounter, 1640 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1643 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 2187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:44,482 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1643 Valid, 1333 Invalid, 2187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 1669 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-20 02:29:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2022-03-20 02:29:44,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 932. [2022-03-20 02:29:44,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.3090418353576248) internal successors, (970), 757 states have internal predecessors, (970), 105 states have call successors, (105), 71 states have call predecessors, (105), 85 states have return successors, (168), 104 states have call predecessors, (168), 97 states have call successors, (168) [2022-03-20 02:29:44,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1243 transitions. [2022-03-20 02:29:44,559 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1243 transitions. Word has length 50 [2022-03-20 02:29:44,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:44,560 INFO L478 AbstractCegarLoop]: Abstraction has 932 states and 1243 transitions. [2022-03-20 02:29:44,560 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 02:29:44,560 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1243 transitions. [2022-03-20 02:29:44,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-03-20 02:29:44,561 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:44,561 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:44,561 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-03-20 02:29:44,561 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:44,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:44,562 INFO L85 PathProgramCache]: Analyzing trace with hash -550624226, now seen corresponding path program 1 times [2022-03-20 02:29:44,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:44,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591111701] [2022-03-20 02:29:44,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:44,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:44,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:44,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:44,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:44,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:44,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 02:29:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:44,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-20 02:29:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:44,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:44,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:44,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591111701] [2022-03-20 02:29:44,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591111701] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:44,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:44,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 02:29:44,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287916794] [2022-03-20 02:29:44,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:44,765 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 02:29:44,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:44,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 02:29:44,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-20 02:29:44,766 INFO L87 Difference]: Start difference. First operand 932 states and 1243 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 02:29:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:45,818 INFO L93 Difference]: Finished difference Result 979 states and 1296 transitions. [2022-03-20 02:29:45,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 02:29:45,819 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-03-20 02:29:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:45,822 INFO L225 Difference]: With dead ends: 979 [2022-03-20 02:29:45,822 INFO L226 Difference]: Without dead ends: 959 [2022-03-20 02:29:45,822 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-03-20 02:29:45,823 INFO L913 BasicCegarLoop]: 442 mSDtfsCounter, 620 mSDsluCounter, 1031 mSDsCounter, 0 mSdLazyCounter, 1750 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 1473 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:45,823 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [624 Valid, 1473 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1750 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-20 02:29:45,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-03-20 02:29:45,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 932. [2022-03-20 02:29:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.2928475033738192) internal successors, (958), 757 states have internal predecessors, (958), 105 states have call successors, (105), 71 states have call predecessors, (105), 85 states have return successors, (168), 104 states have call predecessors, (168), 97 states have call successors, (168) [2022-03-20 02:29:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1231 transitions. [2022-03-20 02:29:45,898 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1231 transitions. Word has length 50 [2022-03-20 02:29:45,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:45,899 INFO L478 AbstractCegarLoop]: Abstraction has 932 states and 1231 transitions. [2022-03-20 02:29:45,899 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 02:29:45,899 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1231 transitions. [2022-03-20 02:29:45,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-20 02:29:45,900 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:45,900 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:45,900 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-03-20 02:29:45,900 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:45,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:45,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1358171884, now seen corresponding path program 1 times [2022-03-20 02:29:45,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:45,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900491527] [2022-03-20 02:29:45,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:45,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:45,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:45,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:46,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:46,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:46,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-03-20 02:29:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:46,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:46,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900491527] [2022-03-20 02:29:46,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900491527] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:46,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:46,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 02:29:46,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743221553] [2022-03-20 02:29:46,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:46,035 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 02:29:46,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:46,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 02:29:46,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-03-20 02:29:46,036 INFO L87 Difference]: Start difference. First operand 932 states and 1231 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-20 02:29:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:47,042 INFO L93 Difference]: Finished difference Result 1041 states and 1345 transitions. [2022-03-20 02:29:47,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 02:29:47,044 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2022-03-20 02:29:47,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:47,046 INFO L225 Difference]: With dead ends: 1041 [2022-03-20 02:29:47,046 INFO L226 Difference]: Without dead ends: 685 [2022-03-20 02:29:47,047 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-03-20 02:29:47,048 INFO L913 BasicCegarLoop]: 470 mSDtfsCounter, 747 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:47,048 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [756 Valid, 814 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-20 02:29:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-03-20 02:29:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 623. [2022-03-20 02:29:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 498 states have (on average 1.2751004016064258) internal successors, (635), 509 states have internal predecessors, (635), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 68 states have call predecessors, (85), 63 states have call successors, (85) [2022-03-20 02:29:47,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 791 transitions. [2022-03-20 02:29:47,104 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 791 transitions. Word has length 52 [2022-03-20 02:29:47,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:47,104 INFO L478 AbstractCegarLoop]: Abstraction has 623 states and 791 transitions. [2022-03-20 02:29:47,105 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-03-20 02:29:47,105 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 791 transitions. [2022-03-20 02:29:47,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-20 02:29:47,106 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:47,106 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:47,106 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-03-20 02:29:47,106 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:47,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:47,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1083541932, now seen corresponding path program 1 times [2022-03-20 02:29:47,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:47,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879309587] [2022-03-20 02:29:47,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:47,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:47,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:47,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:47,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:47,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:47,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 02:29:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:47,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 02:29:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:47,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:47,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879309587] [2022-03-20 02:29:47,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879309587] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:47,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:47,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 02:29:47,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534741053] [2022-03-20 02:29:47,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:47,281 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 02:29:47,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:47,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 02:29:47,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-03-20 02:29:47,282 INFO L87 Difference]: Start difference. First operand 623 states and 791 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:29:48,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:48,548 INFO L93 Difference]: Finished difference Result 681 states and 860 transitions. [2022-03-20 02:29:48,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 02:29:48,550 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2022-03-20 02:29:48,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:48,552 INFO L225 Difference]: With dead ends: 681 [2022-03-20 02:29:48,552 INFO L226 Difference]: Without dead ends: 659 [2022-03-20 02:29:48,553 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-03-20 02:29:48,553 INFO L913 BasicCegarLoop]: 414 mSDtfsCounter, 777 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 2095 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 2341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 2095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:48,554 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [793 Valid, 1054 Invalid, 2341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 2095 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-20 02:29:48,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-03-20 02:29:48,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 624. [2022-03-20 02:29:48,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 499 states have (on average 1.2745490981963927) internal successors, (636), 509 states have internal predecessors, (636), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85) [2022-03-20 02:29:48,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 792 transitions. [2022-03-20 02:29:48,607 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 792 transitions. Word has length 51 [2022-03-20 02:29:48,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:48,607 INFO L478 AbstractCegarLoop]: Abstraction has 624 states and 792 transitions. [2022-03-20 02:29:48,607 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:29:48,607 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 792 transitions. [2022-03-20 02:29:48,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-03-20 02:29:48,608 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:48,608 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:48,609 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-03-20 02:29:48,609 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:48,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:48,609 INFO L85 PathProgramCache]: Analyzing trace with hash 325068325, now seen corresponding path program 1 times [2022-03-20 02:29:48,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:48,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234423042] [2022-03-20 02:29:48,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:48,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:48,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:48,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:48,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:48,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:48,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 02:29:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:48,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 02:29:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:48,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:48,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:48,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234423042] [2022-03-20 02:29:48,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234423042] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:48,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:48,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 02:29:48,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108481613] [2022-03-20 02:29:48,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:48,807 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 02:29:48,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:48,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 02:29:48,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-03-20 02:29:48,808 INFO L87 Difference]: Start difference. First operand 624 states and 792 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 02:29:49,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:49,901 INFO L93 Difference]: Finished difference Result 676 states and 851 transitions. [2022-03-20 02:29:49,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 02:29:49,902 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-03-20 02:29:49,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:49,904 INFO L225 Difference]: With dead ends: 676 [2022-03-20 02:29:49,904 INFO L226 Difference]: Without dead ends: 648 [2022-03-20 02:29:49,904 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-03-20 02:29:49,905 INFO L913 BasicCegarLoop]: 441 mSDtfsCounter, 458 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:49,905 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [466 Valid, 1446 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1660 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-20 02:29:49,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2022-03-20 02:29:49,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 616. [2022-03-20 02:29:49,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 491 states have (on average 1.2688391038696538) internal successors, (623), 501 states have internal predecessors, (623), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85) [2022-03-20 02:29:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 779 transitions. [2022-03-20 02:29:49,973 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 779 transitions. Word has length 51 [2022-03-20 02:29:49,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:49,973 INFO L478 AbstractCegarLoop]: Abstraction has 616 states and 779 transitions. [2022-03-20 02:29:49,973 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 02:29:49,974 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 779 transitions. [2022-03-20 02:29:49,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-20 02:29:49,975 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:49,975 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:49,975 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-03-20 02:29:49,975 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:49,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:49,975 INFO L85 PathProgramCache]: Analyzing trace with hash 519788489, now seen corresponding path program 1 times [2022-03-20 02:29:49,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:49,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983665665] [2022-03-20 02:29:49,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:49,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:49,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:50,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:50,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:50,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:50,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 02:29:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:50,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:50,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:50,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983665665] [2022-03-20 02:29:50,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983665665] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:50,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:50,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 02:29:50,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278769743] [2022-03-20 02:29:50,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:50,141 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 02:29:50,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:50,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 02:29:50,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-03-20 02:29:50,142 INFO L87 Difference]: Start difference. First operand 616 states and 779 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:29:51,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:51,065 INFO L93 Difference]: Finished difference Result 865 states and 1111 transitions. [2022-03-20 02:29:51,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 02:29:51,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2022-03-20 02:29:51,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:51,068 INFO L225 Difference]: With dead ends: 865 [2022-03-20 02:29:51,068 INFO L226 Difference]: Without dead ends: 832 [2022-03-20 02:29:51,069 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-03-20 02:29:51,069 INFO L913 BasicCegarLoop]: 543 mSDtfsCounter, 729 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 857 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:51,070 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [739 Valid, 971 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 857 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-20 02:29:51,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2022-03-20 02:29:51,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 659. [2022-03-20 02:29:51,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 527 states have (on average 1.2580645161290323) internal successors, (663), 530 states have internal predecessors, (663), 73 states have call successors, (73), 48 states have call predecessors, (73), 58 states have return successors, (97), 81 states have call predecessors, (97), 65 states have call successors, (97) [2022-03-20 02:29:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 833 transitions. [2022-03-20 02:29:51,132 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 833 transitions. Word has length 52 [2022-03-20 02:29:51,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:51,132 INFO L478 AbstractCegarLoop]: Abstraction has 659 states and 833 transitions. [2022-03-20 02:29:51,132 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:29:51,132 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 833 transitions. [2022-03-20 02:29:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-20 02:29:51,135 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:51,135 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:51,135 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-03-20 02:29:51,135 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:51,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:51,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1964857033, now seen corresponding path program 1 times [2022-03-20 02:29:51,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:51,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988346309] [2022-03-20 02:29:51,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:51,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:51,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 02:29:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:51,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:51,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:51,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988346309] [2022-03-20 02:29:51,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988346309] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:51,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:51,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 02:29:51,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489475614] [2022-03-20 02:29:51,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:51,343 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 02:29:51,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:51,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 02:29:51,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-03-20 02:29:51,344 INFO L87 Difference]: Start difference. First operand 659 states and 833 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 02:29:52,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:52,410 INFO L93 Difference]: Finished difference Result 1092 states and 1408 transitions. [2022-03-20 02:29:52,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-03-20 02:29:52,410 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-03-20 02:29:52,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:52,413 INFO L225 Difference]: With dead ends: 1092 [2022-03-20 02:29:52,414 INFO L226 Difference]: Without dead ends: 714 [2022-03-20 02:29:52,415 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-03-20 02:29:52,415 INFO L913 BasicCegarLoop]: 398 mSDtfsCounter, 1072 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:52,416 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1087 Valid, 872 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-20 02:29:52,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-03-20 02:29:52,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 666. [2022-03-20 02:29:52,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 534 states have (on average 1.2602996254681649) internal successors, (673), 537 states have internal predecessors, (673), 73 states have call successors, (73), 48 states have call predecessors, (73), 58 states have return successors, (97), 81 states have call predecessors, (97), 65 states have call successors, (97) [2022-03-20 02:29:52,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 843 transitions. [2022-03-20 02:29:52,483 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 843 transitions. Word has length 52 [2022-03-20 02:29:52,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:52,483 INFO L478 AbstractCegarLoop]: Abstraction has 666 states and 843 transitions. [2022-03-20 02:29:52,483 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 02:29:52,484 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 843 transitions. [2022-03-20 02:29:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-03-20 02:29:52,485 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:52,485 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:52,485 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-03-20 02:29:52,485 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:52,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:52,485 INFO L85 PathProgramCache]: Analyzing trace with hash 376509131, now seen corresponding path program 1 times [2022-03-20 02:29:52,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:52,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571581018] [2022-03-20 02:29:52,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:52,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 02:29:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:52,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:52,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:52,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571581018] [2022-03-20 02:29:52,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571581018] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:52,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:52,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 02:29:52,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76519862] [2022-03-20 02:29:52,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:52,718 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 02:29:52,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:52,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 02:29:52,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-03-20 02:29:52,720 INFO L87 Difference]: Start difference. First operand 666 states and 843 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 02:29:54,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:54,387 INFO L93 Difference]: Finished difference Result 731 states and 921 transitions. [2022-03-20 02:29:54,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-20 02:29:54,387 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2022-03-20 02:29:54,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:54,389 INFO L225 Difference]: With dead ends: 731 [2022-03-20 02:29:54,389 INFO L226 Difference]: Without dead ends: 610 [2022-03-20 02:29:54,391 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-03-20 02:29:54,391 INFO L913 BasicCegarLoop]: 400 mSDtfsCounter, 985 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 2233 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 2515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 2233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:54,391 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [992 Valid, 1224 Invalid, 2515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 2233 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-03-20 02:29:54,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-03-20 02:29:54,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 575. [2022-03-20 02:29:54,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 455 states have (on average 1.2747252747252746) internal successors, (580), 465 states have internal predecessors, (580), 69 states have call successors, (69), 44 states have call predecessors, (69), 50 states have return successors, (82), 66 states have call predecessors, (82), 61 states have call successors, (82) [2022-03-20 02:29:54,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 731 transitions. [2022-03-20 02:29:54,459 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 731 transitions. Word has length 52 [2022-03-20 02:29:54,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:54,460 INFO L478 AbstractCegarLoop]: Abstraction has 575 states and 731 transitions. [2022-03-20 02:29:54,461 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 02:29:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 731 transitions. [2022-03-20 02:29:54,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-03-20 02:29:54,462 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:54,462 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:54,462 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-03-20 02:29:54,462 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:54,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:54,462 INFO L85 PathProgramCache]: Analyzing trace with hash -614500354, now seen corresponding path program 1 times [2022-03-20 02:29:54,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:54,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17146661] [2022-03-20 02:29:54,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:54,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 02:29:54,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:54,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:54,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:54,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17146661] [2022-03-20 02:29:54,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17146661] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:54,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:54,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 02:29:54,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934337441] [2022-03-20 02:29:54,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:54,657 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 02:29:54,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:54,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 02:29:54,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-03-20 02:29:54,658 INFO L87 Difference]: Start difference. First operand 575 states and 731 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:29:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:55,618 INFO L93 Difference]: Finished difference Result 609 states and 770 transitions. [2022-03-20 02:29:55,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 02:29:55,618 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2022-03-20 02:29:55,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:55,620 INFO L225 Difference]: With dead ends: 609 [2022-03-20 02:29:55,620 INFO L226 Difference]: Without dead ends: 605 [2022-03-20 02:29:55,621 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-03-20 02:29:55,621 INFO L913 BasicCegarLoop]: 407 mSDtfsCounter, 635 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 1951 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 2186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:55,621 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [639 Valid, 1523 Invalid, 2186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1951 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-20 02:29:55,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-03-20 02:29:55,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 583. [2022-03-20 02:29:55,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 462 states have (on average 1.2705627705627707) internal successors, (587), 472 states have internal predecessors, (587), 69 states have call successors, (69), 44 states have call predecessors, (69), 51 states have return successors, (83), 67 states have call predecessors, (83), 61 states have call successors, (83) [2022-03-20 02:29:55,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 739 transitions. [2022-03-20 02:29:55,680 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 739 transitions. Word has length 53 [2022-03-20 02:29:55,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:55,680 INFO L478 AbstractCegarLoop]: Abstraction has 583 states and 739 transitions. [2022-03-20 02:29:55,680 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:29:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 739 transitions. [2022-03-20 02:29:55,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-03-20 02:29:55,681 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:55,681 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:55,681 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-03-20 02:29:55,682 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:55,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:55,682 INFO L85 PathProgramCache]: Analyzing trace with hash -614777184, now seen corresponding path program 1 times [2022-03-20 02:29:55,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:55,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858764306] [2022-03-20 02:29:55,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:55,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:55,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:55,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:55,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:55,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 02:29:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:55,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:55,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:55,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858764306] [2022-03-20 02:29:55,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858764306] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:55,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:55,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 02:29:55,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588599633] [2022-03-20 02:29:55,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:55,909 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 02:29:55,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:55,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 02:29:55,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-03-20 02:29:55,910 INFO L87 Difference]: Start difference. First operand 583 states and 739 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:29:57,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:57,153 INFO L93 Difference]: Finished difference Result 644 states and 823 transitions. [2022-03-20 02:29:57,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 02:29:57,153 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2022-03-20 02:29:57,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:57,155 INFO L225 Difference]: With dead ends: 644 [2022-03-20 02:29:57,156 INFO L226 Difference]: Without dead ends: 629 [2022-03-20 02:29:57,156 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-03-20 02:29:57,156 INFO L913 BasicCegarLoop]: 404 mSDtfsCounter, 335 mSDsluCounter, 1341 mSDsCounter, 0 mSdLazyCounter, 2412 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1745 SdHoareTripleChecker+Invalid, 2528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:57,156 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 1745 Invalid, 2528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2412 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-03-20 02:29:57,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2022-03-20 02:29:57,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 589. [2022-03-20 02:29:57,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 467 states have (on average 1.2676659528907923) internal successors, (592), 478 states have internal predecessors, (592), 69 states have call successors, (69), 44 states have call predecessors, (69), 52 states have return successors, (90), 67 states have call predecessors, (90), 61 states have call successors, (90) [2022-03-20 02:29:57,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 751 transitions. [2022-03-20 02:29:57,204 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 751 transitions. Word has length 53 [2022-03-20 02:29:57,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:57,204 INFO L478 AbstractCegarLoop]: Abstraction has 589 states and 751 transitions. [2022-03-20 02:29:57,205 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:29:57,205 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 751 transitions. [2022-03-20 02:29:57,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-03-20 02:29:57,206 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:57,206 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:57,206 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-03-20 02:29:57,206 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:57,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:57,206 INFO L85 PathProgramCache]: Analyzing trace with hash -903470965, now seen corresponding path program 1 times [2022-03-20 02:29:57,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:57,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973415379] [2022-03-20 02:29:57,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:57,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:57,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:57,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:57,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:57,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:57,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 02:29:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:57,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:57,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:57,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:57,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973415379] [2022-03-20 02:29:57,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973415379] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:57,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:57,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 02:29:57,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080763677] [2022-03-20 02:29:57,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:57,392 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 02:29:57,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:57,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 02:29:57,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-03-20 02:29:57,393 INFO L87 Difference]: Start difference. First operand 589 states and 751 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 02:29:58,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:29:58,720 INFO L93 Difference]: Finished difference Result 758 states and 985 transitions. [2022-03-20 02:29:58,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-20 02:29:58,721 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2022-03-20 02:29:58,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:29:58,724 INFO L225 Difference]: With dead ends: 758 [2022-03-20 02:29:58,724 INFO L226 Difference]: Without dead ends: 740 [2022-03-20 02:29:58,724 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2022-03-20 02:29:58,725 INFO L913 BasicCegarLoop]: 517 mSDtfsCounter, 1077 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-20 02:29:58,725 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1092 Valid, 987 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-20 02:29:58,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2022-03-20 02:29:58,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 573. [2022-03-20 02:29:58,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 454 states have (on average 1.2731277533039647) internal successors, (578), 464 states have internal predecessors, (578), 68 states have call successors, (68), 44 states have call predecessors, (68), 50 states have return successors, (81), 65 states have call predecessors, (81), 60 states have call successors, (81) [2022-03-20 02:29:58,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 727 transitions. [2022-03-20 02:29:58,790 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 727 transitions. Word has length 54 [2022-03-20 02:29:58,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:29:58,790 INFO L478 AbstractCegarLoop]: Abstraction has 573 states and 727 transitions. [2022-03-20 02:29:58,790 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-03-20 02:29:58,790 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 727 transitions. [2022-03-20 02:29:58,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-03-20 02:29:58,792 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:29:58,792 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:29:58,792 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-03-20 02:29:58,792 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:29:58,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:29:58,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1947373933, now seen corresponding path program 1 times [2022-03-20 02:29:58,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:29:58,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178568710] [2022-03-20 02:29:58,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:29:58,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:29:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:58,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:29:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:58,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:29:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:58,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:29:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:58,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 02:29:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:58,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-03-20 02:29:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:58,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-03-20 02:29:58,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:29:58,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:29:58,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:29:58,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178568710] [2022-03-20 02:29:58,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178568710] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:29:58,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:29:58,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 02:29:58,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469309815] [2022-03-20 02:29:58,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:29:58,998 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 02:29:58,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:29:58,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 02:29:58,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-03-20 02:29:58,998 INFO L87 Difference]: Start difference. First operand 573 states and 727 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-20 02:30:00,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:00,078 INFO L93 Difference]: Finished difference Result 608 states and 766 transitions. [2022-03-20 02:30:00,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 02:30:00,078 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 55 [2022-03-20 02:30:00,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:00,080 INFO L225 Difference]: With dead ends: 608 [2022-03-20 02:30:00,080 INFO L226 Difference]: Without dead ends: 580 [2022-03-20 02:30:00,081 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-03-20 02:30:00,082 INFO L913 BasicCegarLoop]: 401 mSDtfsCounter, 535 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 2286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:00,082 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [545 Valid, 1606 Invalid, 2286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 2109 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-20 02:30:00,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2022-03-20 02:30:00,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 561. [2022-03-20 02:30:00,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 445 states have (on average 1.2719101123595506) internal successors, (566), 455 states have internal predecessors, (566), 66 states have call successors, (66), 43 states have call predecessors, (66), 49 states have return successors, (79), 63 states have call predecessors, (79), 58 states have call successors, (79) [2022-03-20 02:30:00,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 711 transitions. [2022-03-20 02:30:00,139 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 711 transitions. Word has length 55 [2022-03-20 02:30:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:00,139 INFO L478 AbstractCegarLoop]: Abstraction has 561 states and 711 transitions. [2022-03-20 02:30:00,139 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-20 02:30:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 711 transitions. [2022-03-20 02:30:00,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-03-20 02:30:00,140 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:00,141 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:00,141 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-03-20 02:30:00,141 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:00,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:00,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1340373320, now seen corresponding path program 1 times [2022-03-20 02:30:00,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:00,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094894600] [2022-03-20 02:30:00,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:00,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:00,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:00,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:00,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:00,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-03-20 02:30:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:00,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:00,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-03-20 02:30:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:00,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:00,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094894600] [2022-03-20 02:30:00,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094894600] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:00,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:00,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-03-20 02:30:00,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709517636] [2022-03-20 02:30:00,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:00,289 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-03-20 02:30:00,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:00,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-03-20 02:30:00,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-03-20 02:30:00,289 INFO L87 Difference]: Start difference. First operand 561 states and 711 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-20 02:30:01,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:01,013 INFO L93 Difference]: Finished difference Result 898 states and 1149 transitions. [2022-03-20 02:30:01,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 02:30:01,014 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-03-20 02:30:01,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:01,016 INFO L225 Difference]: With dead ends: 898 [2022-03-20 02:30:01,016 INFO L226 Difference]: Without dead ends: 589 [2022-03-20 02:30:01,017 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:30:01,017 INFO L913 BasicCegarLoop]: 385 mSDtfsCounter, 448 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:01,017 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [454 Valid, 825 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-20 02:30:01,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-03-20 02:30:01,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 566. [2022-03-20 02:30:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 449 states have (on average 1.265033407572383) internal successors, (568), 460 states have internal predecessors, (568), 66 states have call successors, (66), 43 states have call predecessors, (66), 50 states have return successors, (83), 63 states have call predecessors, (83), 58 states have call successors, (83) [2022-03-20 02:30:01,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 717 transitions. [2022-03-20 02:30:01,079 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 717 transitions. Word has length 58 [2022-03-20 02:30:01,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:01,080 INFO L478 AbstractCegarLoop]: Abstraction has 566 states and 717 transitions. [2022-03-20 02:30:01,080 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-20 02:30:01,080 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 717 transitions. [2022-03-20 02:30:01,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-20 02:30:01,081 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:01,081 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:01,081 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-03-20 02:30:01,081 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:01,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:01,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1752890422, now seen corresponding path program 1 times [2022-03-20 02:30:01,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:01,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606672263] [2022-03-20 02:30:01,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:01,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:01,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:01,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:01,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:01,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-03-20 02:30:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:01,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:01,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:01,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:01,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606672263] [2022-03-20 02:30:01,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606672263] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:01,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:01,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 02:30:01,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687425499] [2022-03-20 02:30:01,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:01,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 02:30:01,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:01,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 02:30:01,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-03-20 02:30:01,346 INFO L87 Difference]: Start difference. First operand 566 states and 717 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-20 02:30:02,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:02,342 INFO L93 Difference]: Finished difference Result 852 states and 1088 transitions. [2022-03-20 02:30:02,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 02:30:02,343 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2022-03-20 02:30:02,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:02,345 INFO L225 Difference]: With dead ends: 852 [2022-03-20 02:30:02,345 INFO L226 Difference]: Without dead ends: 538 [2022-03-20 02:30:02,347 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-03-20 02:30:02,347 INFO L913 BasicCegarLoop]: 391 mSDtfsCounter, 308 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:02,348 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 1089 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-20 02:30:02,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-03-20 02:30:02,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 511. [2022-03-20 02:30:02,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 402 states have (on average 1.2537313432835822) internal successors, (504), 410 states have internal predecessors, (504), 63 states have call successors, (63), 42 states have call predecessors, (63), 45 states have return successors, (72), 59 states have call predecessors, (72), 56 states have call successors, (72) [2022-03-20 02:30:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 639 transitions. [2022-03-20 02:30:02,412 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 639 transitions. Word has length 64 [2022-03-20 02:30:02,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:02,412 INFO L478 AbstractCegarLoop]: Abstraction has 511 states and 639 transitions. [2022-03-20 02:30:02,412 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-20 02:30:02,412 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 639 transitions. [2022-03-20 02:30:02,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-03-20 02:30:02,413 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:02,413 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:02,414 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-03-20 02:30:02,414 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:02,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:02,414 INFO L85 PathProgramCache]: Analyzing trace with hash -557797138, now seen corresponding path program 1 times [2022-03-20 02:30:02,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:02,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335340926] [2022-03-20 02:30:02,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:02,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:02,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:02,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:02,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:02,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 02:30:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:02,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 02:30:02,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:02,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 02:30:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:02,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:02,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:02,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335340926] [2022-03-20 02:30:02,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335340926] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:02,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:02,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 02:30:02,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804886115] [2022-03-20 02:30:02,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:02,638 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 02:30:02,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:02,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 02:30:02,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-03-20 02:30:02,639 INFO L87 Difference]: Start difference. First operand 511 states and 639 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-20 02:30:04,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:04,010 INFO L93 Difference]: Finished difference Result 545 states and 678 transitions. [2022-03-20 02:30:04,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-20 02:30:04,010 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2022-03-20 02:30:04,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:04,012 INFO L225 Difference]: With dead ends: 545 [2022-03-20 02:30:04,012 INFO L226 Difference]: Without dead ends: 524 [2022-03-20 02:30:04,012 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-03-20 02:30:04,013 INFO L913 BasicCegarLoop]: 377 mSDtfsCounter, 644 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 2385 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 2584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 2385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:04,013 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [657 Valid, 1137 Invalid, 2584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 2385 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-03-20 02:30:04,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-03-20 02:30:04,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 508. [2022-03-20 02:30:04,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 399 states have (on average 1.255639097744361) internal successors, (501), 408 states have internal predecessors, (501), 63 states have call successors, (63), 42 states have call predecessors, (63), 45 states have return successors, (71), 58 states have call predecessors, (71), 56 states have call successors, (71) [2022-03-20 02:30:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 635 transitions. [2022-03-20 02:30:04,056 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 635 transitions. Word has length 59 [2022-03-20 02:30:04,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:04,057 INFO L478 AbstractCegarLoop]: Abstraction has 508 states and 635 transitions. [2022-03-20 02:30:04,057 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-20 02:30:04,057 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 635 transitions. [2022-03-20 02:30:04,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-03-20 02:30:04,058 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:04,058 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:04,058 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-03-20 02:30:04,059 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:04,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:04,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2048336817, now seen corresponding path program 1 times [2022-03-20 02:30:04,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:04,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886909936] [2022-03-20 02:30:04,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:04,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:04,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:04,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:04,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:04,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:04,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-03-20 02:30:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:04,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:04,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:04,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886909936] [2022-03-20 02:30:04,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886909936] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:04,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:04,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 02:30:04,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8985197] [2022-03-20 02:30:04,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:04,237 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 02:30:04,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:04,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 02:30:04,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-03-20 02:30:04,237 INFO L87 Difference]: Start difference. First operand 508 states and 635 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:30:05,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:05,221 INFO L93 Difference]: Finished difference Result 538 states and 669 transitions. [2022-03-20 02:30:05,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 02:30:05,221 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2022-03-20 02:30:05,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:05,224 INFO L225 Difference]: With dead ends: 538 [2022-03-20 02:30:05,224 INFO L226 Difference]: Without dead ends: 520 [2022-03-20 02:30:05,224 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-03-20 02:30:05,228 INFO L913 BasicCegarLoop]: 391 mSDtfsCounter, 421 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 1968 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 2094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 1968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:05,228 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 1547 Invalid, 2094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 1968 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-20 02:30:05,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-03-20 02:30:05,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 504. [2022-03-20 02:30:05,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 396 states have (on average 1.255050505050505) internal successors, (497), 405 states have internal predecessors, (497), 62 states have call successors, (62), 42 states have call predecessors, (62), 45 states have return successors, (70), 57 states have call predecessors, (70), 55 states have call successors, (70) [2022-03-20 02:30:05,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 629 transitions. [2022-03-20 02:30:05,303 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 629 transitions. Word has length 58 [2022-03-20 02:30:05,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:05,303 INFO L478 AbstractCegarLoop]: Abstraction has 504 states and 629 transitions. [2022-03-20 02:30:05,304 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:30:05,304 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 629 transitions. [2022-03-20 02:30:05,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-03-20 02:30:05,304 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:05,304 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:05,305 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-03-20 02:30:05,305 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:05,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:05,305 INFO L85 PathProgramCache]: Analyzing trace with hash 853367933, now seen corresponding path program 1 times [2022-03-20 02:30:05,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:05,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528950922] [2022-03-20 02:30:05,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:05,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:05,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:05,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:05,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:05,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:05,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:05,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-20 02:30:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:05,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-03-20 02:30:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:05,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:05,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:05,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528950922] [2022-03-20 02:30:05,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528950922] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:05,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:05,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 02:30:05,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997848381] [2022-03-20 02:30:05,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:05,510 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 02:30:05,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:05,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 02:30:05,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:30:05,510 INFO L87 Difference]: Start difference. First operand 504 states and 629 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-20 02:30:06,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:06,515 INFO L93 Difference]: Finished difference Result 539 states and 669 transitions. [2022-03-20 02:30:06,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 02:30:06,516 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2022-03-20 02:30:06,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:06,518 INFO L225 Difference]: With dead ends: 539 [2022-03-20 02:30:06,518 INFO L226 Difference]: Without dead ends: 515 [2022-03-20 02:30:06,518 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-03-20 02:30:06,519 INFO L913 BasicCegarLoop]: 362 mSDtfsCounter, 568 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1789 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:06,519 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [581 Valid, 875 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1789 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-20 02:30:06,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-03-20 02:30:06,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 499. [2022-03-20 02:30:06,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 393 states have (on average 1.251908396946565) internal successors, (492), 401 states have internal predecessors, (492), 61 states have call successors, (61), 42 states have call predecessors, (61), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2022-03-20 02:30:06,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 621 transitions. [2022-03-20 02:30:06,574 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 621 transitions. Word has length 60 [2022-03-20 02:30:06,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:06,574 INFO L478 AbstractCegarLoop]: Abstraction has 499 states and 621 transitions. [2022-03-20 02:30:06,574 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-03-20 02:30:06,575 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 621 transitions. [2022-03-20 02:30:06,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-03-20 02:30:06,576 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:06,576 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:06,576 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-03-20 02:30:06,576 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:06,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:06,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1746189105, now seen corresponding path program 1 times [2022-03-20 02:30:06,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:06,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557984638] [2022-03-20 02:30:06,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:06,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:06,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:06,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:06,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:06,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-03-20 02:30:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:06,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:06,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:06,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:06,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:06,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:06,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557984638] [2022-03-20 02:30:06,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557984638] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:06,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:06,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 02:30:06,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723557237] [2022-03-20 02:30:06,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:06,779 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 02:30:06,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:06,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 02:30:06,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:30:06,780 INFO L87 Difference]: Start difference. First operand 499 states and 621 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 02:30:07,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:07,783 INFO L93 Difference]: Finished difference Result 780 states and 980 transitions. [2022-03-20 02:30:07,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 02:30:07,787 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2022-03-20 02:30:07,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:07,789 INFO L225 Difference]: With dead ends: 780 [2022-03-20 02:30:07,789 INFO L226 Difference]: Without dead ends: 521 [2022-03-20 02:30:07,790 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-03-20 02:30:07,791 INFO L913 BasicCegarLoop]: 357 mSDtfsCounter, 745 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 1548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:07,791 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [758 Valid, 1089 Invalid, 1548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-20 02:30:07,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-03-20 02:30:07,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 499. [2022-03-20 02:30:07,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 393 states have (on average 1.2468193384223918) internal successors, (490), 401 states have internal predecessors, (490), 61 states have call successors, (61), 42 states have call predecessors, (61), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2022-03-20 02:30:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 619 transitions. [2022-03-20 02:30:07,839 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 619 transitions. Word has length 68 [2022-03-20 02:30:07,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:07,839 INFO L478 AbstractCegarLoop]: Abstraction has 499 states and 619 transitions. [2022-03-20 02:30:07,840 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 02:30:07,840 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 619 transitions. [2022-03-20 02:30:07,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-20 02:30:07,841 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:07,841 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:07,841 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-03-20 02:30:07,841 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:07,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:07,842 INFO L85 PathProgramCache]: Analyzing trace with hash -662819238, now seen corresponding path program 1 times [2022-03-20 02:30:07,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:07,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889951073] [2022-03-20 02:30:07,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:07,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:07,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:07,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:07,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:07,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 02:30:07,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:07,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 02:30:07,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:08,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 02:30:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:08,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:08,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:08,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889951073] [2022-03-20 02:30:08,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889951073] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:08,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:08,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-03-20 02:30:08,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818378336] [2022-03-20 02:30:08,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:08,014 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-03-20 02:30:08,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:08,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-03-20 02:30:08,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-03-20 02:30:08,015 INFO L87 Difference]: Start difference. First operand 499 states and 619 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-20 02:30:08,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:08,963 INFO L93 Difference]: Finished difference Result 611 states and 749 transitions. [2022-03-20 02:30:08,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-03-20 02:30:08,964 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2022-03-20 02:30:08,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:08,966 INFO L225 Difference]: With dead ends: 611 [2022-03-20 02:30:08,966 INFO L226 Difference]: Without dead ends: 519 [2022-03-20 02:30:08,966 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-03-20 02:30:08,966 INFO L913 BasicCegarLoop]: 359 mSDtfsCounter, 554 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 1486 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:08,966 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [568 Valid, 794 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1486 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-20 02:30:08,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-03-20 02:30:09,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 503. [2022-03-20 02:30:09,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 396 states have (on average 1.244949494949495) internal successors, (493), 404 states have internal predecessors, (493), 61 states have call successors, (61), 42 states have call predecessors, (61), 45 states have return successors, (69), 57 states have call predecessors, (69), 54 states have call successors, (69) [2022-03-20 02:30:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 623 transitions. [2022-03-20 02:30:09,005 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 623 transitions. Word has length 63 [2022-03-20 02:30:09,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:09,005 INFO L478 AbstractCegarLoop]: Abstraction has 503 states and 623 transitions. [2022-03-20 02:30:09,005 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-20 02:30:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 623 transitions. [2022-03-20 02:30:09,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-20 02:30:09,006 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:09,006 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:09,006 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-03-20 02:30:09,006 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:09,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:09,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1616978329, now seen corresponding path program 1 times [2022-03-20 02:30:09,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:09,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25763056] [2022-03-20 02:30:09,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:09,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:09,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:09,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:09,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:09,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:09,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:09,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 02:30:09,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:09,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 02:30:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:09,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 02:30:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:09,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:09,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25763056] [2022-03-20 02:30:09,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25763056] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:09,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:09,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 02:30:09,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309533173] [2022-03-20 02:30:09,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:09,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 02:30:09,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:09,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 02:30:09,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:30:09,192 INFO L87 Difference]: Start difference. First operand 503 states and 623 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-20 02:30:10,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:10,409 INFO L93 Difference]: Finished difference Result 529 states and 653 transitions. [2022-03-20 02:30:10,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 02:30:10,409 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2022-03-20 02:30:10,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:10,411 INFO L225 Difference]: With dead ends: 529 [2022-03-20 02:30:10,411 INFO L226 Difference]: Without dead ends: 505 [2022-03-20 02:30:10,411 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-03-20 02:30:10,411 INFO L913 BasicCegarLoop]: 352 mSDtfsCounter, 671 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 2096 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 2096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:10,411 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [685 Valid, 972 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 2096 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-20 02:30:10,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-03-20 02:30:10,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 489. [2022-03-20 02:30:10,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 384 states have (on average 1.2395833333333333) internal successors, (476), 391 states have internal predecessors, (476), 60 states have call successors, (60), 42 states have call predecessors, (60), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2022-03-20 02:30:10,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 604 transitions. [2022-03-20 02:30:10,458 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 604 transitions. Word has length 63 [2022-03-20 02:30:10,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:10,458 INFO L478 AbstractCegarLoop]: Abstraction has 489 states and 604 transitions. [2022-03-20 02:30:10,458 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-03-20 02:30:10,459 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 604 transitions. [2022-03-20 02:30:10,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-03-20 02:30:10,459 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:10,459 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:10,460 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-03-20 02:30:10,460 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:10,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:10,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1834799191, now seen corresponding path program 1 times [2022-03-20 02:30:10,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:10,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667683473] [2022-03-20 02:30:10,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:10,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:10,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:10,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:10,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:10,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:10,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:10,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:10,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:10,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667683473] [2022-03-20 02:30:10,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667683473] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:10,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:10,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 02:30:10,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865176540] [2022-03-20 02:30:10,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:10,650 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 02:30:10,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:10,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 02:30:10,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-20 02:30:10,651 INFO L87 Difference]: Start difference. First operand 489 states and 604 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:30:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:11,604 INFO L93 Difference]: Finished difference Result 522 states and 642 transitions. [2022-03-20 02:30:11,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 02:30:11,604 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2022-03-20 02:30:11,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:11,606 INFO L225 Difference]: With dead ends: 522 [2022-03-20 02:30:11,606 INFO L226 Difference]: Without dead ends: 501 [2022-03-20 02:30:11,606 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-03-20 02:30:11,606 INFO L913 BasicCegarLoop]: 369 mSDtfsCounter, 357 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 2199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:11,606 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [361 Valid, 1563 Invalid, 2199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-20 02:30:11,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-03-20 02:30:11,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 485. [2022-03-20 02:30:11,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 381 states have (on average 1.2388451443569555) internal successors, (472), 388 states have internal predecessors, (472), 59 states have call successors, (59), 42 states have call predecessors, (59), 44 states have return successors, (67), 55 states have call predecessors, (67), 53 states have call successors, (67) [2022-03-20 02:30:11,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 598 transitions. [2022-03-20 02:30:11,645 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 598 transitions. Word has length 63 [2022-03-20 02:30:11,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:11,645 INFO L478 AbstractCegarLoop]: Abstraction has 485 states and 598 transitions. [2022-03-20 02:30:11,645 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:30:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 598 transitions. [2022-03-20 02:30:11,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-03-20 02:30:11,646 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:11,646 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:11,646 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-03-20 02:30:11,646 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:11,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:11,647 INFO L85 PathProgramCache]: Analyzing trace with hash 2018781837, now seen corresponding path program 1 times [2022-03-20 02:30:11,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:11,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017008257] [2022-03-20 02:30:11,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:11,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:11,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:11,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:11,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:11,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-03-20 02:30:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:11,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:11,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:11,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:11,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:11,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:11,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:11,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:11,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:11,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017008257] [2022-03-20 02:30:11,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017008257] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:11,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:11,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 02:30:11,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655923568] [2022-03-20 02:30:11,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:11,835 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 02:30:11,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:11,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 02:30:11,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:30:11,835 INFO L87 Difference]: Start difference. First operand 485 states and 598 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 02:30:12,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:12,931 INFO L93 Difference]: Finished difference Result 746 states and 929 transitions. [2022-03-20 02:30:12,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-20 02:30:12,932 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2022-03-20 02:30:12,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:12,934 INFO L225 Difference]: With dead ends: 746 [2022-03-20 02:30:12,934 INFO L226 Difference]: Without dead ends: 520 [2022-03-20 02:30:12,934 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-03-20 02:30:12,935 INFO L913 BasicCegarLoop]: 371 mSDtfsCounter, 298 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:12,935 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [307 Valid, 1356 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-20 02:30:12,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-03-20 02:30:12,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 485. [2022-03-20 02:30:12,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 381 states have (on average 1.2335958005249343) internal successors, (470), 388 states have internal predecessors, (470), 59 states have call successors, (59), 42 states have call predecessors, (59), 44 states have return successors, (67), 55 states have call predecessors, (67), 53 states have call successors, (67) [2022-03-20 02:30:12,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 596 transitions. [2022-03-20 02:30:12,984 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 596 transitions. Word has length 71 [2022-03-20 02:30:12,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:12,984 INFO L478 AbstractCegarLoop]: Abstraction has 485 states and 596 transitions. [2022-03-20 02:30:12,984 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-03-20 02:30:12,984 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 596 transitions. [2022-03-20 02:30:12,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-20 02:30:12,985 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:12,985 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:12,985 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-03-20 02:30:12,986 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:12,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:12,986 INFO L85 PathProgramCache]: Analyzing trace with hash -2107854790, now seen corresponding path program 1 times [2022-03-20 02:30:12,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:12,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728271790] [2022-03-20 02:30:12,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:12,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:13,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:13,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:13,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:13,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 02:30:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:13,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-03-20 02:30:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:13,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:13,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728271790] [2022-03-20 02:30:13,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728271790] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:13,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:13,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 02:30:13,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238828349] [2022-03-20 02:30:13,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:13,178 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 02:30:13,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:13,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 02:30:13,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-03-20 02:30:13,181 INFO L87 Difference]: Start difference. First operand 485 states and 596 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:30:14,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:14,171 INFO L93 Difference]: Finished difference Result 512 states and 627 transitions. [2022-03-20 02:30:14,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 02:30:14,171 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2022-03-20 02:30:14,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:14,173 INFO L225 Difference]: With dead ends: 512 [2022-03-20 02:30:14,173 INFO L226 Difference]: Without dead ends: 490 [2022-03-20 02:30:14,173 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-03-20 02:30:14,173 INFO L913 BasicCegarLoop]: 375 mSDtfsCounter, 642 mSDsluCounter, 1104 mSDsCounter, 0 mSdLazyCounter, 1873 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 2076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 1873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:14,173 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [646 Valid, 1479 Invalid, 2076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 1873 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-20 02:30:14,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-03-20 02:30:14,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 474. [2022-03-20 02:30:14,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 372 states have (on average 1.2311827956989247) internal successors, (458), 379 states have internal predecessors, (458), 58 states have call successors, (58), 42 states have call predecessors, (58), 43 states have return successors, (65), 53 states have call predecessors, (65), 52 states have call successors, (65) [2022-03-20 02:30:14,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 581 transitions. [2022-03-20 02:30:14,230 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 581 transitions. Word has length 64 [2022-03-20 02:30:14,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:14,230 INFO L478 AbstractCegarLoop]: Abstraction has 474 states and 581 transitions. [2022-03-20 02:30:14,230 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:30:14,231 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 581 transitions. [2022-03-20 02:30:14,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-20 02:30:14,232 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:14,232 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:14,232 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-03-20 02:30:14,232 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:14,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:14,233 INFO L85 PathProgramCache]: Analyzing trace with hash 245569005, now seen corresponding path program 1 times [2022-03-20 02:30:14,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:14,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605724301] [2022-03-20 02:30:14,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:14,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:14,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:14,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:14,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:14,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:14,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:14,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:14,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:14,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605724301] [2022-03-20 02:30:14,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605724301] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:14,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:14,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 02:30:14,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661063597] [2022-03-20 02:30:14,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:14,429 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 02:30:14,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:14,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 02:30:14,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-20 02:30:14,430 INFO L87 Difference]: Start difference. First operand 474 states and 581 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:30:15,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:15,325 INFO L93 Difference]: Finished difference Result 507 states and 619 transitions. [2022-03-20 02:30:15,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 02:30:15,325 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2022-03-20 02:30:15,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:15,327 INFO L225 Difference]: With dead ends: 507 [2022-03-20 02:30:15,327 INFO L226 Difference]: Without dead ends: 485 [2022-03-20 02:30:15,327 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-03-20 02:30:15,327 INFO L913 BasicCegarLoop]: 353 mSDtfsCounter, 389 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 2095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:15,328 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [393 Valid, 1502 Invalid, 2095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-20 02:30:15,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-03-20 02:30:15,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2022-03-20 02:30:15,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 368 states have (on average 1.2309782608695652) internal successors, (453), 375 states have internal predecessors, (453), 57 states have call successors, (57), 42 states have call predecessors, (57), 43 states have return successors, (64), 52 states have call predecessors, (64), 51 states have call successors, (64) [2022-03-20 02:30:15,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 574 transitions. [2022-03-20 02:30:15,362 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 574 transitions. Word has length 64 [2022-03-20 02:30:15,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:15,362 INFO L478 AbstractCegarLoop]: Abstraction has 469 states and 574 transitions. [2022-03-20 02:30:15,363 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:30:15,363 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 574 transitions. [2022-03-20 02:30:15,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-03-20 02:30:15,363 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:15,363 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:15,363 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-03-20 02:30:15,364 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:15,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:15,364 INFO L85 PathProgramCache]: Analyzing trace with hash -684542465, now seen corresponding path program 1 times [2022-03-20 02:30:15,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:15,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251546355] [2022-03-20 02:30:15,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:15,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:15,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:15,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:15,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:15,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:15,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:15,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:15,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:15,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:15,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:15,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251546355] [2022-03-20 02:30:15,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251546355] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:15,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:15,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 02:30:15,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097541458] [2022-03-20 02:30:15,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:15,589 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 02:30:15,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:15,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 02:30:15,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-20 02:30:15,590 INFO L87 Difference]: Start difference. First operand 469 states and 574 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:30:16,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:16,561 INFO L93 Difference]: Finished difference Result 502 states and 612 transitions. [2022-03-20 02:30:16,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 02:30:16,562 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2022-03-20 02:30:16,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:16,563 INFO L225 Difference]: With dead ends: 502 [2022-03-20 02:30:16,563 INFO L226 Difference]: Without dead ends: 481 [2022-03-20 02:30:16,563 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-03-20 02:30:16,564 INFO L913 BasicCegarLoop]: 347 mSDtfsCounter, 291 mSDsluCounter, 1143 mSDsCounter, 0 mSdLazyCounter, 2100 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:16,565 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 1490 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2100 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-20 02:30:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-03-20 02:30:16,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 465. [2022-03-20 02:30:16,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.2301369863013698) internal successors, (449), 372 states have internal predecessors, (449), 56 states have call successors, (56), 42 states have call predecessors, (56), 43 states have return successors, (63), 51 states have call predecessors, (63), 50 states have call successors, (63) [2022-03-20 02:30:16,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 568 transitions. [2022-03-20 02:30:16,607 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 568 transitions. Word has length 64 [2022-03-20 02:30:16,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:16,607 INFO L478 AbstractCegarLoop]: Abstraction has 465 states and 568 transitions. [2022-03-20 02:30:16,608 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:30:16,608 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 568 transitions. [2022-03-20 02:30:16,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-03-20 02:30:16,609 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:16,609 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:16,609 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-03-20 02:30:16,609 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:16,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:16,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1161284456, now seen corresponding path program 1 times [2022-03-20 02:30:16,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:16,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848094337] [2022-03-20 02:30:16,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:16,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:16,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:16,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:16,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:16,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-03-20 02:30:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:16,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:16,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:16,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:16,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:16,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:16,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848094337] [2022-03-20 02:30:16,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848094337] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:16,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:16,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-03-20 02:30:16,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172635254] [2022-03-20 02:30:16,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:16,762 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-03-20 02:30:16,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:16,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-03-20 02:30:16,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-03-20 02:30:16,762 INFO L87 Difference]: Start difference. First operand 465 states and 568 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 02:30:17,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:17,502 INFO L93 Difference]: Finished difference Result 878 states and 1082 transitions. [2022-03-20 02:30:17,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 02:30:17,502 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2022-03-20 02:30:17,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:17,505 INFO L225 Difference]: With dead ends: 878 [2022-03-20 02:30:17,505 INFO L226 Difference]: Without dead ends: 625 [2022-03-20 02:30:17,506 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-03-20 02:30:17,506 INFO L913 BasicCegarLoop]: 408 mSDtfsCounter, 569 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:17,507 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [581 Valid, 812 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-20 02:30:17,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-03-20 02:30:17,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 586. [2022-03-20 02:30:17,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 458 states have (on average 1.220524017467249) internal successors, (559), 467 states have internal predecessors, (559), 69 states have call successors, (69), 52 states have call predecessors, (69), 58 states have return successors, (88), 67 states have call predecessors, (88), 64 states have call successors, (88) [2022-03-20 02:30:17,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 716 transitions. [2022-03-20 02:30:17,569 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 716 transitions. Word has length 70 [2022-03-20 02:30:17,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:17,569 INFO L478 AbstractCegarLoop]: Abstraction has 586 states and 716 transitions. [2022-03-20 02:30:17,569 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 02:30:17,569 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 716 transitions. [2022-03-20 02:30:17,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-03-20 02:30:17,570 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:17,570 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:17,571 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-03-20 02:30:17,571 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:17,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:17,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1771054254, now seen corresponding path program 1 times [2022-03-20 02:30:17,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:17,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551882863] [2022-03-20 02:30:17,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:17,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:17,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:17,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:17,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:17,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:17,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-03-20 02:30:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:17,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:17,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:17,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551882863] [2022-03-20 02:30:17,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551882863] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:17,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:17,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 02:30:17,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706001806] [2022-03-20 02:30:17,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:17,750 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 02:30:17,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:17,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 02:30:17,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-03-20 02:30:17,751 INFO L87 Difference]: Start difference. First operand 586 states and 716 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:30:18,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:18,715 INFO L93 Difference]: Finished difference Result 619 states and 755 transitions. [2022-03-20 02:30:18,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 02:30:18,716 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 68 [2022-03-20 02:30:18,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:18,719 INFO L225 Difference]: With dead ends: 619 [2022-03-20 02:30:18,719 INFO L226 Difference]: Without dead ends: 576 [2022-03-20 02:30:18,719 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-03-20 02:30:18,720 INFO L913 BasicCegarLoop]: 339 mSDtfsCounter, 335 mSDsluCounter, 1160 mSDsCounter, 0 mSdLazyCounter, 2099 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:18,720 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 1499 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2099 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-03-20 02:30:18,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-03-20 02:30:18,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 560. [2022-03-20 02:30:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 437 states have (on average 1.2196796338672768) internal successors, (533), 446 states have internal predecessors, (533), 66 states have call successors, (66), 50 states have call predecessors, (66), 56 states have return successors, (85), 64 states have call predecessors, (85), 61 states have call successors, (85) [2022-03-20 02:30:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 684 transitions. [2022-03-20 02:30:18,780 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 684 transitions. Word has length 68 [2022-03-20 02:30:18,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:18,780 INFO L478 AbstractCegarLoop]: Abstraction has 560 states and 684 transitions. [2022-03-20 02:30:18,780 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-03-20 02:30:18,780 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 684 transitions. [2022-03-20 02:30:18,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-03-20 02:30:18,781 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:18,781 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:18,781 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-03-20 02:30:18,781 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:18,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:18,782 INFO L85 PathProgramCache]: Analyzing trace with hash -699513037, now seen corresponding path program 1 times [2022-03-20 02:30:18,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:18,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327806549] [2022-03-20 02:30:18,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:18,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:18,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:18,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:18,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:18,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-03-20 02:30:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:18,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 02:30:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:18,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 02:30:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:18,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-03-20 02:30:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:18,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:18,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:18,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327806549] [2022-03-20 02:30:18,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327806549] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:18,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:18,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-20 02:30:18,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318963866] [2022-03-20 02:30:18,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:18,991 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-20 02:30:18,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:18,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-20 02:30:18,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-03-20 02:30:18,991 INFO L87 Difference]: Start difference. First operand 560 states and 684 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 02:30:20,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:20,225 INFO L93 Difference]: Finished difference Result 589 states and 718 transitions. [2022-03-20 02:30:20,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-03-20 02:30:20,226 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2022-03-20 02:30:20,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:20,227 INFO L225 Difference]: With dead ends: 589 [2022-03-20 02:30:20,227 INFO L226 Difference]: Without dead ends: 535 [2022-03-20 02:30:20,227 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-03-20 02:30:20,228 INFO L913 BasicCegarLoop]: 305 mSDtfsCounter, 353 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 2725 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 2825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 2725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:20,228 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 891 Invalid, 2825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 2725 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-03-20 02:30:20,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-03-20 02:30:20,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 519. [2022-03-20 02:30:20,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 403 states have (on average 1.2133995037220844) internal successors, (489), 412 states have internal predecessors, (489), 62 states have call successors, (62), 47 states have call predecessors, (62), 53 states have return successors, (81), 60 states have call predecessors, (81), 57 states have call successors, (81) [2022-03-20 02:30:20,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 632 transitions. [2022-03-20 02:30:20,267 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 632 transitions. Word has length 71 [2022-03-20 02:30:20,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:20,268 INFO L478 AbstractCegarLoop]: Abstraction has 519 states and 632 transitions. [2022-03-20 02:30:20,268 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-03-20 02:30:20,268 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 632 transitions. [2022-03-20 02:30:20,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-03-20 02:30:20,269 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:20,269 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:20,269 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-03-20 02:30:20,269 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:20,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1796970753, now seen corresponding path program 1 times [2022-03-20 02:30:20,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:20,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457172564] [2022-03-20 02:30:20,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:20,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:20,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:20,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:20,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:20,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:20,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-03-20 02:30:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:20,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:20,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:20,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:20,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-03-20 02:30:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:20,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:20,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:20,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457172564] [2022-03-20 02:30:20,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457172564] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:20,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:20,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 02:30:20,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27540845] [2022-03-20 02:30:20,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:20,439 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 02:30:20,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:20,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 02:30:20,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-03-20 02:30:20,440 INFO L87 Difference]: Start difference. First operand 519 states and 632 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-03-20 02:30:21,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:21,134 INFO L93 Difference]: Finished difference Result 840 states and 1028 transitions. [2022-03-20 02:30:21,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-20 02:30:21,135 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 82 [2022-03-20 02:30:21,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:21,136 INFO L225 Difference]: With dead ends: 840 [2022-03-20 02:30:21,136 INFO L226 Difference]: Without dead ends: 523 [2022-03-20 02:30:21,138 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-03-20 02:30:21,138 INFO L913 BasicCegarLoop]: 393 mSDtfsCounter, 457 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:21,138 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [464 Valid, 1130 Invalid, 931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-20 02:30:21,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-03-20 02:30:21,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 501. [2022-03-20 02:30:21,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 389 states have (on average 1.2133676092544987) internal successors, (472), 397 states have internal predecessors, (472), 60 states have call successors, (60), 47 states have call predecessors, (60), 51 states have return successors, (70), 57 states have call predecessors, (70), 55 states have call successors, (70) [2022-03-20 02:30:21,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 602 transitions. [2022-03-20 02:30:21,197 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 602 transitions. Word has length 82 [2022-03-20 02:30:21,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:21,197 INFO L478 AbstractCegarLoop]: Abstraction has 501 states and 602 transitions. [2022-03-20 02:30:21,197 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-03-20 02:30:21,198 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 602 transitions. [2022-03-20 02:30:21,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-03-20 02:30:21,198 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:21,199 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:21,199 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-03-20 02:30:21,199 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:21,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:21,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2026941125, now seen corresponding path program 1 times [2022-03-20 02:30:21,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:21,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963264112] [2022-03-20 02:30:21,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:21,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:21,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:21,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:21,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:21,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-03-20 02:30:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:21,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:21,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:21,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:21,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-03-20 02:30:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:21,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:21,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:21,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963264112] [2022-03-20 02:30:21,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963264112] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:21,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:21,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 02:30:21,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969001937] [2022-03-20 02:30:21,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:21,427 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 02:30:21,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:21,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 02:30:21,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-03-20 02:30:21,428 INFO L87 Difference]: Start difference. First operand 501 states and 602 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-03-20 02:30:22,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:22,212 INFO L93 Difference]: Finished difference Result 839 states and 1046 transitions. [2022-03-20 02:30:22,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-20 02:30:22,212 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2022-03-20 02:30:22,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:22,214 INFO L225 Difference]: With dead ends: 839 [2022-03-20 02:30:22,214 INFO L226 Difference]: Without dead ends: 585 [2022-03-20 02:30:22,215 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-03-20 02:30:22,215 INFO L913 BasicCegarLoop]: 339 mSDtfsCounter, 448 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:22,215 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 1541 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-20 02:30:22,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-03-20 02:30:22,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 465. [2022-03-20 02:30:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.2136986301369863) internal successors, (443), 371 states have internal predecessors, (443), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (60), 53 states have call predecessors, (60), 49 states have call successors, (60) [2022-03-20 02:30:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 556 transitions. [2022-03-20 02:30:22,260 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 556 transitions. Word has length 83 [2022-03-20 02:30:22,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:22,260 INFO L478 AbstractCegarLoop]: Abstraction has 465 states and 556 transitions. [2022-03-20 02:30:22,261 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-03-20 02:30:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 556 transitions. [2022-03-20 02:30:22,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-03-20 02:30:22,261 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:22,261 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:22,262 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-03-20 02:30:22,262 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:22,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:22,262 INFO L85 PathProgramCache]: Analyzing trace with hash -564339607, now seen corresponding path program 1 times [2022-03-20 02:30:22,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:22,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69866708] [2022-03-20 02:30:22,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:22,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:22,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:22,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:22,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:22,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:22,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:22,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:22,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:22,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:22,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:22,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:22,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:22,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:22,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-03-20 02:30:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:22,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:22,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:22,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69866708] [2022-03-20 02:30:22,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69866708] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:22,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:22,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-20 02:30:22,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783674951] [2022-03-20 02:30:22,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:22,497 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-20 02:30:22,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:22,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-20 02:30:22,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-03-20 02:30:22,498 INFO L87 Difference]: Start difference. First operand 465 states and 556 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-03-20 02:30:23,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:23,391 INFO L93 Difference]: Finished difference Result 526 states and 629 transitions. [2022-03-20 02:30:23,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-20 02:30:23,392 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2022-03-20 02:30:23,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:23,394 INFO L225 Difference]: With dead ends: 526 [2022-03-20 02:30:23,394 INFO L226 Difference]: Without dead ends: 505 [2022-03-20 02:30:23,394 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2022-03-20 02:30:23,395 INFO L913 BasicCegarLoop]: 289 mSDtfsCounter, 463 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1550 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:23,395 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [471 Valid, 1550 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-20 02:30:23,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-03-20 02:30:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 473. [2022-03-20 02:30:23,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 372 states have (on average 1.2096774193548387) internal successors, (450), 378 states have internal predecessors, (450), 53 states have call successors, (53), 41 states have call predecessors, (53), 47 states have return successors, (63), 54 states have call predecessors, (63), 49 states have call successors, (63) [2022-03-20 02:30:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 566 transitions. [2022-03-20 02:30:23,448 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 566 transitions. Word has length 88 [2022-03-20 02:30:23,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:23,448 INFO L478 AbstractCegarLoop]: Abstraction has 473 states and 566 transitions. [2022-03-20 02:30:23,448 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-03-20 02:30:23,448 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 566 transitions. [2022-03-20 02:30:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-03-20 02:30:23,449 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:23,449 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:23,450 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-03-20 02:30:23,450 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:23,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:23,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1551103562, now seen corresponding path program 1 times [2022-03-20 02:30:23,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:23,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204266206] [2022-03-20 02:30:23,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:23,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:23,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:23,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:23,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:23,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:23,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:23,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:23,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:23,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:23,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:23,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:23,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-03-20 02:30:23,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:23,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:23,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:23,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204266206] [2022-03-20 02:30:23,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204266206] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:23,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:23,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-20 02:30:23,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136430559] [2022-03-20 02:30:23,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:23,700 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-20 02:30:23,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:23,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-20 02:30:23,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-03-20 02:30:23,701 INFO L87 Difference]: Start difference. First operand 473 states and 566 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-03-20 02:30:24,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:24,510 INFO L93 Difference]: Finished difference Result 526 states and 628 transitions. [2022-03-20 02:30:24,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-20 02:30:24,510 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2022-03-20 02:30:24,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:24,511 INFO L225 Difference]: With dead ends: 526 [2022-03-20 02:30:24,512 INFO L226 Difference]: Without dead ends: 505 [2022-03-20 02:30:24,512 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-03-20 02:30:24,512 INFO L913 BasicCegarLoop]: 305 mSDtfsCounter, 343 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1702 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:24,512 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 1702 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1598 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-20 02:30:24,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-03-20 02:30:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 465. [2022-03-20 02:30:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.210958904109589) internal successors, (442), 371 states have internal predecessors, (442), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (60), 53 states have call predecessors, (60), 49 states have call successors, (60) [2022-03-20 02:30:24,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 555 transitions. [2022-03-20 02:30:24,549 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 555 transitions. Word has length 89 [2022-03-20 02:30:24,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:24,549 INFO L478 AbstractCegarLoop]: Abstraction has 465 states and 555 transitions. [2022-03-20 02:30:24,549 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-03-20 02:30:24,550 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 555 transitions. [2022-03-20 02:30:24,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-03-20 02:30:24,551 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:24,551 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:24,551 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-03-20 02:30:24,551 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:24,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:24,551 INFO L85 PathProgramCache]: Analyzing trace with hash 945867422, now seen corresponding path program 1 times [2022-03-20 02:30:24,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:24,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19611787] [2022-03-20 02:30:24,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:24,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:24,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:24,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:24,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:24,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:24,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-20 02:30:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:24,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 02:30:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:24,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 02:30:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:24,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-03-20 02:30:24,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:24,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:24,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19611787] [2022-03-20 02:30:24,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19611787] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:24,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:24,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 02:30:24,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252551206] [2022-03-20 02:30:24,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:24,743 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 02:30:24,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:24,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 02:30:24,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-03-20 02:30:24,743 INFO L87 Difference]: Start difference. First operand 465 states and 555 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-03-20 02:30:25,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:25,778 INFO L93 Difference]: Finished difference Result 910 states and 1073 transitions. [2022-03-20 02:30:25,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-20 02:30:25,778 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2022-03-20 02:30:25,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:25,780 INFO L225 Difference]: With dead ends: 910 [2022-03-20 02:30:25,780 INFO L226 Difference]: Without dead ends: 611 [2022-03-20 02:30:25,781 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2022-03-20 02:30:25,782 INFO L913 BasicCegarLoop]: 318 mSDtfsCounter, 622 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:25,782 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [629 Valid, 517 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-20 02:30:25,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-03-20 02:30:25,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 586. [2022-03-20 02:30:25,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 462 states have (on average 1.2034632034632036) internal successors, (556), 470 states have internal predecessors, (556), 61 states have call successors, (61), 53 states have call predecessors, (61), 62 states have return successors, (72), 63 states have call predecessors, (72), 57 states have call successors, (72) [2022-03-20 02:30:25,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 689 transitions. [2022-03-20 02:30:25,834 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 689 transitions. Word has length 92 [2022-03-20 02:30:25,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:25,834 INFO L478 AbstractCegarLoop]: Abstraction has 586 states and 689 transitions. [2022-03-20 02:30:25,834 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-03-20 02:30:25,834 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 689 transitions. [2022-03-20 02:30:25,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-03-20 02:30:25,835 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:25,835 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:25,835 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-03-20 02:30:25,835 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:25,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:25,836 INFO L85 PathProgramCache]: Analyzing trace with hash 680283571, now seen corresponding path program 1 times [2022-03-20 02:30:25,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:25,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776469201] [2022-03-20 02:30:25,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:25,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:25,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:25,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:25,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:25,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:26,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-03-20 02:30:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:26,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 02:30:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:26,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-03-20 02:30:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:26,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-03-20 02:30:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:26,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:26,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776469201] [2022-03-20 02:30:26,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776469201] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:26,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:26,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-03-20 02:30:26,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739753656] [2022-03-20 02:30:26,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:26,062 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-03-20 02:30:26,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:26,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-03-20 02:30:26,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-03-20 02:30:26,062 INFO L87 Difference]: Start difference. First operand 586 states and 689 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-20 02:30:26,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:26,979 INFO L93 Difference]: Finished difference Result 590 states and 692 transitions. [2022-03-20 02:30:26,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-20 02:30:26,979 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) Word has length 93 [2022-03-20 02:30:26,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:26,981 INFO L225 Difference]: With dead ends: 590 [2022-03-20 02:30:26,981 INFO L226 Difference]: Without dead ends: 498 [2022-03-20 02:30:26,981 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-03-20 02:30:26,982 INFO L913 BasicCegarLoop]: 245 mSDtfsCounter, 415 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:26,982 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [428 Valid, 644 Invalid, 2238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 2108 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-03-20 02:30:26,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-03-20 02:30:27,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2022-03-20 02:30:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.20671834625323) internal successors, (467), 394 states have internal predecessors, (467), 54 states have call successors, (54), 47 states have call predecessors, (54), 54 states have return successors, (64), 55 states have call predecessors, (64), 51 states have call successors, (64) [2022-03-20 02:30:27,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 585 transitions. [2022-03-20 02:30:27,024 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 585 transitions. Word has length 93 [2022-03-20 02:30:27,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:27,024 INFO L478 AbstractCegarLoop]: Abstraction has 496 states and 585 transitions. [2022-03-20 02:30:27,024 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-03-20 02:30:27,025 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 585 transitions. [2022-03-20 02:30:27,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-20 02:30:27,025 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:27,026 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:27,026 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-03-20 02:30:27,026 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:27,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:27,026 INFO L85 PathProgramCache]: Analyzing trace with hash 313967105, now seen corresponding path program 1 times [2022-03-20 02:30:27,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:27,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778098309] [2022-03-20 02:30:27,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:27,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-03-20 02:30:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-03-20 02:30:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:27,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:27,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778098309] [2022-03-20 02:30:27,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778098309] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:27,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:27,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 02:30:27,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757737740] [2022-03-20 02:30:27,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:27,234 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 02:30:27,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:27,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 02:30:27,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-03-20 02:30:27,235 INFO L87 Difference]: Start difference. First operand 496 states and 585 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-03-20 02:30:27,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:27,665 INFO L93 Difference]: Finished difference Result 531 states and 619 transitions. [2022-03-20 02:30:27,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 02:30:27,665 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2022-03-20 02:30:27,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:27,666 INFO L225 Difference]: With dead ends: 531 [2022-03-20 02:30:27,666 INFO L226 Difference]: Without dead ends: 492 [2022-03-20 02:30:27,667 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-03-20 02:30:27,667 INFO L913 BasicCegarLoop]: 198 mSDtfsCounter, 220 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:27,667 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 991 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 02:30:27,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-03-20 02:30:27,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 439. [2022-03-20 02:30:27,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 343 states have (on average 1.19533527696793) internal successors, (410), 349 states have internal predecessors, (410), 47 states have call successors, (47), 42 states have call predecessors, (47), 48 states have return successors, (55), 48 states have call predecessors, (55), 44 states have call successors, (55) [2022-03-20 02:30:27,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 512 transitions. [2022-03-20 02:30:27,708 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 512 transitions. Word has length 99 [2022-03-20 02:30:27,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:27,708 INFO L478 AbstractCegarLoop]: Abstraction has 439 states and 512 transitions. [2022-03-20 02:30:27,708 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-03-20 02:30:27,708 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 512 transitions. [2022-03-20 02:30:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-03-20 02:30:27,709 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:27,709 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:27,709 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-03-20 02:30:27,709 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:27,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:27,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1018925480, now seen corresponding path program 1 times [2022-03-20 02:30:27,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:27,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603614671] [2022-03-20 02:30:27,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:27,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:27,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:27,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-03-20 02:30:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-03-20 02:30:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:27,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:27,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:27,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603614671] [2022-03-20 02:30:27,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603614671] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:27,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:27,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-20 02:30:27,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466499011] [2022-03-20 02:30:27,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:27,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-20 02:30:27,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:27,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-20 02:30:27,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-03-20 02:30:27,962 INFO L87 Difference]: Start difference. First operand 439 states and 512 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-03-20 02:30:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:28,963 INFO L93 Difference]: Finished difference Result 842 states and 986 transitions. [2022-03-20 02:30:28,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-03-20 02:30:28,964 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 99 [2022-03-20 02:30:28,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:28,967 INFO L225 Difference]: With dead ends: 842 [2022-03-20 02:30:28,967 INFO L226 Difference]: Without dead ends: 797 [2022-03-20 02:30:28,967 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2022-03-20 02:30:28,968 INFO L913 BasicCegarLoop]: 348 mSDtfsCounter, 414 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1636 SdHoareTripleChecker+Invalid, 1516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:28,968 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 1636 Invalid, 1516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1377 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-03-20 02:30:28,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2022-03-20 02:30:29,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 419. [2022-03-20 02:30:29,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 327 states have (on average 1.1957186544342508) internal successors, (391), 332 states have internal predecessors, (391), 44 states have call successors, (44), 41 states have call predecessors, (44), 47 states have return successors, (52), 45 states have call predecessors, (52), 41 states have call successors, (52) [2022-03-20 02:30:29,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 487 transitions. [2022-03-20 02:30:29,023 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 487 transitions. Word has length 99 [2022-03-20 02:30:29,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:29,023 INFO L478 AbstractCegarLoop]: Abstraction has 419 states and 487 transitions. [2022-03-20 02:30:29,023 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-03-20 02:30:29,024 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 487 transitions. [2022-03-20 02:30:29,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-03-20 02:30:29,024 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:29,025 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:29,025 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-03-20 02:30:29,025 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:29,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:29,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1434876468, now seen corresponding path program 1 times [2022-03-20 02:30:29,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:29,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899538176] [2022-03-20 02:30:29,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:29,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:29,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:29,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:29,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:29,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:29,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 02:30:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:29,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 02:30:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:29,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:29,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:29,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:29,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 02:30:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:29,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:29,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-03-20 02:30:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:29,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:29,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899538176] [2022-03-20 02:30:29,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899538176] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:29,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:29,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-03-20 02:30:29,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167120024] [2022-03-20 02:30:29,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:29,331 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-20 02:30:29,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:29,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-20 02:30:29,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-03-20 02:30:29,332 INFO L87 Difference]: Start difference. First operand 419 states and 487 transitions. Second operand has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2022-03-20 02:30:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:30,049 INFO L93 Difference]: Finished difference Result 561 states and 656 transitions. [2022-03-20 02:30:30,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-20 02:30:30,049 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2022-03-20 02:30:30,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:30,051 INFO L225 Difference]: With dead ends: 561 [2022-03-20 02:30:30,051 INFO L226 Difference]: Without dead ends: 438 [2022-03-20 02:30:30,052 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2022-03-20 02:30:30,052 INFO L913 BasicCegarLoop]: 179 mSDtfsCounter, 176 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:30,052 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 1148 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-20 02:30:30,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-03-20 02:30:30,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 428. [2022-03-20 02:30:30,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 335 states have (on average 1.182089552238806) internal successors, (396), 341 states have internal predecessors, (396), 45 states have call successors, (45), 41 states have call predecessors, (45), 47 states have return successors, (52), 45 states have call predecessors, (52), 41 states have call successors, (52) [2022-03-20 02:30:30,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 493 transitions. [2022-03-20 02:30:30,116 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 493 transitions. Word has length 104 [2022-03-20 02:30:30,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:30,116 INFO L478 AbstractCegarLoop]: Abstraction has 428 states and 493 transitions. [2022-03-20 02:30:30,116 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2022-03-20 02:30:30,116 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 493 transitions. [2022-03-20 02:30:30,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-03-20 02:30:30,117 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:30,117 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-03-20 02:30:30,118 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-03-20 02:30:30,118 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:30,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:30,118 INFO L85 PathProgramCache]: Analyzing trace with hash -679170353, now seen corresponding path program 1 times [2022-03-20 02:30:30,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:30,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734394154] [2022-03-20 02:30:30,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:30,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:30,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:30,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:30,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:30,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:30,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:30,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-03-20 02:30:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:30,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:30,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:30,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:30,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-03-20 02:30:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:30,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:30,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:30,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 02:30:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:30,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:30,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:30,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:30,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:30,308 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-20 02:30:30,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:30,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734394154] [2022-03-20 02:30:30,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734394154] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:30,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:30,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-03-20 02:30:30,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64785449] [2022-03-20 02:30:30,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:30,309 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-03-20 02:30:30,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:30,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-03-20 02:30:30,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-03-20 02:30:30,310 INFO L87 Difference]: Start difference. First operand 428 states and 493 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-03-20 02:30:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:30,885 INFO L93 Difference]: Finished difference Result 749 states and 870 transitions. [2022-03-20 02:30:30,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 02:30:30,886 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 113 [2022-03-20 02:30:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:30,887 INFO L225 Difference]: With dead ends: 749 [2022-03-20 02:30:30,887 INFO L226 Difference]: Without dead ends: 440 [2022-03-20 02:30:30,888 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2022-03-20 02:30:30,889 INFO L913 BasicCegarLoop]: 176 mSDtfsCounter, 137 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:30,889 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 698 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 02:30:30,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-03-20 02:30:30,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 436. [2022-03-20 02:30:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 341 states have (on average 1.1788856304985338) internal successors, (402), 347 states have internal predecessors, (402), 45 states have call successors, (45), 41 states have call predecessors, (45), 49 states have return successors, (54), 47 states have call predecessors, (54), 41 states have call successors, (54) [2022-03-20 02:30:30,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 501 transitions. [2022-03-20 02:30:30,951 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 501 transitions. Word has length 113 [2022-03-20 02:30:30,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:30,952 INFO L478 AbstractCegarLoop]: Abstraction has 436 states and 501 transitions. [2022-03-20 02:30:30,952 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-03-20 02:30:30,952 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 501 transitions. [2022-03-20 02:30:30,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-03-20 02:30:30,953 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:30,953 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-03-20 02:30:30,953 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-03-20 02:30:30,953 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:30,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:30,954 INFO L85 PathProgramCache]: Analyzing trace with hash 857265326, now seen corresponding path program 1 times [2022-03-20 02:30:30,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:30,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061419852] [2022-03-20 02:30:30,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:30,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-03-20 02:30:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-03-20 02:30:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 02:30:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,200 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-03-20 02:30:31,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:31,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061419852] [2022-03-20 02:30:31,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061419852] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:31,200 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:31,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 02:30:31,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281721336] [2022-03-20 02:30:31,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:31,201 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 02:30:31,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:31,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 02:30:31,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-03-20 02:30:31,201 INFO L87 Difference]: Start difference. First operand 436 states and 501 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) [2022-03-20 02:30:31,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:31,583 INFO L93 Difference]: Finished difference Result 471 states and 535 transitions. [2022-03-20 02:30:31,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-20 02:30:31,584 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) Word has length 113 [2022-03-20 02:30:31,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:31,585 INFO L225 Difference]: With dead ends: 471 [2022-03-20 02:30:31,585 INFO L226 Difference]: Without dead ends: 387 [2022-03-20 02:30:31,585 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-03-20 02:30:31,585 INFO L913 BasicCegarLoop]: 181 mSDtfsCounter, 217 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:31,585 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 805 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 02:30:31,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-03-20 02:30:31,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 249. [2022-03-20 02:30:31,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 195 states have (on average 1.1384615384615384) internal successors, (222), 197 states have internal predecessors, (222), 26 states have call successors, (26), 26 states have call predecessors, (26), 27 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2022-03-20 02:30:31,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 275 transitions. [2022-03-20 02:30:31,626 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 275 transitions. Word has length 113 [2022-03-20 02:30:31,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:31,627 INFO L478 AbstractCegarLoop]: Abstraction has 249 states and 275 transitions. [2022-03-20 02:30:31,627 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) [2022-03-20 02:30:31,627 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 275 transitions. [2022-03-20 02:30:31,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-03-20 02:30:31,628 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:31,628 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:31,628 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-03-20 02:30:31,628 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:31,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:31,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2021247887, now seen corresponding path program 1 times [2022-03-20 02:30:31,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:31,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196565003] [2022-03-20 02:30:31,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:31,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 02:30:31,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 02:30:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:31,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:31,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 02:30:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:31,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-03-20 02:30:31,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-03-20 02:30:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:31,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:31,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:31,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196565003] [2022-03-20 02:30:31,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196565003] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:31,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:31,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-20 02:30:31,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927967973] [2022-03-20 02:30:31,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:31,879 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-20 02:30:31,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:31,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-20 02:30:31,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-03-20 02:30:31,880 INFO L87 Difference]: Start difference. First operand 249 states and 275 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-03-20 02:30:32,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:32,331 INFO L93 Difference]: Finished difference Result 293 states and 322 transitions. [2022-03-20 02:30:32,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 02:30:32,332 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2022-03-20 02:30:32,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:32,333 INFO L225 Difference]: With dead ends: 293 [2022-03-20 02:30:32,333 INFO L226 Difference]: Without dead ends: 263 [2022-03-20 02:30:32,333 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2022-03-20 02:30:32,334 INFO L913 BasicCegarLoop]: 175 mSDtfsCounter, 195 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:32,334 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 776 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 02:30:32,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-03-20 02:30:32,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 253. [2022-03-20 02:30:32,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 198 states have (on average 1.1363636363636365) internal successors, (225), 200 states have internal predecessors, (225), 26 states have call successors, (26), 26 states have call predecessors, (26), 28 states have return successors, (28), 26 states have call predecessors, (28), 24 states have call successors, (28) [2022-03-20 02:30:32,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 279 transitions. [2022-03-20 02:30:32,362 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 279 transitions. Word has length 120 [2022-03-20 02:30:32,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:32,362 INFO L478 AbstractCegarLoop]: Abstraction has 253 states and 279 transitions. [2022-03-20 02:30:32,362 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-03-20 02:30:32,362 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 279 transitions. [2022-03-20 02:30:32,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-03-20 02:30:32,363 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:32,363 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:32,363 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-03-20 02:30:32,363 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:32,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:32,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2092232912, now seen corresponding path program 1 times [2022-03-20 02:30:32,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:32,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733435489] [2022-03-20 02:30:32,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:32,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:32,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:32,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:32,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:32,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:32,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:32,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 02:30:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:32,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 02:30:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:32,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:32,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:32,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:32,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 02:30:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:32,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:32,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-03-20 02:30:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:32,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-03-20 02:30:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-03-20 02:30:32,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:32,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733435489] [2022-03-20 02:30:32,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733435489] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:32,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:32,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-20 02:30:32,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581536084] [2022-03-20 02:30:32,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:32,617 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-20 02:30:32,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:32,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-20 02:30:32,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-03-20 02:30:32,618 INFO L87 Difference]: Start difference. First operand 253 states and 279 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-03-20 02:30:33,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:33,102 INFO L93 Difference]: Finished difference Result 339 states and 377 transitions. [2022-03-20 02:30:33,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 02:30:33,103 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2022-03-20 02:30:33,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:33,104 INFO L225 Difference]: With dead ends: 339 [2022-03-20 02:30:33,104 INFO L226 Difference]: Without dead ends: 254 [2022-03-20 02:30:33,105 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2022-03-20 02:30:33,106 INFO L913 BasicCegarLoop]: 174 mSDtfsCounter, 119 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:33,106 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 741 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-03-20 02:30:33,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-03-20 02:30:33,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2022-03-20 02:30:33,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 194 states have (on average 1.1288659793814433) internal successors, (219), 196 states have internal predecessors, (219), 26 states have call successors, (26), 26 states have call predecessors, (26), 27 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2022-03-20 02:30:33,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 272 transitions. [2022-03-20 02:30:33,140 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 272 transitions. Word has length 120 [2022-03-20 02:30:33,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:33,140 INFO L478 AbstractCegarLoop]: Abstraction has 248 states and 272 transitions. [2022-03-20 02:30:33,140 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-03-20 02:30:33,141 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 272 transitions. [2022-03-20 02:30:33,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-03-20 02:30:33,141 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:33,142 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2022-03-20 02:30:33,142 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-03-20 02:30:33,142 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:33,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:33,142 INFO L85 PathProgramCache]: Analyzing trace with hash 90302461, now seen corresponding path program 1 times [2022-03-20 02:30:33,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:33,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305347349] [2022-03-20 02:30:33,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:33,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:33,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:33,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:33,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:33,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:33,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:33,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:33,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 02:30:33,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:33,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 02:30:33,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:33,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:33,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:33,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:33,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:33,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 02:30:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:33,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:33,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 02:30:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:33,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:33,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:33,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:33,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-03-20 02:30:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:33,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-03-20 02:30:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:33,563 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-03-20 02:30:33,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:33,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305347349] [2022-03-20 02:30:33,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305347349] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:33,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:33,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-03-20 02:30:33,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428317645] [2022-03-20 02:30:33,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:33,563 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-20 02:30:33,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:33,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-20 02:30:33,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2022-03-20 02:30:33,564 INFO L87 Difference]: Start difference. First operand 248 states and 272 transitions. Second operand has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-03-20 02:30:34,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:34,380 INFO L93 Difference]: Finished difference Result 320 states and 360 transitions. [2022-03-20 02:30:34,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-03-20 02:30:34,381 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 150 [2022-03-20 02:30:34,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:34,382 INFO L225 Difference]: With dead ends: 320 [2022-03-20 02:30:34,382 INFO L226 Difference]: Without dead ends: 285 [2022-03-20 02:30:34,382 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2022-03-20 02:30:34,382 INFO L913 BasicCegarLoop]: 165 mSDtfsCounter, 239 mSDsluCounter, 1268 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:34,383 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 1433 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1800 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-20 02:30:34,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-03-20 02:30:34,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 265. [2022-03-20 02:30:34,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 209 states have (on average 1.138755980861244) internal successors, (238), 211 states have internal predecessors, (238), 26 states have call successors, (26), 26 states have call predecessors, (26), 29 states have return successors, (29), 27 states have call predecessors, (29), 24 states have call successors, (29) [2022-03-20 02:30:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 293 transitions. [2022-03-20 02:30:34,411 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 293 transitions. Word has length 150 [2022-03-20 02:30:34,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:34,411 INFO L478 AbstractCegarLoop]: Abstraction has 265 states and 293 transitions. [2022-03-20 02:30:34,411 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-03-20 02:30:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 293 transitions. [2022-03-20 02:30:34,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-03-20 02:30:34,412 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:34,414 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:34,414 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-03-20 02:30:34,414 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:34,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:34,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1191115682, now seen corresponding path program 1 times [2022-03-20 02:30:34,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:34,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722352173] [2022-03-20 02:30:34,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:34,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:34,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:34,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:34,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:34,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:34,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:34,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 02:30:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:34,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 02:30:34,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:34,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:34,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:34,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:34,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:34,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 02:30:34,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:34,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:34,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 02:30:34,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:34,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:34,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:34,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:34,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:34,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-03-20 02:30:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:34,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-03-20 02:30:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-03-20 02:30:34,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:34,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722352173] [2022-03-20 02:30:34,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722352173] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:34,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:34,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-03-20 02:30:34,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072170887] [2022-03-20 02:30:34,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:34,728 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-03-20 02:30:34,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:34,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-03-20 02:30:34,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-03-20 02:30:34,728 INFO L87 Difference]: Start difference. First operand 265 states and 293 transitions. Second operand has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2022-03-20 02:30:35,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:35,339 INFO L93 Difference]: Finished difference Result 360 states and 402 transitions. [2022-03-20 02:30:35,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-03-20 02:30:35,340 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) Word has length 151 [2022-03-20 02:30:35,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:35,344 INFO L225 Difference]: With dead ends: 360 [2022-03-20 02:30:35,344 INFO L226 Difference]: Without dead ends: 279 [2022-03-20 02:30:35,345 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2022-03-20 02:30:35,345 INFO L913 BasicCegarLoop]: 184 mSDtfsCounter, 214 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:35,345 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [215 Valid, 1117 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-20 02:30:35,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-03-20 02:30:35,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 265. [2022-03-20 02:30:35,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 209 states have (on average 1.1339712918660287) internal successors, (237), 211 states have internal predecessors, (237), 26 states have call successors, (26), 26 states have call predecessors, (26), 29 states have return successors, (29), 27 states have call predecessors, (29), 24 states have call successors, (29) [2022-03-20 02:30:35,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 292 transitions. [2022-03-20 02:30:35,391 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 292 transitions. Word has length 151 [2022-03-20 02:30:35,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:35,392 INFO L478 AbstractCegarLoop]: Abstraction has 265 states and 292 transitions. [2022-03-20 02:30:35,392 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2022-03-20 02:30:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 292 transitions. [2022-03-20 02:30:35,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-03-20 02:30:35,393 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:35,393 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:35,393 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-03-20 02:30:35,393 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:35,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:35,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1843438784, now seen corresponding path program 1 times [2022-03-20 02:30:35,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:35,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368341842] [2022-03-20 02:30:35,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:35,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:35,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:35,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:35,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:35,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:35,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 02:30:35,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:35,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 02:30:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:35,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:35,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:35,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:35,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:35,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 02:30:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:35,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:35,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 02:30:35,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:35,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:35,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:35,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:35,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-03-20 02:30:35,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:35,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-03-20 02:30:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:35,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-03-20 02:30:35,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:35,779 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-20 02:30:35,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:35,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368341842] [2022-03-20 02:30:35,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368341842] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:35,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:35,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-03-20 02:30:35,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308808432] [2022-03-20 02:30:35,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:35,780 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-03-20 02:30:35,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:35,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-03-20 02:30:35,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2022-03-20 02:30:35,781 INFO L87 Difference]: Start difference. First operand 265 states and 292 transitions. Second operand has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2022-03-20 02:30:36,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:36,529 INFO L93 Difference]: Finished difference Result 306 states and 340 transitions. [2022-03-20 02:30:36,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-03-20 02:30:36,529 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) Word has length 153 [2022-03-20 02:30:36,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:36,530 INFO L225 Difference]: With dead ends: 306 [2022-03-20 02:30:36,530 INFO L226 Difference]: Without dead ends: 265 [2022-03-20 02:30:36,531 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2022-03-20 02:30:36,531 INFO L913 BasicCegarLoop]: 165 mSDtfsCounter, 214 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 1352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:36,531 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 1169 Invalid, 1352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-20 02:30:36,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-03-20 02:30:36,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2022-03-20 02:30:36,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 205 states have (on average 1.1219512195121952) internal successors, (230), 207 states have internal predecessors, (230), 25 states have call successors, (25), 25 states have call predecessors, (25), 28 states have return successors, (28), 26 states have call predecessors, (28), 23 states have call successors, (28) [2022-03-20 02:30:36,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 283 transitions. [2022-03-20 02:30:36,560 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 283 transitions. Word has length 153 [2022-03-20 02:30:36,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:36,561 INFO L478 AbstractCegarLoop]: Abstraction has 259 states and 283 transitions. [2022-03-20 02:30:36,561 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2022-03-20 02:30:36,561 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 283 transitions. [2022-03-20 02:30:36,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-03-20 02:30:36,562 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:36,562 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:36,562 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-03-20 02:30:36,562 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:36,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:36,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2010865059, now seen corresponding path program 1 times [2022-03-20 02:30:36,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:36,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303419713] [2022-03-20 02:30:36,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:36,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:36,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:36,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:36,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:36,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:36,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:36,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:36,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 02:30:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:36,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 02:30:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:36,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:36,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:36,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:36,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 02:30:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:36,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:36,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 02:30:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:36,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:36,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:36,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:36,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-03-20 02:30:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:36,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-03-20 02:30:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:36,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-03-20 02:30:36,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:36,827 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-03-20 02:30:36,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:36,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303419713] [2022-03-20 02:30:36,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303419713] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:36,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:36,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-20 02:30:36,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386972625] [2022-03-20 02:30:36,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:36,829 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-20 02:30:36,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:36,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-20 02:30:36,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-03-20 02:30:36,829 INFO L87 Difference]: Start difference. First operand 259 states and 283 transitions. Second operand has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-03-20 02:30:37,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:37,277 INFO L93 Difference]: Finished difference Result 320 states and 349 transitions. [2022-03-20 02:30:37,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 02:30:37,277 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 158 [2022-03-20 02:30:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:37,278 INFO L225 Difference]: With dead ends: 320 [2022-03-20 02:30:37,278 INFO L226 Difference]: Without dead ends: 245 [2022-03-20 02:30:37,278 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2022-03-20 02:30:37,278 INFO L913 BasicCegarLoop]: 144 mSDtfsCounter, 289 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:37,279 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 558 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 02:30:37,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-03-20 02:30:37,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 231. [2022-03-20 02:30:37,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 181 states have (on average 1.1049723756906078) internal successors, (200), 183 states have internal predecessors, (200), 24 states have call successors, (24), 24 states have call predecessors, (24), 25 states have return successors, (25), 23 states have call predecessors, (25), 22 states have call successors, (25) [2022-03-20 02:30:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2022-03-20 02:30:37,305 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 158 [2022-03-20 02:30:37,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:37,305 INFO L478 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2022-03-20 02:30:37,305 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-03-20 02:30:37,305 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2022-03-20 02:30:37,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-03-20 02:30:37,306 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:37,306 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:37,306 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-03-20 02:30:37,306 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:37,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:37,307 INFO L85 PathProgramCache]: Analyzing trace with hash 473656636, now seen corresponding path program 1 times [2022-03-20 02:30:37,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:37,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583569830] [2022-03-20 02:30:37,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:37,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:37,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:37,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:37,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:37,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:37,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 02:30:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:37,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 02:30:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:37,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:37,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:37,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:37,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 02:30:37,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:37,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:37,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:37,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 02:30:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:37,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:37,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:37,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:37,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:37,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-03-20 02:30:37,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:37,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-03-20 02:30:37,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:37,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-03-20 02:30:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:37,595 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-03-20 02:30:37,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:37,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583569830] [2022-03-20 02:30:37,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583569830] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:37,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:37,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-03-20 02:30:37,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985898436] [2022-03-20 02:30:37,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:37,596 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-03-20 02:30:37,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:37,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-03-20 02:30:37,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-03-20 02:30:37,597 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-03-20 02:30:37,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:37,988 INFO L93 Difference]: Finished difference Result 296 states and 320 transitions. [2022-03-20 02:30:37,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-03-20 02:30:37,988 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 160 [2022-03-20 02:30:37,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:37,989 INFO L225 Difference]: With dead ends: 296 [2022-03-20 02:30:37,989 INFO L226 Difference]: Without dead ends: 210 [2022-03-20 02:30:37,989 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2022-03-20 02:30:37,990 INFO L913 BasicCegarLoop]: 147 mSDtfsCounter, 234 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:37,990 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 736 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-03-20 02:30:37,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-03-20 02:30:38,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-03-20 02:30:38,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 163 states have (on average 1.0920245398773005) internal successors, (178), 164 states have internal predecessors, (178), 23 states have call successors, (23), 23 states have call predecessors, (23), 23 states have return successors, (23), 22 states have call predecessors, (23), 21 states have call successors, (23) [2022-03-20 02:30:38,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 224 transitions. [2022-03-20 02:30:38,012 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 224 transitions. Word has length 160 [2022-03-20 02:30:38,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:38,012 INFO L478 AbstractCegarLoop]: Abstraction has 210 states and 224 transitions. [2022-03-20 02:30:38,013 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-03-20 02:30:38,013 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 224 transitions. [2022-03-20 02:30:38,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-03-20 02:30:38,013 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:38,014 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:38,014 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-03-20 02:30:38,014 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:38,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:38,014 INFO L85 PathProgramCache]: Analyzing trace with hash -155521920, now seen corresponding path program 1 times [2022-03-20 02:30:38,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:38,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149894112] [2022-03-20 02:30:38,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:38,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:38,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:38,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:38,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:38,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:38,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:38,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:38,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 02:30:38,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:38,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 02:30:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:38,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:38,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:38,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:38,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:38,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 02:30:38,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:38,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:38,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 02:30:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:38,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:38,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:38,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:38,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-03-20 02:30:38,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:38,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-03-20 02:30:38,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:38,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-03-20 02:30:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:38,355 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-20 02:30:38,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:38,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149894112] [2022-03-20 02:30:38,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149894112] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:38,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:38,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-03-20 02:30:38,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304732330] [2022-03-20 02:30:38,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:38,356 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-03-20 02:30:38,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:38,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-03-20 02:30:38,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-03-20 02:30:38,357 INFO L87 Difference]: Start difference. First operand 210 states and 224 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-03-20 02:30:39,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:39,325 INFO L93 Difference]: Finished difference Result 414 states and 443 transitions. [2022-03-20 02:30:39,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-03-20 02:30:39,325 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 161 [2022-03-20 02:30:39,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:39,326 INFO L225 Difference]: With dead ends: 414 [2022-03-20 02:30:39,326 INFO L226 Difference]: Without dead ends: 213 [2022-03-20 02:30:39,327 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2022-03-20 02:30:39,327 INFO L913 BasicCegarLoop]: 137 mSDtfsCounter, 551 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:39,327 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [552 Valid, 592 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-03-20 02:30:39,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-03-20 02:30:39,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2022-03-20 02:30:39,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 163 states have (on average 1.0858895705521472) internal successors, (177), 164 states have internal predecessors, (177), 23 states have call successors, (23), 23 states have call predecessors, (23), 23 states have return successors, (23), 22 states have call predecessors, (23), 21 states have call successors, (23) [2022-03-20 02:30:39,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 223 transitions. [2022-03-20 02:30:39,357 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 223 transitions. Word has length 161 [2022-03-20 02:30:39,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:39,357 INFO L478 AbstractCegarLoop]: Abstraction has 210 states and 223 transitions. [2022-03-20 02:30:39,357 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-03-20 02:30:39,357 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 223 transitions. [2022-03-20 02:30:39,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-03-20 02:30:39,358 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 02:30:39,358 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 02:30:39,358 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-03-20 02:30:39,358 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 02:30:39,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 02:30:39,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1078689346, now seen corresponding path program 1 times [2022-03-20 02:30:39,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 02:30:39,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924658907] [2022-03-20 02:30:39,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 02:30:39,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 02:30:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:39,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 02:30:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:39,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 02:30:39,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:39,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 02:30:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:39,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-03-20 02:30:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:39,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-03-20 02:30:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:39,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-03-20 02:30:39,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:39,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:39,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:39,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:39,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:39,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-03-20 02:30:39,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:39,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:39,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-03-20 02:30:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:39,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-03-20 02:30:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:39,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-03-20 02:30:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:39,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-03-20 02:30:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:39,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-03-20 02:30:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:39,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-03-20 02:30:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:39,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-03-20 02:30:39,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 02:30:39,768 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-03-20 02:30:39,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 02:30:39,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924658907] [2022-03-20 02:30:39,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924658907] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 02:30:39,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 02:30:39,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-03-20 02:30:39,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495437814] [2022-03-20 02:30:39,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 02:30:39,769 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-03-20 02:30:39,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-03-20 02:30:39,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-03-20 02:30:39,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-03-20 02:30:39,769 INFO L87 Difference]: Start difference. First operand 210 states and 223 transitions. Second operand has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2022-03-20 02:30:40,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 02:30:40,715 INFO L93 Difference]: Finished difference Result 213 states and 227 transitions. [2022-03-20 02:30:40,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-03-20 02:30:40,715 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 161 [2022-03-20 02:30:40,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 02:30:40,716 INFO L225 Difference]: With dead ends: 213 [2022-03-20 02:30:40,716 INFO L226 Difference]: Without dead ends: 0 [2022-03-20 02:30:40,718 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2022-03-20 02:30:40,718 INFO L913 BasicCegarLoop]: 124 mSDtfsCounter, 443 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 1812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-03-20 02:30:40,719 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 741 Invalid, 1812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-03-20 02:30:40,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-20 02:30:40,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-20 02:30:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-03-20 02:30:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-20 02:30:40,719 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2022-03-20 02:30:40,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 02:30:40,720 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-20 02:30:40,720 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2022-03-20 02:30:40,720 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-20 02:30:40,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-20 02:30:40,722 INFO L788 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 02:30:40,726 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-03-20 02:30:40,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.