/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05ce600 [2022-02-24 00:30:38,157 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-24 00:30:38,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-24 00:30:38,186 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-24 00:30:38,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-24 00:30:38,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-24 00:30:38,192 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-24 00:30:38,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-24 00:30:38,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-24 00:30:38,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-24 00:30:38,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-24 00:30:38,205 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-24 00:30:38,205 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-24 00:30:38,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-24 00:30:38,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-24 00:30:38,209 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-24 00:30:38,210 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-24 00:30:38,210 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-24 00:30:38,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-24 00:30:38,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-24 00:30:38,216 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-24 00:30:38,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-24 00:30:38,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-24 00:30:38,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-24 00:30:38,221 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-24 00:30:38,221 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-24 00:30:38,221 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-24 00:30:38,222 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-24 00:30:38,222 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-24 00:30:38,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-24 00:30:38,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-24 00:30:38,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-24 00:30:38,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-24 00:30:38,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-24 00:30:38,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-24 00:30:38,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-24 00:30:38,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-24 00:30:38,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-24 00:30:38,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-24 00:30:38,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-24 00:30:38,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-24 00:30:38,230 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-02-24 00:30:38,251 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-24 00:30:38,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-24 00:30:38,252 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-24 00:30:38,253 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-24 00:30:38,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-24 00:30:38,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-24 00:30:38,253 INFO L138 SettingsManager]: * Use SBE=true [2022-02-24 00:30:38,254 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-24 00:30:38,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-24 00:30:38,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-24 00:30:38,254 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-24 00:30:38,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-24 00:30:38,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-24 00:30:38,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-24 00:30:38,255 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-24 00:30:38,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-24 00:30:38,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-24 00:30:38,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-24 00:30:38,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-24 00:30:38,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 00:30:38,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-24 00:30:38,255 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-24 00:30:38,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-24 00:30:38,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-24 00:30:38,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-24 00:30:38,256 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-24 00:30:38,256 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-02-24 00:30:38,256 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-24 00:30:38,256 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-24 00:30:38,257 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR 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-02-24 00:30:38,450 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-24 00:30:38,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-24 00:30:38,468 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-24 00:30:38,469 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-24 00:30:38,470 INFO L275 PluginConnector]: CDTParser initialized [2022-02-24 00:30:38,471 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-02-24 00:30:38,511 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42be6be7/00a66e31f144425eb0361dc8bcc1e438/FLAG15b280ab1 [2022-02-24 00:30:38,933 INFO L306 CDTParser]: Found 1 translation units. [2022-02-24 00:30:38,934 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-02-24 00:30:38,947 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42be6be7/00a66e31f144425eb0361dc8bcc1e438/FLAG15b280ab1 [2022-02-24 00:30:38,959 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42be6be7/00a66e31f144425eb0361dc8bcc1e438 [2022-02-24 00:30:38,961 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-24 00:30:38,962 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-02-24 00:30:38,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-24 00:30:38,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-24 00:30:38,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-24 00:30:38,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 12:30:38" (1/1) ... [2022-02-24 00:30:38,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fea607a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:30:38, skipping insertion in model container [2022-02-24 00:30:38,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.02 12:30:38" (1/1) ... [2022-02-24 00:30:38,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-24 00:30:39,035 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-24 00:30:39,325 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-02-24 00:30:39,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 00:30:39,333 INFO L203 MainTranslator]: Completed pre-run [2022-02-24 00:30:39,392 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-02-24 00:30:39,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-24 00:30:39,403 INFO L208 MainTranslator]: Completed translation [2022-02-24 00:30:39,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:30:39 WrapperNode [2022-02-24 00:30:39,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-24 00:30:39,404 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-24 00:30:39,404 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-24 00:30:39,404 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-24 00:30:39,412 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:30:39" (1/1) ... [2022-02-24 00:30:39,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:30:39" (1/1) ... [2022-02-24 00:30:39,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:30:39" (1/1) ... [2022-02-24 00:30:39,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:30:39" (1/1) ... [2022-02-24 00:30:39,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:30:39" (1/1) ... [2022-02-24 00:30:39,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:30:39" (1/1) ... [2022-02-24 00:30:39,486 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:30:39" (1/1) ... [2022-02-24 00:30:39,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-24 00:30:39,504 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-24 00:30:39,504 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-24 00:30:39,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-24 00:30:39,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:30:39" (1/1) ... [2022-02-24 00:30:39,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-24 00:30:39,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-24 00:30:39,545 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-02-24 00:30:39,552 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-02-24 00:30:39,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-24 00:30:39,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-24 00:30:39,575 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-24 00:30:39,575 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-02-24 00:30:39,575 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2022-02-24 00:30:39,576 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2022-02-24 00:30:39,576 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2022-02-24 00:30:39,576 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2022-02-24 00:30:39,577 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2022-02-24 00:30:39,578 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2022-02-24 00:30:39,578 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2022-02-24 00:30:39,578 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-02-24 00:30:39,578 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-24 00:30:39,578 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-02-24 00:30:39,578 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-02-24 00:30:39,578 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-02-24 00:30:39,579 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-02-24 00:30:39,579 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-02-24 00:30:39,579 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-02-24 00:30:39,579 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-02-24 00:30:39,579 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-02-24 00:30:39,579 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-02-24 00:30:39,579 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-02-24 00:30:39,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-02-24 00:30:39,579 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-02-24 00:30:39,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-02-24 00:30:39,579 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2022-02-24 00:30:39,580 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2022-02-24 00:30:39,580 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2022-02-24 00:30:39,580 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2022-02-24 00:30:39,580 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-02-24 00:30:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-24 00:30:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-24 00:30:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-24 00:30:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-24 00:30:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-02-24 00:30:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-02-24 00:30:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-02-24 00:30:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2022-02-24 00:30:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2022-02-24 00:30:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2022-02-24 00:30:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2022-02-24 00:30:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2022-02-24 00:30:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2022-02-24 00:30:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-02-24 00:30:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-02-24 00:30:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-02-24 00:30:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-02-24 00:30:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-02-24 00:30:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-02-24 00:30:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-02-24 00:30:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-02-24 00:30:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-02-24 00:30:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-02-24 00:30:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-02-24 00:30:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2022-02-24 00:30:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2022-02-24 00:30:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2022-02-24 00:30:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2022-02-24 00:30:39,582 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-02-24 00:30:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-02-24 00:30:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-02-24 00:30:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2022-02-24 00:30:39,583 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-02-24 00:30:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-24 00:30:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-02-24 00:30:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-24 00:30:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-24 00:30:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-24 00:30:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-24 00:30:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-24 00:30:39,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-24 00:30:39,776 INFO L234 CfgBuilder]: Building ICFG [2022-02-24 00:30:39,777 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-24 00:30:39,792 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:30:39,822 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-24 00:30:39,822 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-24 00:30:39,828 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:30:39,833 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-24 00:30:39,834 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-24 00:30:39,840 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:30:39,941 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-02-24 00:30:39,941 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-02-24 00:30:39,942 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:30:39,981 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2022-02-24 00:30:39,981 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2022-02-24 00:30:39,988 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:30:39,998 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-02-24 00:30:39,998 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-02-24 00:30:40,041 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:30:40,046 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-24 00:30:40,046 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-24 00:30:40,046 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:30:40,050 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-24 00:30:40,050 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-24 00:30:40,050 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:30:40,057 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-24 00:30:40,057 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-24 00:30:40,094 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:30:40,116 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-02-24 00:30:40,116 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-02-24 00:30:40,120 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:30:40,259 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-02-24 00:30:40,259 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-02-24 00:30:40,287 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:30:40,290 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-24 00:30:40,290 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-24 00:30:40,290 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:30:40,294 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-24 00:30:40,294 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-24 00:30:40,295 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-02-24 00:30:40,298 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-02-24 00:30:40,298 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-02-24 00:30:40,304 INFO L275 CfgBuilder]: Performing block encoding [2022-02-24 00:30:40,311 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-24 00:30:40,311 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-24 00:30:40,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:30:40 BoogieIcfgContainer [2022-02-24 00:30:40,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-24 00:30:40,313 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-02-24 00:30:40,313 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-02-24 00:30:40,314 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-02-24 00:30:40,316 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:30:40" (1/1) ... [2022-02-24 00:30:40,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 24.02 12:30:40 BasicIcfg [2022-02-24 00:30:40,355 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-02-24 00:30:40,357 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-24 00:30:40,357 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-24 00:30:40,359 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-24 00:30:40,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.02 12:30:38" (1/4) ... [2022-02-24 00:30:40,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a019e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 12:30:40, skipping insertion in model container [2022-02-24 00:30:40,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.02 12:30:39" (2/4) ... [2022-02-24 00:30:40,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a019e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.02 12:30:40, skipping insertion in model container [2022-02-24 00:30:40,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.02 12:30:40" (3/4) ... [2022-02-24 00:30:40,361 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a019e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.02 12:30:40, skipping insertion in model container [2022-02-24 00:30:40,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 24.02 12:30:40" (4/4) ... [2022-02-24 00:30:40,362 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.cqvasr [2022-02-24 00:30:40,369 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-24 00:30:40,369 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-24 00:30:40,413 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-24 00:30:40,420 INFO L339 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=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-24 00:30:40,421 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-24 00:30:40,447 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-02-24 00:30:40,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-24 00:30:40,452 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:40,452 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-24 00:30:40,452 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:40,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:40,456 INFO L85 PathProgramCache]: Analyzing trace with hash 871879161, now seen corresponding path program 1 times [2022-02-24 00:30:40,463 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:40,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245069901] [2022-02-24 00:30:40,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:40,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:40,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:40,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:40,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:40,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:40,797 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:40,797 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245069901] [2022-02-24 00:30:40,798 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245069901] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:40,798 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:40,798 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-24 00:30:40,799 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364134494] [2022-02-24 00:30:40,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:40,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-24 00:30:40,803 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:40,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-24 00:30:40,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-24 00:30:40,827 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-02-24 00:30:41,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:41,842 INFO L93 Difference]: Finished difference Result 666 states and 978 transitions. [2022-02-24 00:30:41,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-24 00:30:41,845 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-02-24 00:30:41,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:41,853 INFO L225 Difference]: With dead ends: 666 [2022-02-24 00:30:41,854 INFO L226 Difference]: Without dead ends: 422 [2022-02-24 00:30:41,858 INFO L932 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-02-24 00:30:41,861 INFO L933 BasicCegarLoop]: 496 mSDtfsCounter, 408 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:41,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 735 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-24 00:30:41,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-02-24 00:30:41,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380. [2022-02-24 00:30:41,916 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-02-24 00:30:41,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2022-02-24 00:30:41,919 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2022-02-24 00:30:41,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:41,919 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2022-02-24 00:30:41,919 INFO L471 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-02-24 00:30:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2022-02-24 00:30:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-24 00:30:41,920 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:41,921 INFO L514 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-02-24 00:30:41,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-24 00:30:41,921 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:41,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:41,921 INFO L85 PathProgramCache]: Analyzing trace with hash 291212257, now seen corresponding path program 1 times [2022-02-24 00:30:41,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:41,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328664379] [2022-02-24 00:30:41,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:41,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:42,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:42,096 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:42,096 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328664379] [2022-02-24 00:30:42,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328664379] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:42,096 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:42,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 00:30:42,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528670884] [2022-02-24 00:30:42,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:42,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 00:30:42,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:42,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 00:30:42,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-24 00:30:42,098 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-02-24 00:30:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:43,211 INFO L93 Difference]: Finished difference Result 747 states and 1022 transitions. [2022-02-24 00:30:43,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 00:30:43,212 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-02-24 00:30:43,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:43,219 INFO L225 Difference]: With dead ends: 747 [2022-02-24 00:30:43,219 INFO L226 Difference]: Without dead ends: 584 [2022-02-24 00:30:43,224 INFO L932 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-02-24 00:30:43,225 INFO L933 BasicCegarLoop]: 634 mSDtfsCounter, 717 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:43,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [723 Valid, 892 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-24 00:30:43,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-02-24 00:30:43,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 525. [2022-02-24 00:30:43,280 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-02-24 00:30:43,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 716 transitions. [2022-02-24 00:30:43,283 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 716 transitions. Word has length 25 [2022-02-24 00:30:43,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:43,289 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 716 transitions. [2022-02-24 00:30:43,289 INFO L471 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-02-24 00:30:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 716 transitions. [2022-02-24 00:30:43,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-24 00:30:43,291 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:43,291 INFO L514 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-02-24 00:30:43,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-24 00:30:43,291 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:43,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:43,292 INFO L85 PathProgramCache]: Analyzing trace with hash 525888156, now seen corresponding path program 1 times [2022-02-24 00:30:43,292 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:43,292 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904383535] [2022-02-24 00:30:43,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:43,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:43,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:43,483 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:43,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904383535] [2022-02-24 00:30:43,484 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904383535] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:43,484 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:43,484 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 00:30:43,484 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377101662] [2022-02-24 00:30:43,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:43,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 00:30:43,485 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:43,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 00:30:43,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-24 00:30:43,485 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-02-24 00:30:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:44,111 INFO L93 Difference]: Finished difference Result 695 states and 934 transitions. [2022-02-24 00:30:44,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 00:30:44,111 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-02-24 00:30:44,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:44,114 INFO L225 Difference]: With dead ends: 695 [2022-02-24 00:30:44,114 INFO L226 Difference]: Without dead ends: 676 [2022-02-24 00:30:44,115 INFO L932 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-02-24 00:30:44,116 INFO L933 BasicCegarLoop]: 459 mSDtfsCounter, 946 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:44,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [953 Valid, 603 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-24 00:30:44,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-02-24 00:30:44,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 583. [2022-02-24 00:30:44,146 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-02-24 00:30:44,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 790 transitions. [2022-02-24 00:30:44,149 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 790 transitions. Word has length 31 [2022-02-24 00:30:44,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:44,149 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 790 transitions. [2022-02-24 00:30:44,149 INFO L471 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-02-24 00:30:44,149 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 790 transitions. [2022-02-24 00:30:44,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-24 00:30:44,150 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:44,150 INFO L514 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-02-24 00:30:44,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-24 00:30:44,151 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:44,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:44,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2004508172, now seen corresponding path program 1 times [2022-02-24 00:30:44,151 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:44,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794473091] [2022-02-24 00:30:44,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:44,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:44,275 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:44,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794473091] [2022-02-24 00:30:44,275 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794473091] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:44,275 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:44,275 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 00:30:44,275 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506973198] [2022-02-24 00:30:44,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:44,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 00:30:44,276 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:44,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 00:30:44,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-24 00:30:44,277 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-02-24 00:30:45,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:45,192 INFO L93 Difference]: Finished difference Result 1117 states and 1501 transitions. [2022-02-24 00:30:45,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 00:30:45,193 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-02-24 00:30:45,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:45,196 INFO L225 Difference]: With dead ends: 1117 [2022-02-24 00:30:45,196 INFO L226 Difference]: Without dead ends: 819 [2022-02-24 00:30:45,197 INFO L932 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-02-24 00:30:45,198 INFO L933 BasicCegarLoop]: 541 mSDtfsCounter, 724 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:45,198 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [732 Valid, 744 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-24 00:30:45,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2022-02-24 00:30:45,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 771. [2022-02-24 00:30:45,230 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-02-24 00:30:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1047 transitions. [2022-02-24 00:30:45,233 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1047 transitions. Word has length 33 [2022-02-24 00:30:45,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:45,233 INFO L470 AbstractCegarLoop]: Abstraction has 771 states and 1047 transitions. [2022-02-24 00:30:45,233 INFO L471 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-02-24 00:30:45,233 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1047 transitions. [2022-02-24 00:30:45,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-24 00:30:45,235 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:45,235 INFO L514 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-02-24 00:30:45,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-24 00:30:45,235 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:45,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:45,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1331218314, now seen corresponding path program 1 times [2022-02-24 00:30:45,235 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:45,235 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275209769] [2022-02-24 00:30:45,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:45,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-24 00:30:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:45,421 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:45,421 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275209769] [2022-02-24 00:30:45,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275209769] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:45,421 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:45,421 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 00:30:45,421 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138689422] [2022-02-24 00:30:45,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:45,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 00:30:45,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:45,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 00:30:45,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-24 00:30:45,422 INFO L87 Difference]: Start difference. First operand 771 states and 1047 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 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-02-24 00:30:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:46,403 INFO L93 Difference]: Finished difference Result 865 states and 1163 transitions. [2022-02-24 00:30:46,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 00:30:46,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 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 38 [2022-02-24 00:30:46,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:46,407 INFO L225 Difference]: With dead ends: 865 [2022-02-24 00:30:46,408 INFO L226 Difference]: Without dead ends: 860 [2022-02-24 00:30:46,408 INFO L932 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-02-24 00:30:46,409 INFO L933 BasicCegarLoop]: 476 mSDtfsCounter, 516 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:46,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [517 Valid, 945 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-24 00:30:46,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-02-24 00:30:46,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 808. [2022-02-24 00:30:46,439 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-02-24 00:30:46,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1090 transitions. [2022-02-24 00:30:46,442 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1090 transitions. Word has length 38 [2022-02-24 00:30:46,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:46,442 INFO L470 AbstractCegarLoop]: Abstraction has 808 states and 1090 transitions. [2022-02-24 00:30:46,442 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 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-02-24 00:30:46,443 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1090 transitions. [2022-02-24 00:30:46,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-24 00:30:46,444 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:46,444 INFO L514 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-02-24 00:30:46,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-24 00:30:46,444 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:46,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:46,444 INFO L85 PathProgramCache]: Analyzing trace with hash 528133378, now seen corresponding path program 1 times [2022-02-24 00:30:46,444 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:46,445 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253951156] [2022-02-24 00:30:46,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:46,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:46,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:46,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:46,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:46,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:46,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:46,561 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:46,561 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253951156] [2022-02-24 00:30:46,561 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253951156] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:46,561 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:46,562 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-24 00:30:46,562 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130983552] [2022-02-24 00:30:46,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:46,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-24 00:30:46,562 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:46,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-24 00:30:46,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-24 00:30:46,563 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-02-24 00:30:47,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:47,627 INFO L93 Difference]: Finished difference Result 842 states and 1132 transitions. [2022-02-24 00:30:47,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-24 00:30:47,627 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-02-24 00:30:47,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:47,631 INFO L225 Difference]: With dead ends: 842 [2022-02-24 00:30:47,631 INFO L226 Difference]: Without dead ends: 839 [2022-02-24 00:30:47,631 INFO L932 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-02-24 00:30:47,632 INFO L933 BasicCegarLoop]: 467 mSDtfsCounter, 256 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:47,632 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 743 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-24 00:30:47,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-02-24 00:30:47,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 819. [2022-02-24 00:30:47,662 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-02-24 00:30:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1104 transitions. [2022-02-24 00:30:47,665 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1104 transitions. Word has length 38 [2022-02-24 00:30:47,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:47,665 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1104 transitions. [2022-02-24 00:30:47,665 INFO L471 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-02-24 00:30:47,665 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1104 transitions. [2022-02-24 00:30:47,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-24 00:30:47,666 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:47,666 INFO L514 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-02-24 00:30:47,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-24 00:30:47,666 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:47,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:47,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1133526780, now seen corresponding path program 1 times [2022-02-24 00:30:47,667 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:47,667 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885172999] [2022-02-24 00:30:47,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:47,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:47,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:47,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:47,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:47,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:47,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-24 00:30:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:47,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:47,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:47,886 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:47,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885172999] [2022-02-24 00:30:47,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885172999] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:47,886 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:47,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:30:47,886 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026113205] [2022-02-24 00:30:47,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:47,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:30:47,886 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:47,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:30:47,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:30:47,887 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-02-24 00:30:49,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:49,621 INFO L93 Difference]: Finished difference Result 877 states and 1176 transitions. [2022-02-24 00:30:49,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-24 00:30:49,621 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-02-24 00:30:49,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:49,624 INFO L225 Difference]: With dead ends: 877 [2022-02-24 00:30:49,624 INFO L226 Difference]: Without dead ends: 871 [2022-02-24 00:30:49,625 INFO L932 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-02-24 00:30:49,625 INFO L933 BasicCegarLoop]: 455 mSDtfsCounter, 1349 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 2031 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.4s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:49,626 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1364 Valid, 1168 Invalid, 2390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 2031 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-24 00:30:49,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-02-24 00:30:49,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2022-02-24 00:30:49,662 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-02-24 00:30:49,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1103 transitions. [2022-02-24 00:30:49,665 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1103 transitions. Word has length 40 [2022-02-24 00:30:49,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:49,665 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1103 transitions. [2022-02-24 00:30:49,666 INFO L471 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-02-24 00:30:49,666 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1103 transitions. [2022-02-24 00:30:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-24 00:30:49,666 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:49,667 INFO L514 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-02-24 00:30:49,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-24 00:30:49,667 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:49,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:49,667 INFO L85 PathProgramCache]: Analyzing trace with hash -174684695, now seen corresponding path program 1 times [2022-02-24 00:30:49,667 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:49,667 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319029565] [2022-02-24 00:30:49,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:49,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:49,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:49,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:49,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:49,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-24 00:30:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:49,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:49,850 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:49,850 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319029565] [2022-02-24 00:30:49,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319029565] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:49,850 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:49,850 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:30:49,851 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311761811] [2022-02-24 00:30:49,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:49,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:30:49,851 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:49,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:30:49,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:30:49,851 INFO L87 Difference]: Start difference. First operand 819 states and 1103 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 7 states have internal predecessors, (29), 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-02-24 00:30:51,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:51,339 INFO L93 Difference]: Finished difference Result 877 states and 1175 transitions. [2022-02-24 00:30:51,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-24 00:30:51,340 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 7 states have internal predecessors, (29), 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 41 [2022-02-24 00:30:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:51,361 INFO L225 Difference]: With dead ends: 877 [2022-02-24 00:30:51,361 INFO L226 Difference]: Without dead ends: 871 [2022-02-24 00:30:51,362 INFO L932 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-02-24 00:30:51,362 INFO L933 BasicCegarLoop]: 456 mSDtfsCounter, 1634 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 1346 mSolverCounterSat, 478 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1649 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.1s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:51,362 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1649 Valid, 885 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [478 Valid, 1346 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-24 00:30:51,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-02-24 00:30:51,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2022-02-24 00:30:51,404 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-02-24 00:30:51,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1102 transitions. [2022-02-24 00:30:51,407 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1102 transitions. Word has length 41 [2022-02-24 00:30:51,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:51,407 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1102 transitions. [2022-02-24 00:30:51,407 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 7 states have internal predecessors, (29), 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-02-24 00:30:51,407 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1102 transitions. [2022-02-24 00:30:51,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-24 00:30:51,408 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:51,408 INFO L514 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-02-24 00:30:51,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-24 00:30:51,408 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:51,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:51,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1816872397, now seen corresponding path program 1 times [2022-02-24 00:30:51,409 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:51,409 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529952593] [2022-02-24 00:30:51,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:51,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:51,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:51,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:51,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:51,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-24 00:30:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:51,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:51,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:51,550 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:51,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529952593] [2022-02-24 00:30:51,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529952593] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:51,550 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:51,550 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-24 00:30:51,550 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104448654] [2022-02-24 00:30:51,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:51,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-24 00:30:51,551 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:51,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-24 00:30:51,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-24 00:30:51,551 INFO L87 Difference]: Start difference. First operand 819 states and 1102 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-02-24 00:30:52,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:52,661 INFO L93 Difference]: Finished difference Result 882 states and 1180 transitions. [2022-02-24 00:30:52,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-24 00:30:52,661 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-02-24 00:30:52,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:52,665 INFO L225 Difference]: With dead ends: 882 [2022-02-24 00:30:52,665 INFO L226 Difference]: Without dead ends: 867 [2022-02-24 00:30:52,665 INFO L932 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-02-24 00:30:52,666 INFO L933 BasicCegarLoop]: 488 mSDtfsCounter, 671 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 1543 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:52,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [680 Valid, 1290 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1543 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-24 00:30:52,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2022-02-24 00:30:52,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 817. [2022-02-24 00:30:52,703 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-02-24 00:30:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1098 transitions. [2022-02-24 00:30:52,705 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1098 transitions. Word has length 42 [2022-02-24 00:30:52,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:52,706 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1098 transitions. [2022-02-24 00:30:52,706 INFO L471 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-02-24 00:30:52,706 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1098 transitions. [2022-02-24 00:30:52,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-24 00:30:52,706 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:52,706 INFO L514 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-02-24 00:30:52,707 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-24 00:30:52,707 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:52,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:52,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1390592098, now seen corresponding path program 1 times [2022-02-24 00:30:52,707 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:52,707 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526959004] [2022-02-24 00:30:52,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:52,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:52,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:52,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:52,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:52,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-02-24 00:30:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:52,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:30:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:52,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:52,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:52,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526959004] [2022-02-24 00:30:52,857 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526959004] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:52,858 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:52,858 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-24 00:30:52,858 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392988323] [2022-02-24 00:30:52,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:52,858 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-24 00:30:52,858 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:52,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-24 00:30:52,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-24 00:30:52,859 INFO L87 Difference]: Start difference. First operand 817 states and 1098 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-02-24 00:30:53,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:53,700 INFO L93 Difference]: Finished difference Result 880 states and 1176 transitions. [2022-02-24 00:30:53,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-24 00:30:53,701 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-02-24 00:30:53,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:53,703 INFO L225 Difference]: With dead ends: 880 [2022-02-24 00:30:53,704 INFO L226 Difference]: Without dead ends: 860 [2022-02-24 00:30:53,704 INFO L932 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-02-24 00:30:53,704 INFO L933 BasicCegarLoop]: 475 mSDtfsCounter, 515 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:53,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 1301 Invalid, 1855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-24 00:30:53,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-02-24 00:30:53,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 810. [2022-02-24 00:30:53,737 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-02-24 00:30:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1089 transitions. [2022-02-24 00:30:53,739 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1089 transitions. Word has length 41 [2022-02-24 00:30:53,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:53,740 INFO L470 AbstractCegarLoop]: Abstraction has 810 states and 1089 transitions. [2022-02-24 00:30:53,740 INFO L471 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-02-24 00:30:53,740 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1089 transitions. [2022-02-24 00:30:53,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-24 00:30:53,741 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:53,741 INFO L514 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-02-24 00:30:53,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-24 00:30:53,741 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:53,741 INFO L85 PathProgramCache]: Analyzing trace with hash -4159802, now seen corresponding path program 1 times [2022-02-24 00:30:53,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:53,742 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484958768] [2022-02-24 00:30:53,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:53,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:53,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:53,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:53,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:53,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:53,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:53,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:30:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:53,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:53,871 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:53,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484958768] [2022-02-24 00:30:53,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484958768] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:53,871 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:53,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 00:30:53,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583318328] [2022-02-24 00:30:53,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:53,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 00:30:53,871 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:53,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 00:30:53,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-24 00:30:53,872 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-02-24 00:30:54,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:54,892 INFO L93 Difference]: Finished difference Result 857 states and 1144 transitions. [2022-02-24 00:30:54,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 00:30:54,893 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-02-24 00:30:54,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:54,895 INFO L225 Difference]: With dead ends: 857 [2022-02-24 00:30:54,895 INFO L226 Difference]: Without dead ends: 835 [2022-02-24 00:30:54,896 INFO L932 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-02-24 00:30:54,896 INFO L933 BasicCegarLoop]: 456 mSDtfsCounter, 391 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:54,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [395 Valid, 1012 Invalid, 1509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-24 00:30:54,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-02-24 00:30:54,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 812. [2022-02-24 00:30:54,929 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-02-24 00:30:54,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1091 transitions. [2022-02-24 00:30:54,931 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1091 transitions. Word has length 42 [2022-02-24 00:30:54,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:54,932 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1091 transitions. [2022-02-24 00:30:54,932 INFO L471 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-02-24 00:30:54,932 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1091 transitions. [2022-02-24 00:30:54,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-24 00:30:54,933 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:54,933 INFO L514 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-02-24 00:30:54,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-24 00:30:54,933 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:54,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:54,933 INFO L85 PathProgramCache]: Analyzing trace with hash 383655172, now seen corresponding path program 1 times [2022-02-24 00:30:54,933 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:54,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659252260] [2022-02-24 00:30:54,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:54,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:54,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:55,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:55,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:55,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:55,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-24 00:30:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:55,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:55,075 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:55,075 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659252260] [2022-02-24 00:30:55,075 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659252260] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:55,075 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:55,075 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-24 00:30:55,075 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947256700] [2022-02-24 00:30:55,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:55,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-24 00:30:55,075 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:55,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-24 00:30:55,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-02-24 00:30:55,076 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-02-24 00:30:56,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:56,250 INFO L93 Difference]: Finished difference Result 908 states and 1209 transitions. [2022-02-24 00:30:56,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 00:30:56,251 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-02-24 00:30:56,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:56,254 INFO L225 Difference]: With dead ends: 908 [2022-02-24 00:30:56,254 INFO L226 Difference]: Without dead ends: 840 [2022-02-24 00:30:56,255 INFO L932 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-02-24 00:30:56,255 INFO L933 BasicCegarLoop]: 432 mSDtfsCounter, 378 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1868 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:56,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 914 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1868 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-24 00:30:56,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-02-24 00:30:56,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 816. [2022-02-24 00:30:56,291 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-02-24 00:30:56,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2022-02-24 00:30:56,293 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 44 [2022-02-24 00:30:56,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:56,293 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2022-02-24 00:30:56,294 INFO L471 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-02-24 00:30:56,294 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2022-02-24 00:30:56,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-24 00:30:56,294 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:56,294 INFO L514 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-02-24 00:30:56,294 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-24 00:30:56,295 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:56,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:56,295 INFO L85 PathProgramCache]: Analyzing trace with hash -864015436, now seen corresponding path program 1 times [2022-02-24 00:30:56,295 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:56,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59781330] [2022-02-24 00:30:56,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:56,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:56,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:56,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:56,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:56,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:30:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:56,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:56,425 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:56,425 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59781330] [2022-02-24 00:30:56,425 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59781330] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:56,425 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:56,425 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 00:30:56,425 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174112445] [2022-02-24 00:30:56,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:56,426 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 00:30:56,426 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:56,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 00:30:56,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-24 00:30:56,426 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-02-24 00:30:57,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:57,596 INFO L93 Difference]: Finished difference Result 860 states and 1147 transitions. [2022-02-24 00:30:57,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-24 00:30:57,596 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-02-24 00:30:57,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:57,599 INFO L225 Difference]: With dead ends: 860 [2022-02-24 00:30:57,599 INFO L226 Difference]: Without dead ends: 838 [2022-02-24 00:30:57,599 INFO L932 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-02-24 00:30:57,600 INFO L933 BasicCegarLoop]: 461 mSDtfsCounter, 293 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:57,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 1010 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-24 00:30:57,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-02-24 00:30:57,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 816. [2022-02-24 00:30:57,635 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-02-24 00:30:57,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2022-02-24 00:30:57,637 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 43 [2022-02-24 00:30:57,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:57,637 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2022-02-24 00:30:57,638 INFO L471 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-02-24 00:30:57,638 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2022-02-24 00:30:57,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-24 00:30:57,638 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:57,638 INFO L514 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-02-24 00:30:57,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-24 00:30:57,639 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:57,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:57,639 INFO L85 PathProgramCache]: Analyzing trace with hash -392590886, now seen corresponding path program 1 times [2022-02-24 00:30:57,639 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:57,639 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491100307] [2022-02-24 00:30:57,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:57,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:57,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:57,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:57,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:57,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:57,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:30:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:57,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:57,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:57,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:57,794 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:57,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491100307] [2022-02-24 00:30:57,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491100307] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:57,794 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:57,795 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-24 00:30:57,795 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374442456] [2022-02-24 00:30:57,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:57,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-24 00:30:57,795 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:57,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-24 00:30:57,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-24 00:30:57,796 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-02-24 00:30:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:58,738 INFO L93 Difference]: Finished difference Result 861 states and 1149 transitions. [2022-02-24 00:30:58,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 00:30:58,738 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-02-24 00:30:58,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:58,741 INFO L225 Difference]: With dead ends: 861 [2022-02-24 00:30:58,741 INFO L226 Difference]: Without dead ends: 843 [2022-02-24 00:30:58,741 INFO L932 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-02-24 00:30:58,742 INFO L933 BasicCegarLoop]: 457 mSDtfsCounter, 784 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:58,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [788 Valid, 1326 Invalid, 1752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-24 00:30:58,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-02-24 00:30:58,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 814. [2022-02-24 00:30:58,780 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-02-24 00:30:58,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1092 transitions. [2022-02-24 00:30:58,782 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1092 transitions. Word has length 45 [2022-02-24 00:30:58,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:58,782 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1092 transitions. [2022-02-24 00:30:58,782 INFO L471 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-02-24 00:30:58,782 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1092 transitions. [2022-02-24 00:30:58,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-24 00:30:58,784 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:58,784 INFO L514 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-02-24 00:30:58,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-24 00:30:58,784 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:58,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:58,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1509958495, now seen corresponding path program 1 times [2022-02-24 00:30:58,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:58,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142330014] [2022-02-24 00:30:58,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:58,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:58,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:58,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:58,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:58,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:58,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:30:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:58,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:30:58,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:30:58,928 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:58,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142330014] [2022-02-24 00:30:58,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142330014] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:58,928 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:58,928 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 00:30:58,928 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702143030] [2022-02-24 00:30:58,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:58,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 00:30:58,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:58,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 00:30:58,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-24 00:30:58,929 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-02-24 00:30:59,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:30:59,603 INFO L93 Difference]: Finished difference Result 880 states and 1173 transitions. [2022-02-24 00:30:59,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-24 00:30:59,604 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-02-24 00:30:59,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:30:59,607 INFO L225 Difference]: With dead ends: 880 [2022-02-24 00:30:59,607 INFO L226 Difference]: Without dead ends: 804 [2022-02-24 00:30:59,607 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-24 00:30:59,608 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 730 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-02-24 00:30:59,608 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [734 Valid, 878 Invalid, 1278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-24 00:30:59,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-02-24 00:30:59,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 775. [2022-02-24 00:30:59,644 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-02-24 00:30:59,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1041 transitions. [2022-02-24 00:30:59,646 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1041 transitions. Word has length 46 [2022-02-24 00:30:59,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:30:59,647 INFO L470 AbstractCegarLoop]: Abstraction has 775 states and 1041 transitions. [2022-02-24 00:30:59,647 INFO L471 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-02-24 00:30:59,647 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-02-24 00:30:59,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-24 00:30:59,648 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:30:59,648 INFO L514 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-02-24 00:30:59,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-24 00:30:59,648 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:30:59,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:30:59,648 INFO L85 PathProgramCache]: Analyzing trace with hash -214129706, now seen corresponding path program 1 times [2022-02-24 00:30:59,648 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:30:59,648 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740736854] [2022-02-24 00:30:59,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:30:59,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:30:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:59,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:30:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:59,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:30:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:59,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:30:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:59,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-24 00:30:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:30:59,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-02-24 00:30:59,742 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:30:59,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740736854] [2022-02-24 00:30:59,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740736854] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:30:59,743 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:30:59,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-24 00:30:59,744 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135555948] [2022-02-24 00:30:59,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:30:59,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-24 00:30:59,744 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:30:59,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-24 00:30:59,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-24 00:30:59,744 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-02-24 00:31:00,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:00,749 INFO L93 Difference]: Finished difference Result 1134 states and 1535 transitions. [2022-02-24 00:31:00,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 00:31:00,749 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-02-24 00:31:00,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:00,753 INFO L225 Difference]: With dead ends: 1134 [2022-02-24 00:31:00,753 INFO L226 Difference]: Without dead ends: 1131 [2022-02-24 00:31:00,753 INFO L932 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-02-24 00:31:00,754 INFO L933 BasicCegarLoop]: 533 mSDtfsCounter, 583 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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, 0.8s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:00,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [600 Valid, 782 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-24 00:31:00,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2022-02-24 00:31:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 888. [2022-02-24 00:31:00,799 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-02-24 00:31:00,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1195 transitions. [2022-02-24 00:31:00,802 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1195 transitions. Word has length 47 [2022-02-24 00:31:00,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:00,802 INFO L470 AbstractCegarLoop]: Abstraction has 888 states and 1195 transitions. [2022-02-24 00:31:00,802 INFO L471 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-02-24 00:31:00,802 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1195 transitions. [2022-02-24 00:31:00,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-02-24 00:31:00,803 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:00,803 INFO L514 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-02-24 00:31:00,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-24 00:31:00,803 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:00,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:00,803 INFO L85 PathProgramCache]: Analyzing trace with hash 530917733, now seen corresponding path program 1 times [2022-02-24 00:31:00,803 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:00,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016172146] [2022-02-24 00:31:00,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:00,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:00,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:00,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:00,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:00,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:00,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:00,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:31:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:00,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:00,978 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:00,978 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016172146] [2022-02-24 00:31:00,978 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016172146] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:00,978 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:00,978 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-24 00:31:00,978 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480082215] [2022-02-24 00:31:00,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:00,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-24 00:31:00,979 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:00,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-24 00:31:00,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-02-24 00:31:00,979 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-02-24 00:31:02,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:02,038 INFO L93 Difference]: Finished difference Result 933 states and 1248 transitions. [2022-02-24 00:31:02,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-24 00:31:02,039 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-02-24 00:31:02,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:02,042 INFO L225 Difference]: With dead ends: 933 [2022-02-24 00:31:02,042 INFO L226 Difference]: Without dead ends: 915 [2022-02-24 00:31:02,042 INFO L932 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-02-24 00:31:02,042 INFO L933 BasicCegarLoop]: 448 mSDtfsCounter, 308 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s 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.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:02,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 1261 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-24 00:31:02,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2022-02-24 00:31:02,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 886. [2022-02-24 00:31:02,083 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-02-24 00:31:02,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1191 transitions. [2022-02-24 00:31:02,085 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1191 transitions. Word has length 47 [2022-02-24 00:31:02,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:02,085 INFO L470 AbstractCegarLoop]: Abstraction has 886 states and 1191 transitions. [2022-02-24 00:31:02,085 INFO L471 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-02-24 00:31:02,085 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1191 transitions. [2022-02-24 00:31:02,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-02-24 00:31:02,087 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:02,087 INFO L514 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-02-24 00:31:02,087 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-24 00:31:02,087 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:02,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:02,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1920468263, now seen corresponding path program 1 times [2022-02-24 00:31:02,087 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:02,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231757700] [2022-02-24 00:31:02,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:02,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:02,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:02,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:02,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:02,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:02,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-02-24 00:31:02,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:02,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:02,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:02,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231757700] [2022-02-24 00:31:02,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231757700] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:02,270 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:02,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-24 00:31:02,270 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348706457] [2022-02-24 00:31:02,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:02,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-24 00:31:02,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:02,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-24 00:31:02,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-24 00:31:02,271 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-02-24 00:31:03,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:03,759 INFO L93 Difference]: Finished difference Result 1483 states and 1950 transitions. [2022-02-24 00:31:03,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-24 00:31:03,760 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-02-24 00:31:03,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:03,763 INFO L225 Difference]: With dead ends: 1483 [2022-02-24 00:31:03,763 INFO L226 Difference]: Without dead ends: 936 [2022-02-24 00:31:03,764 INFO L932 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-02-24 00:31:03,764 INFO L933 BasicCegarLoop]: 556 mSDtfsCounter, 1843 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 572 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1855 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 1791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 572 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:03,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1855 Valid, 779 Invalid, 1791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [572 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-24 00:31:03,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2022-02-24 00:31:03,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 877. [2022-02-24 00:31:03,809 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-02-24 00:31:03,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1170 transitions. [2022-02-24 00:31:03,810 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1170 transitions. Word has length 48 [2022-02-24 00:31:03,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:03,810 INFO L470 AbstractCegarLoop]: Abstraction has 877 states and 1170 transitions. [2022-02-24 00:31:03,811 INFO L471 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-02-24 00:31:03,811 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1170 transitions. [2022-02-24 00:31:03,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-24 00:31:03,812 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:03,812 INFO L514 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-02-24 00:31:03,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-24 00:31:03,812 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:03,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:03,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1683726876, now seen corresponding path program 1 times [2022-02-24 00:31:03,812 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:03,812 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875780479] [2022-02-24 00:31:03,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:03,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:03,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:03,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:03,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:03,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:31:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:03,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:03,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:03,969 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:03,969 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875780479] [2022-02-24 00:31:03,969 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875780479] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:03,969 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:03,969 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:31:03,969 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607217837] [2022-02-24 00:31:03,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:03,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:31:03,970 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:03,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:31:03,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:31:03,970 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-02-24 00:31:05,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:05,493 INFO L93 Difference]: Finished difference Result 1151 states and 1528 transitions. [2022-02-24 00:31:05,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-24 00:31:05,493 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-02-24 00:31:05,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:05,496 INFO L225 Difference]: With dead ends: 1151 [2022-02-24 00:31:05,496 INFO L226 Difference]: Without dead ends: 1075 [2022-02-24 00:31:05,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2022-02-24 00:31:05,497 INFO L933 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-02-24 00:31:05,497 INFO L934 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-02-24 00:31:05,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2022-02-24 00:31:05,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 932. [2022-02-24 00:31:05,546 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-02-24 00:31:05,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1243 transitions. [2022-02-24 00:31:05,548 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1243 transitions. Word has length 50 [2022-02-24 00:31:05,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:05,548 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1243 transitions. [2022-02-24 00:31:05,548 INFO L471 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-02-24 00:31:05,548 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1243 transitions. [2022-02-24 00:31:05,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-24 00:31:05,549 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:05,549 INFO L514 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-02-24 00:31:05,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-24 00:31:05,549 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:05,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:05,550 INFO L85 PathProgramCache]: Analyzing trace with hash -415030459, now seen corresponding path program 1 times [2022-02-24 00:31:05,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:05,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346364222] [2022-02-24 00:31:05,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:05,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:05,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:05,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:05,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:05,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:31:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:05,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-24 00:31:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:05,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:05,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:05,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346364222] [2022-02-24 00:31:05,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346364222] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:05,741 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:05,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-24 00:31:05,741 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996116066] [2022-02-24 00:31:05,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:05,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-24 00:31:05,742 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:05,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-24 00:31:05,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-24 00:31:05,742 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-02-24 00:31:06,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:06,839 INFO L93 Difference]: Finished difference Result 979 states and 1296 transitions. [2022-02-24 00:31:06,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-24 00:31:06,839 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-02-24 00:31:06,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:06,842 INFO L225 Difference]: With dead ends: 979 [2022-02-24 00:31:06,842 INFO L226 Difference]: Without dead ends: 959 [2022-02-24 00:31:06,843 INFO L932 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-02-24 00:31:06,844 INFO L933 BasicCegarLoop]: 452 mSDtfsCounter, 620 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 1522 SdHoareTripleChecker+Invalid, 1969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:06,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [624 Valid, 1522 Invalid, 1969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-24 00:31:06,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-02-24 00:31:06,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 932. [2022-02-24 00:31:06,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-02-24 00:31:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1231 transitions. [2022-02-24 00:31:06,898 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1231 transitions. Word has length 50 [2022-02-24 00:31:06,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:06,898 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1231 transitions. [2022-02-24 00:31:06,898 INFO L471 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-02-24 00:31:06,898 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1231 transitions. [2022-02-24 00:31:06,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-24 00:31:06,899 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:06,899 INFO L514 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-02-24 00:31:06,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-24 00:31:06,899 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:06,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:06,900 INFO L85 PathProgramCache]: Analyzing trace with hash 527542300, now seen corresponding path program 1 times [2022-02-24 00:31:06,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:06,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879663514] [2022-02-24 00:31:06,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:06,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:06,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:06,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:06,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:07,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-24 00:31:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:07,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:07,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:07,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879663514] [2022-02-24 00:31:07,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879663514] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:07,012 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:07,012 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 00:31:07,013 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900824934] [2022-02-24 00:31:07,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:07,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 00:31:07,013 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:07,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 00:31:07,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-24 00:31:07,013 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-02-24 00:31:07,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:07,962 INFO L93 Difference]: Finished difference Result 1041 states and 1345 transitions. [2022-02-24 00:31:07,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-24 00:31:07,962 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-02-24 00:31:07,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:07,977 INFO L225 Difference]: With dead ends: 1041 [2022-02-24 00:31:07,977 INFO L226 Difference]: Without dead ends: 685 [2022-02-24 00:31:07,978 INFO L932 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-02-24 00:31:07,984 INFO L933 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-02-24 00:31:07,984 INFO L934 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-02-24 00:31:07,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-02-24 00:31:08,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 623. [2022-02-24 00:31:08,024 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-02-24 00:31:08,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 791 transitions. [2022-02-24 00:31:08,025 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 791 transitions. Word has length 52 [2022-02-24 00:31:08,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:08,025 INFO L470 AbstractCegarLoop]: Abstraction has 623 states and 791 transitions. [2022-02-24 00:31:08,025 INFO L471 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-02-24 00:31:08,025 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 791 transitions. [2022-02-24 00:31:08,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-24 00:31:08,026 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:08,026 INFO L514 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-02-24 00:31:08,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-24 00:31:08,026 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:08,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:08,027 INFO L85 PathProgramCache]: Analyzing trace with hash 868088371, now seen corresponding path program 1 times [2022-02-24 00:31:08,027 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:08,027 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359485437] [2022-02-24 00:31:08,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:08,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:08,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:08,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:08,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:08,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:31:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:08,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-24 00:31:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:08,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:08,213 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:08,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359485437] [2022-02-24 00:31:08,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359485437] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:08,213 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:08,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-24 00:31:08,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280161843] [2022-02-24 00:31:08,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:08,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-24 00:31:08,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:08,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-24 00:31:08,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-02-24 00:31:08,214 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), 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-02-24 00:31:09,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:09,078 INFO L93 Difference]: Finished difference Result 673 states and 848 transitions. [2022-02-24 00:31:09,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-24 00:31:09,079 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-02-24 00:31:09,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:09,081 INFO L225 Difference]: With dead ends: 673 [2022-02-24 00:31:09,081 INFO L226 Difference]: Without dead ends: 645 [2022-02-24 00:31:09,081 INFO L932 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-02-24 00:31:09,082 INFO L933 BasicCegarLoop]: 439 mSDtfsCounter, 725 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 1981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:09,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [734 Valid, 1493 Invalid, 1981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1740 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-24 00:31:09,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-02-24 00:31:09,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 613. [2022-02-24 00:31:09,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 488 states have (on average 1.2704918032786885) internal successors, (620), 499 states have internal predecessors, (620), 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-02-24 00:31:09,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 776 transitions. [2022-02-24 00:31:09,155 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 776 transitions. Word has length 51 [2022-02-24 00:31:09,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:09,155 INFO L470 AbstractCegarLoop]: Abstraction has 613 states and 776 transitions. [2022-02-24 00:31:09,155 INFO L471 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-02-24 00:31:09,155 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 776 transitions. [2022-02-24 00:31:09,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-24 00:31:09,156 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:09,156 INFO L514 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-02-24 00:31:09,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-24 00:31:09,156 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:09,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:09,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1730699339, now seen corresponding path program 1 times [2022-02-24 00:31:09,156 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:09,156 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938388914] [2022-02-24 00:31:09,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:09,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:09,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:09,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:09,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:09,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:31:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:09,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-24 00:31:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:09,303 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:09,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938388914] [2022-02-24 00:31:09,303 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938388914] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:09,303 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:09,303 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-24 00:31:09,304 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995412163] [2022-02-24 00:31:09,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:09,305 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-24 00:31:09,305 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:09,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-24 00:31:09,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-02-24 00:31:09,305 INFO L87 Difference]: Start difference. First operand 613 states and 776 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-02-24 00:31:10,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:10,581 INFO L93 Difference]: Finished difference Result 669 states and 843 transitions. [2022-02-24 00:31:10,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-24 00:31:10,581 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-02-24 00:31:10,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:10,583 INFO L225 Difference]: With dead ends: 669 [2022-02-24 00:31:10,583 INFO L226 Difference]: Without dead ends: 647 [2022-02-24 00:31:10,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2022-02-24 00:31:10,584 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 418 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 2170 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 2170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:10,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [434 Valid, 1022 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 2170 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-24 00:31:10,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-02-24 00:31:10,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 616. [2022-02-24 00:31:10,627 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-02-24 00:31:10,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 779 transitions. [2022-02-24 00:31:10,629 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 779 transitions. Word has length 51 [2022-02-24 00:31:10,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:10,629 INFO L470 AbstractCegarLoop]: Abstraction has 616 states and 779 transitions. [2022-02-24 00:31:10,629 INFO L471 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-02-24 00:31:10,629 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 779 transitions. [2022-02-24 00:31:10,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-24 00:31:10,630 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:10,630 INFO L514 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-02-24 00:31:10,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-24 00:31:10,630 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:10,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:10,630 INFO L85 PathProgramCache]: Analyzing trace with hash -585236833, now seen corresponding path program 1 times [2022-02-24 00:31:10,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:10,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301044531] [2022-02-24 00:31:10,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:10,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:10,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:10,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:10,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:10,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:10,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:31:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:10,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:10,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-02-24 00:31:10,802 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:10,802 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301044531] [2022-02-24 00:31:10,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301044531] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:10,803 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:10,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-24 00:31:10,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915978221] [2022-02-24 00:31:10,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:10,803 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-24 00:31:10,803 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:10,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-24 00:31:10,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-02-24 00:31:10,804 INFO L87 Difference]: Start difference. First operand 616 states and 779 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-02-24 00:31:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:11,668 INFO L93 Difference]: Finished difference Result 1050 states and 1349 transitions. [2022-02-24 00:31:11,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-24 00:31:11,668 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-02-24 00:31:11,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:11,670 INFO L225 Difference]: With dead ends: 1050 [2022-02-24 00:31:11,671 INFO L226 Difference]: Without dead ends: 676 [2022-02-24 00:31:11,671 INFO L932 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-02-24 00:31:11,672 INFO L933 BasicCegarLoop]: 397 mSDtfsCounter, 1298 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:11,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1314 Valid, 740 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-24 00:31:11,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-02-24 00:31:11,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 627. [2022-02-24 00:31:11,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 502 states have (on average 1.2729083665338645) internal successors, (639), 512 states have internal predecessors, (639), 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-02-24 00:31:11,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 795 transitions. [2022-02-24 00:31:11,714 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 795 transitions. Word has length 52 [2022-02-24 00:31:11,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:11,714 INFO L470 AbstractCegarLoop]: Abstraction has 627 states and 795 transitions. [2022-02-24 00:31:11,714 INFO L471 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-02-24 00:31:11,714 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 795 transitions. [2022-02-24 00:31:11,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-24 00:31:11,715 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:11,715 INFO L514 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-02-24 00:31:11,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-24 00:31:11,715 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:11,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:11,715 INFO L85 PathProgramCache]: Analyzing trace with hash 768072864, now seen corresponding path program 1 times [2022-02-24 00:31:11,715 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:11,715 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794364310] [2022-02-24 00:31:11,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:11,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:11,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:11,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:11,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:11,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:31:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:11,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:11,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:11,915 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:11,915 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794364310] [2022-02-24 00:31:11,915 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794364310] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:11,915 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:11,915 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-24 00:31:11,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366029640] [2022-02-24 00:31:11,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:11,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-24 00:31:11,915 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:11,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-24 00:31:11,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-02-24 00:31:11,916 INFO L87 Difference]: Start difference. First operand 627 states and 795 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-02-24 00:31:13,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:13,236 INFO L93 Difference]: Finished difference Result 749 states and 943 transitions. [2022-02-24 00:31:13,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-24 00:31:13,237 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-02-24 00:31:13,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:13,239 INFO L225 Difference]: With dead ends: 749 [2022-02-24 00:31:13,239 INFO L226 Difference]: Without dead ends: 670 [2022-02-24 00:31:13,239 INFO L932 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-02-24 00:31:13,240 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 653 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:13,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [661 Valid, 1221 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-24 00:31:13,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-02-24 00:31:13,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 620. [2022-02-24 00:31:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 495 states have (on average 1.2686868686868686) internal successors, (628), 505 states have internal predecessors, (628), 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-02-24 00:31:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 784 transitions. [2022-02-24 00:31:13,278 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 784 transitions. Word has length 52 [2022-02-24 00:31:13,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:13,279 INFO L470 AbstractCegarLoop]: Abstraction has 620 states and 784 transitions. [2022-02-24 00:31:13,279 INFO L471 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-02-24 00:31:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 784 transitions. [2022-02-24 00:31:13,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-24 00:31:13,279 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:13,279 INFO L514 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-02-24 00:31:13,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-24 00:31:13,280 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:13,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:13,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1124310208, now seen corresponding path program 1 times [2022-02-24 00:31:13,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:13,280 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364595574] [2022-02-24 00:31:13,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:13,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:13,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:13,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:13,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:13,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:13,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:31:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:13,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:13,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:13,410 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:13,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364595574] [2022-02-24 00:31:13,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364595574] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:13,410 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:13,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 00:31:13,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024888221] [2022-02-24 00:31:13,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:13,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 00:31:13,410 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:13,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 00:31:13,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-24 00:31:13,411 INFO L87 Difference]: Start difference. First operand 620 states and 784 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-02-24 00:31:14,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:14,649 INFO L93 Difference]: Finished difference Result 815 states and 1051 transitions. [2022-02-24 00:31:14,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 00:31:14,650 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-02-24 00:31:14,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:14,652 INFO L225 Difference]: With dead ends: 815 [2022-02-24 00:31:14,652 INFO L226 Difference]: Without dead ends: 738 [2022-02-24 00:31:14,652 INFO L932 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-02-24 00:31:14,652 INFO L933 BasicCegarLoop]: 556 mSDtfsCounter, 450 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:14,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [460 Valid, 1030 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-24 00:31:14,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-02-24 00:31:14,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 575. [2022-02-24 00:31:14,689 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-02-24 00:31:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 731 transitions. [2022-02-24 00:31:14,690 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 731 transitions. Word has length 52 [2022-02-24 00:31:14,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:14,691 INFO L470 AbstractCegarLoop]: Abstraction has 575 states and 731 transitions. [2022-02-24 00:31:14,691 INFO L471 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-02-24 00:31:14,691 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 731 transitions. [2022-02-24 00:31:14,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-24 00:31:14,691 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:14,691 INFO L514 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-02-24 00:31:14,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-24 00:31:14,692 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:14,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:14,692 INFO L85 PathProgramCache]: Analyzing trace with hash 525399217, now seen corresponding path program 1 times [2022-02-24 00:31:14,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:14,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119818608] [2022-02-24 00:31:14,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:14,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:14,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:14,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:14,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:14,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:31:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:14,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:14,871 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:14,871 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119818608] [2022-02-24 00:31:14,871 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119818608] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:14,871 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:14,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-24 00:31:14,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102849999] [2022-02-24 00:31:14,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:14,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-24 00:31:14,871 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:14,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-24 00:31:14,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-24 00:31:14,872 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-02-24 00:31:15,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:15,894 INFO L93 Difference]: Finished difference Result 638 states and 818 transitions. [2022-02-24 00:31:15,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-24 00:31:15,894 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-02-24 00:31:15,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:15,896 INFO L225 Difference]: With dead ends: 638 [2022-02-24 00:31:15,896 INFO L226 Difference]: Without dead ends: 634 [2022-02-24 00:31:15,897 INFO L932 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-02-24 00:31:15,897 INFO L933 BasicCegarLoop]: 410 mSDtfsCounter, 520 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 2017 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:15,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [528 Valid, 1714 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2017 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-24 00:31:15,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-02-24 00:31:15,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 592. [2022-02-24 00:31:15,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 470 states have (on average 1.2659574468085106) internal successors, (595), 480 states have internal predecessors, (595), 69 states have call successors, (69), 44 states have call predecessors, (69), 52 states have return successors, (91), 68 states have call predecessors, (91), 61 states have call successors, (91) [2022-02-24 00:31:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 755 transitions. [2022-02-24 00:31:15,935 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 755 transitions. Word has length 53 [2022-02-24 00:31:15,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:15,937 INFO L470 AbstractCegarLoop]: Abstraction has 592 states and 755 transitions. [2022-02-24 00:31:15,937 INFO L471 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-02-24 00:31:15,937 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 755 transitions. [2022-02-24 00:31:15,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-24 00:31:15,938 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:15,938 INFO L514 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-02-24 00:31:15,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-24 00:31:15,938 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:15,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:15,939 INFO L85 PathProgramCache]: Analyzing trace with hash 525430961, now seen corresponding path program 1 times [2022-02-24 00:31:15,939 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:15,939 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73406544] [2022-02-24 00:31:15,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:15,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:15,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:16,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:16,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:16,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:31:16,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:16,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:16,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:16,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:16,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73406544] [2022-02-24 00:31:16,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73406544] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:16,095 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:16,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-24 00:31:16,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360484890] [2022-02-24 00:31:16,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:16,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-24 00:31:16,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:16,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-24 00:31:16,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-24 00:31:16,097 INFO L87 Difference]: Start difference. First operand 592 states and 755 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-02-24 00:31:17,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:17,096 INFO L93 Difference]: Finished difference Result 626 states and 794 transitions. [2022-02-24 00:31:17,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-24 00:31:17,097 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-02-24 00:31:17,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:17,098 INFO L225 Difference]: With dead ends: 626 [2022-02-24 00:31:17,098 INFO L226 Difference]: Without dead ends: 611 [2022-02-24 00:31:17,098 INFO L932 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-02-24 00:31:17,099 INFO L933 BasicCegarLoop]: 414 mSDtfsCounter, 559 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 2101 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 2292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 2101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:17,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [563 Valid, 1621 Invalid, 2292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 2101 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-24 00:31:17,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-02-24 00:31:17,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 589. [2022-02-24 00:31:17,135 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-02-24 00:31:17,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 751 transitions. [2022-02-24 00:31:17,136 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 751 transitions. Word has length 53 [2022-02-24 00:31:17,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:17,136 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 751 transitions. [2022-02-24 00:31:17,136 INFO L471 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-02-24 00:31:17,136 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 751 transitions. [2022-02-24 00:31:17,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-02-24 00:31:17,137 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:17,137 INFO L514 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-02-24 00:31:17,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-24 00:31:17,137 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:17,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:17,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1791629129, now seen corresponding path program 1 times [2022-02-24 00:31:17,138 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:17,138 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332289840] [2022-02-24 00:31:17,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:17,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:17,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:17,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:17,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:17,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:17,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:31:17,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:17,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:31:17,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:17,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-24 00:31:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:17,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:17,340 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:17,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332289840] [2022-02-24 00:31:17,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332289840] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:17,340 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:17,340 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-24 00:31:17,340 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743475317] [2022-02-24 00:31:17,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:17,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-24 00:31:17,341 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:17,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-24 00:31:17,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-02-24 00:31:17,341 INFO L87 Difference]: Start difference. First operand 589 states and 751 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-02-24 00:31:18,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:18,381 INFO L93 Difference]: Finished difference Result 624 states and 790 transitions. [2022-02-24 00:31:18,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-24 00:31:18,382 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-02-24 00:31:18,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:18,384 INFO L225 Difference]: With dead ends: 624 [2022-02-24 00:31:18,384 INFO L226 Difference]: Without dead ends: 596 [2022-02-24 00:31:18,384 INFO L932 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-02-24 00:31:18,384 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 604 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 2331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:18,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [613 Valid, 1653 Invalid, 2331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-24 00:31:18,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2022-02-24 00:31:18,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 577. [2022-02-24 00:31:18,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 458 states have (on average 1.2663755458515285) internal successors, (580), 469 states have internal predecessors, (580), 67 states have call successors, (67), 43 states have call predecessors, (67), 51 states have return successors, (88), 65 states have call predecessors, (88), 59 states have call successors, (88) [2022-02-24 00:31:18,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 735 transitions. [2022-02-24 00:31:18,426 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 735 transitions. Word has length 55 [2022-02-24 00:31:18,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:18,426 INFO L470 AbstractCegarLoop]: Abstraction has 577 states and 735 transitions. [2022-02-24 00:31:18,426 INFO L471 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-02-24 00:31:18,426 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 735 transitions. [2022-02-24 00:31:18,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-24 00:31:18,427 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:18,427 INFO L514 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-02-24 00:31:18,427 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-24 00:31:18,427 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:18,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:18,428 INFO L85 PathProgramCache]: Analyzing trace with hash 310114016, now seen corresponding path program 1 times [2022-02-24 00:31:18,428 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:18,428 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425785980] [2022-02-24 00:31:18,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:18,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:18,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:18,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:18,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:18,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:31:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:18,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:18,593 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:18,593 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425785980] [2022-02-24 00:31:18,593 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425785980] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:18,593 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:18,593 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-24 00:31:18,593 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625062875] [2022-02-24 00:31:18,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:18,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-24 00:31:18,593 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:18,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-24 00:31:18,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-24 00:31:18,594 INFO L87 Difference]: Start difference. First operand 577 states and 735 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-02-24 00:31:19,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:19,682 INFO L93 Difference]: Finished difference Result 746 states and 969 transitions. [2022-02-24 00:31:19,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-24 00:31:19,682 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-02-24 00:31:19,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:19,684 INFO L225 Difference]: With dead ends: 746 [2022-02-24 00:31:19,685 INFO L226 Difference]: Without dead ends: 728 [2022-02-24 00:31:19,685 INFO L932 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-02-24 00:31:19,685 INFO L933 BasicCegarLoop]: 503 mSDtfsCounter, 1355 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1370 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 1347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:19,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1370 Valid, 892 Invalid, 1347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-24 00:31:19,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-02-24 00:31:19,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 561. [2022-02-24 00:31:19,727 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-02-24 00:31:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 711 transitions. [2022-02-24 00:31:19,728 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 711 transitions. Word has length 54 [2022-02-24 00:31:19,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:19,728 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 711 transitions. [2022-02-24 00:31:19,728 INFO L471 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-02-24 00:31:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 711 transitions. [2022-02-24 00:31:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-24 00:31:19,729 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:19,729 INFO L514 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] [2022-02-24 00:31:19,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-02-24 00:31:19,729 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:19,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:19,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1381037997, now seen corresponding path program 1 times [2022-02-24 00:31:19,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:19,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925738968] [2022-02-24 00:31:19,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:19,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:19,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:19,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:19,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:19,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-24 00:31:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:19,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:19,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-24 00:31:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:19,858 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:19,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925738968] [2022-02-24 00:31:19,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925738968] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:19,858 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:19,858 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-24 00:31:19,859 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954617224] [2022-02-24 00:31:19,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:19,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-24 00:31:19,859 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:19,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-24 00:31:19,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-24 00:31:19,859 INFO L87 Difference]: Start difference. First operand 561 states and 711 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-24 00:31:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:20,589 INFO L93 Difference]: Finished difference Result 898 states and 1149 transitions. [2022-02-24 00:31:20,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-24 00:31:20,590 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2022-02-24 00:31:20,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:20,592 INFO L225 Difference]: With dead ends: 898 [2022-02-24 00:31:20,592 INFO L226 Difference]: Without dead ends: 589 [2022-02-24 00:31:20,593 INFO L932 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-02-24 00:31:20,593 INFO L933 BasicCegarLoop]: 386 mSDtfsCounter, 436 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:20,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [442 Valid, 800 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-24 00:31:20,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-02-24 00:31:20,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 566. [2022-02-24 00:31:20,635 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-02-24 00:31:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 717 transitions. [2022-02-24 00:31:20,636 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 717 transitions. Word has length 61 [2022-02-24 00:31:20,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:20,636 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 717 transitions. [2022-02-24 00:31:20,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-02-24 00:31:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 717 transitions. [2022-02-24 00:31:20,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-24 00:31:20,637 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:20,637 INFO L514 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-02-24 00:31:20,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-24 00:31:20,637 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:20,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:20,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1616264812, now seen corresponding path program 1 times [2022-02-24 00:31:20,638 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:20,638 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552603523] [2022-02-24 00:31:20,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:20,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:20,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:20,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:20,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:20,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-24 00:31:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:20,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:20,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:20,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:20,815 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:20,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552603523] [2022-02-24 00:31:20,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552603523] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:20,816 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:20,816 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-24 00:31:20,816 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387102638] [2022-02-24 00:31:20,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:20,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-24 00:31:20,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:20,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-24 00:31:20,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-24 00:31:20,816 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-02-24 00:31:21,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:21,578 INFO L93 Difference]: Finished difference Result 852 states and 1088 transitions. [2022-02-24 00:31:21,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 00:31:21,579 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-02-24 00:31:21,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:21,580 INFO L225 Difference]: With dead ends: 852 [2022-02-24 00:31:21,580 INFO L226 Difference]: Without dead ends: 538 [2022-02-24 00:31:21,582 INFO L932 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-02-24 00:31:21,582 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 775 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:21,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [782 Valid, 1072 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-24 00:31:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-02-24 00:31:21,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 511. [2022-02-24 00:31:21,623 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-02-24 00:31:21,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 639 transitions. [2022-02-24 00:31:21,624 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 639 transitions. Word has length 64 [2022-02-24 00:31:21,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:21,625 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 639 transitions. [2022-02-24 00:31:21,625 INFO L471 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-02-24 00:31:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 639 transitions. [2022-02-24 00:31:21,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-24 00:31:21,626 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:21,626 INFO L514 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-02-24 00:31:21,626 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-02-24 00:31:21,626 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:21,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:21,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1336270132, now seen corresponding path program 1 times [2022-02-24 00:31:21,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:21,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552200598] [2022-02-24 00:31:21,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:21,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:21,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:21,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:21,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:21,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:31:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:21,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-24 00:31:21,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:21,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-24 00:31:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:21,824 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:21,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552200598] [2022-02-24 00:31:21,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552200598] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:21,824 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:21,824 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-24 00:31:21,824 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683486793] [2022-02-24 00:31:21,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:21,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-24 00:31:21,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:21,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-24 00:31:21,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-02-24 00:31:21,825 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-02-24 00:31:23,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:23,043 INFO L93 Difference]: Finished difference Result 545 states and 678 transitions. [2022-02-24 00:31:23,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-24 00:31:23,044 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-02-24 00:31:23,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:23,045 INFO L225 Difference]: With dead ends: 545 [2022-02-24 00:31:23,045 INFO L226 Difference]: Without dead ends: 524 [2022-02-24 00:31:23,046 INFO L932 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-02-24 00:31:23,046 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 518 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 2653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:23,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [531 Valid, 1065 Invalid, 2653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-24 00:31:23,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-02-24 00:31:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 508. [2022-02-24 00:31:23,086 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-02-24 00:31:23,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 635 transitions. [2022-02-24 00:31:23,087 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 635 transitions. Word has length 59 [2022-02-24 00:31:23,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:23,087 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 635 transitions. [2022-02-24 00:31:23,087 INFO L471 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-02-24 00:31:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 635 transitions. [2022-02-24 00:31:23,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-24 00:31:23,088 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:23,089 INFO L514 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-02-24 00:31:23,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-02-24 00:31:23,089 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:23,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:23,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1613674778, now seen corresponding path program 1 times [2022-02-24 00:31:23,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:23,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091859290] [2022-02-24 00:31:23,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:23,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:23,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:23,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:23,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:23,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:23,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-02-24 00:31:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:23,268 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:23,268 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091859290] [2022-02-24 00:31:23,268 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091859290] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:23,268 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:23,268 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-24 00:31:23,269 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760581689] [2022-02-24 00:31:23,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:23,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-24 00:31:23,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:23,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-24 00:31:23,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-02-24 00:31:23,269 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-02-24 00:31:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:24,149 INFO L93 Difference]: Finished difference Result 538 states and 669 transitions. [2022-02-24 00:31:24,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-24 00:31:24,150 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-02-24 00:31:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:24,151 INFO L225 Difference]: With dead ends: 538 [2022-02-24 00:31:24,151 INFO L226 Difference]: Without dead ends: 520 [2022-02-24 00:31:24,151 INFO L932 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-02-24 00:31:24,152 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 487 mSDsluCounter, 1111 mSDsCounter, 0 mSdLazyCounter, 1832 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:24,152 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [491 Valid, 1502 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1832 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-24 00:31:24,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-02-24 00:31:24,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 504. [2022-02-24 00:31:24,189 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-02-24 00:31:24,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 629 transitions. [2022-02-24 00:31:24,190 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 629 transitions. Word has length 58 [2022-02-24 00:31:24,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:24,190 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 629 transitions. [2022-02-24 00:31:24,190 INFO L471 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-02-24 00:31:24,190 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 629 transitions. [2022-02-24 00:31:24,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-02-24 00:31:24,191 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:24,191 INFO L514 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-02-24 00:31:24,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-02-24 00:31:24,191 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:24,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:24,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2114727091, now seen corresponding path program 1 times [2022-02-24 00:31:24,191 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:24,191 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118779656] [2022-02-24 00:31:24,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:24,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:24,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:24,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:24,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:24,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:24,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-24 00:31:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:24,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-02-24 00:31:24,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:24,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:24,349 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:24,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118779656] [2022-02-24 00:31:24,349 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118779656] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:24,349 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:24,349 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:31:24,349 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133291424] [2022-02-24 00:31:24,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:24,349 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:31:24,350 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:24,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:31:24,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:31:24,350 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-02-24 00:31:25,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:25,351 INFO L93 Difference]: Finished difference Result 539 states and 669 transitions. [2022-02-24 00:31:25,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-24 00:31:25,353 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-02-24 00:31:25,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:25,355 INFO L225 Difference]: With dead ends: 539 [2022-02-24 00:31:25,355 INFO L226 Difference]: Without dead ends: 515 [2022-02-24 00:31:25,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-02-24 00:31:25,356 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 453 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 2014 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 2141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 2014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:25,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [466 Valid, 914 Invalid, 2141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 2014 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-24 00:31:25,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-02-24 00:31:25,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 499. [2022-02-24 00:31:25,400 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-02-24 00:31:25,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 621 transitions. [2022-02-24 00:31:25,402 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 621 transitions. Word has length 60 [2022-02-24 00:31:25,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:25,403 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 621 transitions. [2022-02-24 00:31:25,403 INFO L471 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-02-24 00:31:25,403 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 621 transitions. [2022-02-24 00:31:25,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-24 00:31:25,403 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:25,404 INFO L514 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-02-24 00:31:25,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-02-24 00:31:25,404 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:25,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:25,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1861314870, now seen corresponding path program 1 times [2022-02-24 00:31:25,404 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:25,404 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334406129] [2022-02-24 00:31:25,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:25,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:25,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-24 00:31:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:25,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:25,583 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:25,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334406129] [2022-02-24 00:31:25,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334406129] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:25,583 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:25,583 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:31:25,583 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962967241] [2022-02-24 00:31:25,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:25,584 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:31:25,584 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:25,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:31:25,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:31:25,584 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-02-24 00:31:26,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:26,339 INFO L93 Difference]: Finished difference Result 780 states and 980 transitions. [2022-02-24 00:31:26,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-24 00:31:26,340 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-02-24 00:31:26,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:26,348 INFO L225 Difference]: With dead ends: 780 [2022-02-24 00:31:26,348 INFO L226 Difference]: Without dead ends: 521 [2022-02-24 00:31:26,358 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-02-24 00:31:26,359 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 745 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:26,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [758 Valid, 1040 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-24 00:31:26,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-02-24 00:31:26,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 499. [2022-02-24 00:31:26,431 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-02-24 00:31:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 619 transitions. [2022-02-24 00:31:26,433 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 619 transitions. Word has length 68 [2022-02-24 00:31:26,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:26,435 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 619 transitions. [2022-02-24 00:31:26,435 INFO L471 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-02-24 00:31:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 619 transitions. [2022-02-24 00:31:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-24 00:31:26,435 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:26,436 INFO L514 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-02-24 00:31:26,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-02-24 00:31:26,436 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:26,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:26,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1116193296, now seen corresponding path program 1 times [2022-02-24 00:31:26,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:26,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976400828] [2022-02-24 00:31:26,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:26,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:31:26,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-24 00:31:26,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:31:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:26,564 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:26,564 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976400828] [2022-02-24 00:31:26,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976400828] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:26,564 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:26,564 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-24 00:31:26,564 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577688333] [2022-02-24 00:31:26,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:26,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-24 00:31:26,565 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:26,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-24 00:31:26,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-24 00:31:26,566 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-02-24 00:31:27,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:27,591 INFO L93 Difference]: Finished difference Result 611 states and 749 transitions. [2022-02-24 00:31:27,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-24 00:31:27,592 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-02-24 00:31:27,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:27,594 INFO L225 Difference]: With dead ends: 611 [2022-02-24 00:31:27,594 INFO L226 Difference]: Without dead ends: 519 [2022-02-24 00:31:27,594 INFO L932 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-02-24 00:31:27,594 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 501 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:27,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [515 Valid, 812 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-24 00:31:27,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-02-24 00:31:27,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 503. [2022-02-24 00:31:27,630 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-02-24 00:31:27,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 623 transitions. [2022-02-24 00:31:27,631 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 623 transitions. Word has length 63 [2022-02-24 00:31:27,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:27,631 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 623 transitions. [2022-02-24 00:31:27,631 INFO L471 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-02-24 00:31:27,631 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 623 transitions. [2022-02-24 00:31:27,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-24 00:31:27,632 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:27,632 INFO L514 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-02-24 00:31:27,632 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-02-24 00:31:27,632 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:27,632 INFO L85 PathProgramCache]: Analyzing trace with hash -929996240, now seen corresponding path program 1 times [2022-02-24 00:31:27,632 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:27,632 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229093301] [2022-02-24 00:31:27,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:27,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:27,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:31:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-24 00:31:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:31:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:27,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:27,782 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:27,782 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229093301] [2022-02-24 00:31:27,782 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229093301] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:27,782 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:27,782 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:31:27,782 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491010272] [2022-02-24 00:31:27,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:27,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:31:27,783 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:27,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:31:27,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:31:27,783 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-02-24 00:31:28,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:28,966 INFO L93 Difference]: Finished difference Result 529 states and 653 transitions. [2022-02-24 00:31:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-24 00:31:28,967 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-02-24 00:31:28,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:28,968 INFO L225 Difference]: With dead ends: 529 [2022-02-24 00:31:28,968 INFO L226 Difference]: Without dead ends: 505 [2022-02-24 00:31:28,968 INFO L932 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-02-24 00:31:28,968 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 502 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 2434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:28,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [516 Valid, 991 Invalid, 2434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-24 00:31:28,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-02-24 00:31:29,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 489. [2022-02-24 00:31:29,006 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-02-24 00:31:29,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 604 transitions. [2022-02-24 00:31:29,007 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 604 transitions. Word has length 63 [2022-02-24 00:31:29,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:29,007 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 604 transitions. [2022-02-24 00:31:29,007 INFO L471 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-02-24 00:31:29,007 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 604 transitions. [2022-02-24 00:31:29,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-24 00:31:29,008 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:29,008 INFO L514 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-02-24 00:31:29,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-02-24 00:31:29,008 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:29,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:29,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1704717596, now seen corresponding path program 1 times [2022-02-24 00:31:29,008 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:29,008 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259088712] [2022-02-24 00:31:29,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:29,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:29,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:29,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:29,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:29,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:29,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:29,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:29,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-24 00:31:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:29,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:29,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:29,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:29,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:29,170 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:29,170 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259088712] [2022-02-24 00:31:29,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259088712] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:29,171 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:29,171 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-24 00:31:29,171 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744230788] [2022-02-24 00:31:29,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:29,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-24 00:31:29,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:29,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-24 00:31:29,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-02-24 00:31:29,171 INFO L87 Difference]: Start difference. First operand 489 states and 604 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-02-24 00:31:29,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:29,953 INFO L93 Difference]: Finished difference Result 750 states and 936 transitions. [2022-02-24 00:31:29,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-24 00:31:29,953 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-02-24 00:31:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:29,955 INFO L225 Difference]: With dead ends: 750 [2022-02-24 00:31:29,955 INFO L226 Difference]: Without dead ends: 524 [2022-02-24 00:31:29,955 INFO L932 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-02-24 00:31:29,956 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 435 mSDsluCounter, 997 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:29,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [444 Valid, 1372 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-24 00:31:29,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-02-24 00:31:29,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 489. [2022-02-24 00:31:29,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 384 states have (on average 1.234375) internal successors, (474), 391 states have internal predecessors, (474), 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-02-24 00:31:29,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 602 transitions. [2022-02-24 00:31:29,992 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 602 transitions. Word has length 71 [2022-02-24 00:31:29,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:29,993 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 602 transitions. [2022-02-24 00:31:29,993 INFO L471 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-02-24 00:31:29,993 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 602 transitions. [2022-02-24 00:31:29,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-24 00:31:29,993 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:29,994 INFO L514 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-02-24 00:31:29,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-02-24 00:31:29,994 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:29,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:29,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1439851345, now seen corresponding path program 1 times [2022-02-24 00:31:29,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:29,994 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656778417] [2022-02-24 00:31:29,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:29,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:30,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:30,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:30,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:30,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:30,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:30,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:30,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:30,166 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:30,166 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656778417] [2022-02-24 00:31:30,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656778417] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:30,167 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:30,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-24 00:31:30,167 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032356945] [2022-02-24 00:31:30,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:30,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-24 00:31:30,167 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:30,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-24 00:31:30,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-02-24 00:31:30,167 INFO L87 Difference]: Start difference. First operand 489 states and 602 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-02-24 00:31:31,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:31,068 INFO L93 Difference]: Finished difference Result 522 states and 640 transitions. [2022-02-24 00:31:31,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-24 00:31:31,076 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-02-24 00:31:31,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:31,077 INFO L225 Difference]: With dead ends: 522 [2022-02-24 00:31:31,077 INFO L226 Difference]: Without dead ends: 501 [2022-02-24 00:31:31,078 INFO L932 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-02-24 00:31:31,078 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 599 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 2321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 2122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:31,078 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [603 Valid, 1611 Invalid, 2321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 2122 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-24 00:31:31,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-02-24 00:31:31,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 485. [2022-02-24 00:31:31,142 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-02-24 00:31:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 596 transitions. [2022-02-24 00:31:31,144 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 596 transitions. Word has length 63 [2022-02-24 00:31:31,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:31,144 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 596 transitions. [2022-02-24 00:31:31,144 INFO L471 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-02-24 00:31:31,145 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 596 transitions. [2022-02-24 00:31:31,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-24 00:31:31,145 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:31,146 INFO L514 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-02-24 00:31:31,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-02-24 00:31:31,146 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:31,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:31,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1734732644, now seen corresponding path program 1 times [2022-02-24 00:31:31,146 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:31,146 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147115304] [2022-02-24 00:31:31,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:31,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:31,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:31,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:31,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:31,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:31,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:31:31,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:31,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-02-24 00:31:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:31,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:31,311 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:31,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147115304] [2022-02-24 00:31:31,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147115304] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:31,311 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:31,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-24 00:31:31,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423684120] [2022-02-24 00:31:31,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:31,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-24 00:31:31,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:31,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-24 00:31:31,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-02-24 00:31:31,313 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-02-24 00:31:32,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:32,002 INFO L93 Difference]: Finished difference Result 512 states and 627 transitions. [2022-02-24 00:31:32,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-24 00:31:32,002 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-02-24 00:31:32,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:32,004 INFO L225 Difference]: With dead ends: 512 [2022-02-24 00:31:32,004 INFO L226 Difference]: Without dead ends: 490 [2022-02-24 00:31:32,004 INFO L932 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-02-24 00:31:32,004 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 425 mSDsluCounter, 1123 mSDsCounter, 0 mSdLazyCounter, 2058 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 2200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 2058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:32,004 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [429 Valid, 1498 Invalid, 2200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 2058 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-24 00:31:32,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-02-24 00:31:32,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 474. [2022-02-24 00:31:32,041 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-02-24 00:31:32,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 581 transitions. [2022-02-24 00:31:32,041 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 581 transitions. Word has length 64 [2022-02-24 00:31:32,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:32,042 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 581 transitions. [2022-02-24 00:31:32,042 INFO L471 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-02-24 00:31:32,042 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 581 transitions. [2022-02-24 00:31:32,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-24 00:31:32,043 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:32,043 INFO L514 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-02-24 00:31:32,043 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-02-24 00:31:32,043 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:32,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:32,043 INFO L85 PathProgramCache]: Analyzing trace with hash -144637562, now seen corresponding path program 1 times [2022-02-24 00:31:32,043 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:32,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69739894] [2022-02-24 00:31:32,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:32,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:32,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:32,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:32,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:32,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:32,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:32,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:32,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:32,202 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:32,202 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69739894] [2022-02-24 00:31:32,202 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69739894] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:32,202 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:32,202 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-24 00:31:32,202 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031821086] [2022-02-24 00:31:32,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:32,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-24 00:31:32,203 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:32,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-24 00:31:32,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-02-24 00:31:32,203 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-02-24 00:31:32,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:32,882 INFO L93 Difference]: Finished difference Result 507 states and 619 transitions. [2022-02-24 00:31:32,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-24 00:31:32,882 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-02-24 00:31:32,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:32,883 INFO L225 Difference]: With dead ends: 507 [2022-02-24 00:31:32,884 INFO L226 Difference]: Without dead ends: 485 [2022-02-24 00:31:32,884 INFO L932 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-02-24 00:31:32,884 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 455 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 2034 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 2182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 2034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:32,885 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 1662 Invalid, 2182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 2034 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-24 00:31:32,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-02-24 00:31:32,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2022-02-24 00:31:32,945 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-02-24 00:31:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 574 transitions. [2022-02-24 00:31:32,945 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 574 transitions. Word has length 64 [2022-02-24 00:31:32,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:32,946 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 574 transitions. [2022-02-24 00:31:32,946 INFO L471 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-02-24 00:31:32,946 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 574 transitions. [2022-02-24 00:31:32,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-24 00:31:32,946 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:32,946 INFO L514 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-02-24 00:31:32,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-02-24 00:31:32,947 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:32,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:32,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1120155272, now seen corresponding path program 1 times [2022-02-24 00:31:32,947 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:32,947 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798081760] [2022-02-24 00:31:32,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:32,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:33,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:33,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:33,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:33,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:33,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:33,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:33,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:33,106 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:33,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798081760] [2022-02-24 00:31:33,108 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798081760] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:33,108 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:33,108 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-24 00:31:33,108 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259103782] [2022-02-24 00:31:33,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:33,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-24 00:31:33,108 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:33,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-24 00:31:33,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-02-24 00:31:33,109 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-02-24 00:31:34,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:34,018 INFO L93 Difference]: Finished difference Result 502 states and 612 transitions. [2022-02-24 00:31:34,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-24 00:31:34,019 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-02-24 00:31:34,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:34,020 INFO L225 Difference]: With dead ends: 502 [2022-02-24 00:31:34,020 INFO L226 Difference]: Without dead ends: 481 [2022-02-24 00:31:34,020 INFO L932 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-02-24 00:31:34,021 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 291 mSDsluCounter, 1187 mSDsCounter, 0 mSdLazyCounter, 2212 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1534 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:34,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 1534 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2212 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-24 00:31:34,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-02-24 00:31:34,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 465. [2022-02-24 00:31:34,055 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-02-24 00:31:34,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 568 transitions. [2022-02-24 00:31:34,056 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 568 transitions. Word has length 64 [2022-02-24 00:31:34,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:34,056 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 568 transitions. [2022-02-24 00:31:34,056 INFO L471 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-02-24 00:31:34,056 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 568 transitions. [2022-02-24 00:31:34,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-24 00:31:34,057 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:34,057 INFO L514 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-02-24 00:31:34,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-02-24 00:31:34,057 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:34,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:34,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1809242026, now seen corresponding path program 1 times [2022-02-24 00:31:34,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:34,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884988665] [2022-02-24 00:31:34,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:34,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:34,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:34,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:34,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:34,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-24 00:31:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:34,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:34,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:34,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:34,176 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:34,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884988665] [2022-02-24 00:31:34,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884988665] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:34,176 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:34,176 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-24 00:31:34,176 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261120445] [2022-02-24 00:31:34,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:34,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-24 00:31:34,177 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:34,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-24 00:31:34,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-24 00:31:34,177 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-02-24 00:31:34,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:34,819 INFO L93 Difference]: Finished difference Result 878 states and 1082 transitions. [2022-02-24 00:31:34,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-24 00:31:34,829 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-02-24 00:31:34,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:34,830 INFO L225 Difference]: With dead ends: 878 [2022-02-24 00:31:34,830 INFO L226 Difference]: Without dead ends: 625 [2022-02-24 00:31:34,831 INFO L932 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-02-24 00:31:34,831 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 525 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:34,832 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [537 Valid, 990 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-24 00:31:34,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-02-24 00:31:34,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 586. [2022-02-24 00:31:34,898 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-02-24 00:31:34,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 716 transitions. [2022-02-24 00:31:34,899 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 716 transitions. Word has length 70 [2022-02-24 00:31:34,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:34,900 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 716 transitions. [2022-02-24 00:31:34,900 INFO L471 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-02-24 00:31:34,900 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 716 transitions. [2022-02-24 00:31:34,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-02-24 00:31:34,901 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:34,901 INFO L514 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-02-24 00:31:34,901 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-02-24 00:31:34,901 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:34,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:34,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1680266649, now seen corresponding path program 1 times [2022-02-24 00:31:34,902 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:34,902 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237452647] [2022-02-24 00:31:34,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:34,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:34,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:34,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:34,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:34,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:35,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:35,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:35,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-24 00:31:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:35,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:35,079 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:35,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237452647] [2022-02-24 00:31:35,079 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237452647] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:35,079 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:35,079 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-24 00:31:35,079 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595069860] [2022-02-24 00:31:35,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:35,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-24 00:31:35,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:35,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-24 00:31:35,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-02-24 00:31:35,080 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-02-24 00:31:35,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:35,952 INFO L93 Difference]: Finished difference Result 619 states and 755 transitions. [2022-02-24 00:31:35,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-24 00:31:35,952 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-02-24 00:31:35,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:35,953 INFO L225 Difference]: With dead ends: 619 [2022-02-24 00:31:35,954 INFO L226 Difference]: Without dead ends: 576 [2022-02-24 00:31:35,954 INFO L932 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-02-24 00:31:35,954 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 447 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 2004 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 2143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 2004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:35,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [453 Valid, 1465 Invalid, 2143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 2004 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-24 00:31:35,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-02-24 00:31:36,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 560. [2022-02-24 00:31:36,001 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-02-24 00:31:36,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 684 transitions. [2022-02-24 00:31:36,002 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 684 transitions. Word has length 68 [2022-02-24 00:31:36,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:36,002 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 684 transitions. [2022-02-24 00:31:36,002 INFO L471 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-02-24 00:31:36,002 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 684 transitions. [2022-02-24 00:31:36,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-02-24 00:31:36,003 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:36,003 INFO L514 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-02-24 00:31:36,003 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-02-24 00:31:36,003 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:36,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:36,003 INFO L85 PathProgramCache]: Analyzing trace with hash -815860561, now seen corresponding path program 1 times [2022-02-24 00:31:36,003 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:36,003 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397246867] [2022-02-24 00:31:36,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:36,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:36,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:36,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:36,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:36,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:36,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:36,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-24 00:31:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:36,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-24 00:31:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:36,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:31:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:36,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-02-24 00:31:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:36,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:36,170 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:36,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397246867] [2022-02-24 00:31:36,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397246867] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:36,171 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:36,171 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-24 00:31:36,171 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126382850] [2022-02-24 00:31:36,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:36,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-24 00:31:36,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:36,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-24 00:31:36,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-02-24 00:31:36,171 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-02-24 00:31:37,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:37,123 INFO L93 Difference]: Finished difference Result 589 states and 718 transitions. [2022-02-24 00:31:37,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-24 00:31:37,123 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-02-24 00:31:37,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:37,124 INFO L225 Difference]: With dead ends: 589 [2022-02-24 00:31:37,124 INFO L226 Difference]: Without dead ends: 535 [2022-02-24 00:31:37,125 INFO L932 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-02-24 00:31:37,125 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 287 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 2740 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 2814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:37,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [299 Valid, 876 Invalid, 2814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2740 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-24 00:31:37,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-02-24 00:31:37,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 519. [2022-02-24 00:31:37,165 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-02-24 00:31:37,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 632 transitions. [2022-02-24 00:31:37,165 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 632 transitions. Word has length 71 [2022-02-24 00:31:37,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:37,165 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 632 transitions. [2022-02-24 00:31:37,166 INFO L471 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-02-24 00:31:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 632 transitions. [2022-02-24 00:31:37,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-02-24 00:31:37,166 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:37,166 INFO L514 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-02-24 00:31:37,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-02-24 00:31:37,166 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:37,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:37,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1160220987, now seen corresponding path program 1 times [2022-02-24 00:31:37,167 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:37,167 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641426160] [2022-02-24 00:31:37,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:37,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:37,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:37,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:37,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:37,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-02-24 00:31:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:37,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:37,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:37,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:37,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-24 00:31:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:37,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:37,291 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:37,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641426160] [2022-02-24 00:31:37,291 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641426160] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:37,291 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:37,291 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-02-24 00:31:37,291 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003658730] [2022-02-24 00:31:37,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:37,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-24 00:31:37,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:37,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-24 00:31:37,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-02-24 00:31:37,292 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-02-24 00:31:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:37,919 INFO L93 Difference]: Finished difference Result 840 states and 1028 transitions. [2022-02-24 00:31:37,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-24 00:31:37,920 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-02-24 00:31:37,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:37,921 INFO L225 Difference]: With dead ends: 840 [2022-02-24 00:31:37,921 INFO L226 Difference]: Without dead ends: 523 [2022-02-24 00:31:37,922 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-02-24 00:31:37,922 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 724 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:37,922 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [731 Valid, 999 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-24 00:31:37,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-02-24 00:31:37,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 501. [2022-02-24 00:31:37,971 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-02-24 00:31:37,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 602 transitions. [2022-02-24 00:31:37,971 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 602 transitions. Word has length 82 [2022-02-24 00:31:37,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:37,972 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 602 transitions. [2022-02-24 00:31:37,972 INFO L471 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-02-24 00:31:37,972 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 602 transitions. [2022-02-24 00:31:37,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-02-24 00:31:37,972 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:37,973 INFO L514 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-02-24 00:31:37,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-02-24 00:31:37,973 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:37,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:37,973 INFO L85 PathProgramCache]: Analyzing trace with hash 633938585, now seen corresponding path program 1 times [2022-02-24 00:31:37,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:37,973 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242425680] [2022-02-24 00:31:37,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:37,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:38,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:38,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:38,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:38,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:38,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-24 00:31:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:38,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:38,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:38,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:38,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-02-24 00:31:38,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:38,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:38,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:38,176 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:38,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242425680] [2022-02-24 00:31:38,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242425680] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:38,176 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:38,176 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-24 00:31:38,176 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52686642] [2022-02-24 00:31:38,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:38,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-24 00:31:38,176 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:38,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-24 00:31:38,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-02-24 00:31:38,177 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-02-24 00:31:38,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:38,931 INFO L93 Difference]: Finished difference Result 839 states and 1046 transitions. [2022-02-24 00:31:38,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-24 00:31:38,932 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-02-24 00:31:38,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:38,933 INFO L225 Difference]: With dead ends: 839 [2022-02-24 00:31:38,933 INFO L226 Difference]: Without dead ends: 585 [2022-02-24 00:31:38,934 INFO L932 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-02-24 00:31:38,934 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 455 mSDsluCounter, 1194 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:38,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [466 Valid, 1533 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-24 00:31:38,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-02-24 00:31:38,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 465. [2022-02-24 00:31:38,992 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-02-24 00:31:38,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 556 transitions. [2022-02-24 00:31:38,993 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 556 transitions. Word has length 83 [2022-02-24 00:31:38,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:38,993 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 556 transitions. [2022-02-24 00:31:38,993 INFO L471 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-02-24 00:31:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 556 transitions. [2022-02-24 00:31:38,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-24 00:31:38,994 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:38,994 INFO L514 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-02-24 00:31:38,994 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-02-24 00:31:38,994 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:38,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:38,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1833243044, now seen corresponding path program 1 times [2022-02-24 00:31:38,995 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:38,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621634524] [2022-02-24 00:31:39,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:39,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:39,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:39,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:39,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:39,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:39,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:39,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:39,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:39,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:39,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:39,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-24 00:31:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:39,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:39,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:39,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621634524] [2022-02-24 00:31:39,258 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621634524] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:39,258 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:39,258 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-24 00:31:39,258 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132052969] [2022-02-24 00:31:39,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:39,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-24 00:31:39,258 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:39,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-24 00:31:39,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-02-24 00:31:39,259 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-02-24 00:31:40,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:40,211 INFO L93 Difference]: Finished difference Result 526 states and 629 transitions. [2022-02-24 00:31:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-24 00:31:40,211 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-02-24 00:31:40,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:40,213 INFO L225 Difference]: With dead ends: 526 [2022-02-24 00:31:40,213 INFO L226 Difference]: Without dead ends: 505 [2022-02-24 00:31:40,213 INFO L932 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-02-24 00:31:40,213 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 359 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 1765 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1600 SdHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 1765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:40,213 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 1600 Invalid, 1895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 1765 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-02-24 00:31:40,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-02-24 00:31:40,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 473. [2022-02-24 00:31:40,255 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-02-24 00:31:40,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 566 transitions. [2022-02-24 00:31:40,255 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 566 transitions. Word has length 88 [2022-02-24 00:31:40,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:40,256 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 566 transitions. [2022-02-24 00:31:40,256 INFO L471 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-02-24 00:31:40,256 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 566 transitions. [2022-02-24 00:31:40,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-02-24 00:31:40,257 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:40,258 INFO L514 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-02-24 00:31:40,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-02-24 00:31:40,258 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:40,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:40,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2018356459, now seen corresponding path program 1 times [2022-02-24 00:31:40,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:40,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386795074] [2022-02-24 00:31:40,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:40,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:40,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:40,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:40,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:40,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:40,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:40,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:40,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:40,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:40,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:40,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:40,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-02-24 00:31:40,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:40,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:40,467 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:40,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386795074] [2022-02-24 00:31:40,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386795074] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:40,467 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:40,467 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-24 00:31:40,467 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199231838] [2022-02-24 00:31:40,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:40,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-24 00:31:40,468 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:40,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-24 00:31:40,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-02-24 00:31:40,468 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-02-24 00:31:41,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:41,328 INFO L93 Difference]: Finished difference Result 526 states and 628 transitions. [2022-02-24 00:31:41,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-24 00:31:41,328 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-02-24 00:31:41,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:41,330 INFO L225 Difference]: With dead ends: 526 [2022-02-24 00:31:41,330 INFO L226 Difference]: Without dead ends: 505 [2022-02-24 00:31:41,330 INFO L932 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-02-24 00:31:41,330 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 459 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:41,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [463 Valid, 1695 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-24 00:31:41,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-02-24 00:31:41,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 465. [2022-02-24 00:31:41,379 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-02-24 00:31:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 555 transitions. [2022-02-24 00:31:41,380 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 555 transitions. Word has length 89 [2022-02-24 00:31:41,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:41,380 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 555 transitions. [2022-02-24 00:31:41,380 INFO L471 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-02-24 00:31:41,380 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 555 transitions. [2022-02-24 00:31:41,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-24 00:31:41,381 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:41,381 INFO L514 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] [2022-02-24 00:31:41,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-02-24 00:31:41,382 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:41,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:41,382 INFO L85 PathProgramCache]: Analyzing trace with hash -72110269, now seen corresponding path program 1 times [2022-02-24 00:31:41,382 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:41,382 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382366617] [2022-02-24 00:31:41,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:41,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:41,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:41,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:41,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:41,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:41,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:41,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:41,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:41,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:41,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:41,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-24 00:31:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:41,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-02-24 00:31:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:41,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:41,541 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:41,541 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382366617] [2022-02-24 00:31:41,541 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382366617] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:41,541 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:41,542 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-24 00:31:41,542 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512809291] [2022-02-24 00:31:41,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:41,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-24 00:31:41,542 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:41,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-24 00:31:41,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-02-24 00:31:41,542 INFO L87 Difference]: Start difference. First operand 465 states and 555 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 5 states have internal predecessors, (76), 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-02-24 00:31:42,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:42,143 INFO L93 Difference]: Finished difference Result 522 states and 617 transitions. [2022-02-24 00:31:42,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-24 00:31:42,144 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 5 states have internal predecessors, (76), 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 98 [2022-02-24 00:31:42,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:42,145 INFO L225 Difference]: With dead ends: 522 [2022-02-24 00:31:42,145 INFO L226 Difference]: Without dead ends: 483 [2022-02-24 00:31:42,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2022-02-24 00:31:42,146 INFO L933 BasicCegarLoop]: 274 mSDtfsCounter, 331 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:42,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [334 Valid, 1066 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-24 00:31:42,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-02-24 00:31:42,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 459. [2022-02-24 00:31:42,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 361 states have (on average 1.2132963988919667) internal successors, (438), 367 states have internal predecessors, (438), 51 states have call successors, (51), 41 states have call predecessors, (51), 46 states have return successors, (57), 51 states have call predecessors, (57), 47 states have call successors, (57) [2022-02-24 00:31:42,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 546 transitions. [2022-02-24 00:31:42,182 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 546 transitions. Word has length 98 [2022-02-24 00:31:42,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:42,183 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 546 transitions. [2022-02-24 00:31:42,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 5 states have internal predecessors, (76), 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-02-24 00:31:42,183 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 546 transitions. [2022-02-24 00:31:42,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-02-24 00:31:42,183 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:42,184 INFO L514 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-02-24 00:31:42,184 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-02-24 00:31:42,184 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:42,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:42,184 INFO L85 PathProgramCache]: Analyzing trace with hash 221001860, now seen corresponding path program 1 times [2022-02-24 00:31:42,184 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:42,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110574491] [2022-02-24 00:31:42,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:42,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:42,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:42,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:42,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:42,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:42,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:42,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-24 00:31:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:42,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:31:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:42,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-24 00:31:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:42,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-02-24 00:31:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:42,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:42,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110574491] [2022-02-24 00:31:42,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110574491] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:42,356 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:42,356 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-24 00:31:42,356 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395856081] [2022-02-24 00:31:42,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:42,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-24 00:31:42,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:42,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-24 00:31:42,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-02-24 00:31:42,357 INFO L87 Difference]: Start difference. First operand 459 states and 546 transitions. Second operand has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 6 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-24 00:31:44,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:44,123 INFO L93 Difference]: Finished difference Result 1616 states and 1898 transitions. [2022-02-24 00:31:44,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-02-24 00:31:44,123 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 6 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2022-02-24 00:31:44,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:44,126 INFO L225 Difference]: With dead ends: 1616 [2022-02-24 00:31:44,126 INFO L226 Difference]: Without dead ends: 1310 [2022-02-24 00:31:44,127 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=374, Invalid=1108, Unknown=0, NotChecked=0, Total=1482 [2022-02-24 00:31:44,127 INFO L933 BasicCegarLoop]: 577 mSDtfsCounter, 1523 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 2603 mSolverCounterSat, 537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 3140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 537 IncrementalHoareTripleChecker+Valid, 2603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:44,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1526 Valid, 883 Invalid, 3140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [537 Valid, 2603 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-24 00:31:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2022-02-24 00:31:44,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1036. [2022-02-24 00:31:44,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1036 states, 820 states have (on average 1.197560975609756) internal successors, (982), 833 states have internal predecessors, (982), 103 states have call successors, (103), 93 states have call predecessors, (103), 112 states have return successors, (128), 111 states have call predecessors, (128), 99 states have call successors, (128) [2022-02-24 00:31:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1213 transitions. [2022-02-24 00:31:44,222 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1213 transitions. Word has length 92 [2022-02-24 00:31:44,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:44,223 INFO L470 AbstractCegarLoop]: Abstraction has 1036 states and 1213 transitions. [2022-02-24 00:31:44,223 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.6923076923076925) internal successors, (74), 6 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-02-24 00:31:44,223 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1213 transitions. [2022-02-24 00:31:44,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-24 00:31:44,224 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:44,224 INFO L514 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-02-24 00:31:44,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-02-24 00:31:44,224 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:44,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:44,224 INFO L85 PathProgramCache]: Analyzing trace with hash 457485908, now seen corresponding path program 1 times [2022-02-24 00:31:44,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:44,225 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888138527] [2022-02-24 00:31:44,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:44,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:44,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:44,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:44,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:44,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:44,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:44,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:44,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:44,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:44,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:44,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:44,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:44,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:44,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:44,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:44,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-02-24 00:31:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:44,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-02-24 00:31:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:44,434 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:44,434 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888138527] [2022-02-24 00:31:44,434 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888138527] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:44,434 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:44,434 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-24 00:31:44,434 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569850239] [2022-02-24 00:31:44,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:44,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-24 00:31:44,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:44,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-24 00:31:44,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-02-24 00:31:44,435 INFO L87 Difference]: Start difference. First operand 1036 states and 1213 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-02-24 00:31:45,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:45,692 INFO L93 Difference]: Finished difference Result 1962 states and 2306 transitions. [2022-02-24 00:31:45,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-24 00:31:45,692 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-02-24 00:31:45,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:45,696 INFO L225 Difference]: With dead ends: 1962 [2022-02-24 00:31:45,697 INFO L226 Difference]: Without dead ends: 1897 [2022-02-24 00:31:45,697 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=629, Unknown=0, NotChecked=0, Total=812 [2022-02-24 00:31:45,697 INFO L933 BasicCegarLoop]: 461 mSDtfsCounter, 698 mSDsluCounter, 1599 mSDsCounter, 0 mSdLazyCounter, 2031 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 2266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 2031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:45,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [711 Valid, 2060 Invalid, 2266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 2031 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-24 00:31:45,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2022-02-24 00:31:45,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1000. [2022-02-24 00:31:45,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1000 states, 792 states have (on average 1.196969696969697) internal successors, (948), 803 states have internal predecessors, (948), 97 states have call successors, (97), 91 states have call predecessors, (97), 110 states have return successors, (122), 105 states have call predecessors, (122), 93 states have call successors, (122) [2022-02-24 00:31:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1167 transitions. [2022-02-24 00:31:45,801 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1167 transitions. Word has length 99 [2022-02-24 00:31:45,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:45,801 INFO L470 AbstractCegarLoop]: Abstraction has 1000 states and 1167 transitions. [2022-02-24 00:31:45,801 INFO L471 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-02-24 00:31:45,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1167 transitions. [2022-02-24 00:31:45,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-02-24 00:31:45,802 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:45,802 INFO L514 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-02-24 00:31:45,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-02-24 00:31:45,803 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:45,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:45,803 INFO L85 PathProgramCache]: Analyzing trace with hash 925491343, now seen corresponding path program 1 times [2022-02-24 00:31:45,803 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:45,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482121451] [2022-02-24 00:31:45,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:45,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:45,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:45,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:45,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:45,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:45,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:45,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-24 00:31:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:45,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:31:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:45,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-24 00:31:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:45,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-02-24 00:31:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:45,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:45,975 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:45,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482121451] [2022-02-24 00:31:45,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482121451] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:45,975 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:45,975 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-02-24 00:31:45,975 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108400316] [2022-02-24 00:31:45,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:45,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-24 00:31:45,975 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:45,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-24 00:31:45,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-02-24 00:31:45,976 INFO L87 Difference]: Start difference. First operand 1000 states and 1167 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-02-24 00:31:46,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:46,848 INFO L93 Difference]: Finished difference Result 1010 states and 1176 transitions. [2022-02-24 00:31:46,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-24 00:31:46,848 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-02-24 00:31:46,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:46,850 INFO L225 Difference]: With dead ends: 1010 [2022-02-24 00:31:46,850 INFO L226 Difference]: Without dead ends: 804 [2022-02-24 00:31:46,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-02-24 00:31:46,850 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 602 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 1974 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:46,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [615 Valid, 568 Invalid, 2172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1974 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-24 00:31:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-02-24 00:31:46,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 796. [2022-02-24 00:31:46,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 624 states have (on average 1.2003205128205128) internal successors, (749), 633 states have internal predecessors, (749), 81 states have call successors, (81), 76 states have call predecessors, (81), 90 states have return successors, (100), 86 states have call predecessors, (100), 78 states have call successors, (100) [2022-02-24 00:31:46,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 930 transitions. [2022-02-24 00:31:46,935 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 930 transitions. Word has length 93 [2022-02-24 00:31:46,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:46,935 INFO L470 AbstractCegarLoop]: Abstraction has 796 states and 930 transitions. [2022-02-24 00:31:46,935 INFO L471 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-02-24 00:31:46,935 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 930 transitions. [2022-02-24 00:31:46,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-02-24 00:31:46,936 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:46,936 INFO L514 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-02-24 00:31:46,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-02-24 00:31:46,936 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:46,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:46,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1426092271, now seen corresponding path program 1 times [2022-02-24 00:31:46,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:46,937 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103447997] [2022-02-24 00:31:46,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:46,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:47,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:47,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:47,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:47,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:47,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:47,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-24 00:31:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:47,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:31:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:47,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:47,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:47,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:47,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-24 00:31:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:47,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:47,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-02-24 00:31:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:47,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:47,196 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:47,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103447997] [2022-02-24 00:31:47,196 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103447997] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:47,196 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:47,196 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-24 00:31:47,196 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51580114] [2022-02-24 00:31:47,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:47,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-24 00:31:47,197 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:47,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-24 00:31:47,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-02-24 00:31:47,197 INFO L87 Difference]: Start difference. First operand 796 states and 930 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-02-24 00:31:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:47,774 INFO L93 Difference]: Finished difference Result 1048 states and 1235 transitions. [2022-02-24 00:31:47,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-24 00:31:47,774 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-02-24 00:31:47,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:47,776 INFO L225 Difference]: With dead ends: 1048 [2022-02-24 00:31:47,776 INFO L226 Difference]: Without dead ends: 834 [2022-02-24 00:31:47,776 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2022-02-24 00:31:47,777 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 337 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:47,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [338 Valid, 1070 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-24 00:31:47,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-02-24 00:31:47,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 814. [2022-02-24 00:31:47,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 640 states have (on average 1.1859375) internal successors, (759), 651 states have internal predecessors, (759), 83 states have call successors, (83), 76 states have call predecessors, (83), 90 states have return successors, (100), 86 states have call predecessors, (100), 78 states have call successors, (100) [2022-02-24 00:31:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 942 transitions. [2022-02-24 00:31:47,866 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 942 transitions. Word has length 104 [2022-02-24 00:31:47,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:47,866 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 942 transitions. [2022-02-24 00:31:47,866 INFO L471 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-02-24 00:31:47,866 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 942 transitions. [2022-02-24 00:31:47,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-02-24 00:31:47,867 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:47,868 INFO L514 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-02-24 00:31:47,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-02-24 00:31:47,868 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:47,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:47,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1466232135, now seen corresponding path program 1 times [2022-02-24 00:31:47,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:47,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087305158] [2022-02-24 00:31:47,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:47,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:47,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:47,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:47,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:47,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:47,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:47,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:47,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-02-24 00:31:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:47,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:47,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:47,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:47,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:48,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-02-24 00:31:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:48,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:48,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-24 00:31:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:48,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:48,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:48,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-02-24 00:31:48,067 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:48,067 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087305158] [2022-02-24 00:31:48,067 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087305158] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:48,067 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:48,067 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-02-24 00:31:48,067 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125121734] [2022-02-24 00:31:48,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:48,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-24 00:31:48,068 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:48,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-24 00:31:48,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-02-24 00:31:48,068 INFO L87 Difference]: Start difference. First operand 814 states and 942 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-02-24 00:31:48,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:48,542 INFO L93 Difference]: Finished difference Result 867 states and 993 transitions. [2022-02-24 00:31:48,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-24 00:31:48,542 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-02-24 00:31:48,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:48,543 INFO L225 Difference]: With dead ends: 867 [2022-02-24 00:31:48,543 INFO L226 Difference]: Without dead ends: 717 [2022-02-24 00:31:48,544 INFO L932 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-02-24 00:31:48,544 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 153 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:48,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 897 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-24 00:31:48,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2022-02-24 00:31:48,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 449. [2022-02-24 00:31:48,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 354 states have (on average 1.1440677966101696) internal successors, (405), 358 states have internal predecessors, (405), 46 states have call successors, (46), 46 states have call predecessors, (46), 48 states have return successors, (48), 44 states have call predecessors, (48), 44 states have call successors, (48) [2022-02-24 00:31:48,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 499 transitions. [2022-02-24 00:31:48,600 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 499 transitions. Word has length 113 [2022-02-24 00:31:48,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:48,600 INFO L470 AbstractCegarLoop]: Abstraction has 449 states and 499 transitions. [2022-02-24 00:31:48,600 INFO L471 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-02-24 00:31:48,600 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 499 transitions. [2022-02-24 00:31:48,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-02-24 00:31:48,601 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:48,601 INFO L514 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-02-24 00:31:48,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-02-24 00:31:48,601 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:48,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:48,601 INFO L85 PathProgramCache]: Analyzing trace with hash -165727650, now seen corresponding path program 1 times [2022-02-24 00:31:48,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:48,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707259097] [2022-02-24 00:31:48,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:48,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:48,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:48,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:48,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:48,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:48,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-24 00:31:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:48,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:31:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:48,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:48,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:48,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:48,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-24 00:31:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:48,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:48,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-24 00:31:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:48,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-24 00:31:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31: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-02-24 00:31:48,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:48,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707259097] [2022-02-24 00:31:48,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707259097] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:48,801 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:48,801 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-24 00:31:48,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431783295] [2022-02-24 00:31:48,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:48,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-24 00:31:48,801 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:48,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-24 00:31:48,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-02-24 00:31:48,802 INFO L87 Difference]: Start difference. First operand 449 states and 499 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-02-24 00:31:49,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:49,282 INFO L93 Difference]: Finished difference Result 520 states and 576 transitions. [2022-02-24 00:31:49,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-24 00:31:49,282 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-02-24 00:31:49,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:49,283 INFO L225 Difference]: With dead ends: 520 [2022-02-24 00:31:49,283 INFO L226 Difference]: Without dead ends: 477 [2022-02-24 00:31:49,284 INFO L932 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-02-24 00:31:49,284 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 183 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:49,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 701 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-24 00:31:49,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-02-24 00:31:49,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 457. [2022-02-24 00:31:49,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 360 states have (on average 1.1416666666666666) internal successors, (411), 364 states have internal predecessors, (411), 46 states have call successors, (46), 46 states have call predecessors, (46), 50 states have return successors, (50), 46 states have call predecessors, (50), 44 states have call successors, (50) [2022-02-24 00:31:49,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 507 transitions. [2022-02-24 00:31:49,340 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 507 transitions. Word has length 120 [2022-02-24 00:31:49,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:49,340 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 507 transitions. [2022-02-24 00:31:49,340 INFO L471 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-02-24 00:31:49,340 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 507 transitions. [2022-02-24 00:31:49,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-02-24 00:31:49,341 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:49,341 INFO L514 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-02-24 00:31:49,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-02-24 00:31:49,341 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:49,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:49,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1709722050, now seen corresponding path program 1 times [2022-02-24 00:31:49,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:49,342 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771733634] [2022-02-24 00:31:49,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:49,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:49,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:49,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:49,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:49,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:49,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-24 00:31:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:49,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:31:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:49,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:49,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:49,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:49,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-24 00:31:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:49,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:49,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-24 00:31:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:49,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-24 00:31:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:49,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-24 00:31:49,564 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:49,564 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771733634] [2022-02-24 00:31:49,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771733634] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:49,564 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:49,564 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-24 00:31:49,564 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77327366] [2022-02-24 00:31:49,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:49,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-24 00:31:49,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:49,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-24 00:31:49,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-02-24 00:31:49,565 INFO L87 Difference]: Start difference. First operand 457 states and 507 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-02-24 00:31:49,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:49,947 INFO L93 Difference]: Finished difference Result 612 states and 686 transitions. [2022-02-24 00:31:49,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-24 00:31:49,947 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-02-24 00:31:49,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:49,948 INFO L225 Difference]: With dead ends: 612 [2022-02-24 00:31:49,948 INFO L226 Difference]: Without dead ends: 469 [2022-02-24 00:31:49,949 INFO L932 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-02-24 00:31:49,949 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 274 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:49,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 743 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-24 00:31:49,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2022-02-24 00:31:50,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 457. [2022-02-24 00:31:50,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 360 states have (on average 1.136111111111111) internal successors, (409), 364 states have internal predecessors, (409), 46 states have call successors, (46), 46 states have call predecessors, (46), 50 states have return successors, (50), 46 states have call predecessors, (50), 44 states have call successors, (50) [2022-02-24 00:31:50,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 505 transitions. [2022-02-24 00:31:50,004 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 505 transitions. Word has length 120 [2022-02-24 00:31:50,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:50,004 INFO L470 AbstractCegarLoop]: Abstraction has 457 states and 505 transitions. [2022-02-24 00:31:50,004 INFO L471 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-02-24 00:31:50,004 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 505 transitions. [2022-02-24 00:31:50,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-02-24 00:31:50,005 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:50,005 INFO L514 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-02-24 00:31:50,005 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-02-24 00:31:50,005 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:50,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:50,006 INFO L85 PathProgramCache]: Analyzing trace with hash -232533850, now seen corresponding path program 1 times [2022-02-24 00:31:50,006 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:50,006 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741895310] [2022-02-24 00:31:50,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:50,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:50,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:50,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:50,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:50,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:50,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-24 00:31:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:50,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:31:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:50,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:50,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:50,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:50,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-24 00:31:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:50,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:50,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-24 00:31:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:50,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:50,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:50,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:50,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:50,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-02-24 00:31:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:50,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-02-24 00:31:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:50,381 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-24 00:31:50,381 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:50,381 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741895310] [2022-02-24 00:31:50,381 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741895310] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:50,381 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:50,381 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-02-24 00:31:50,381 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099858187] [2022-02-24 00:31:50,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:50,381 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-24 00:31:50,381 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:50,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-24 00:31:50,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2022-02-24 00:31:50,382 INFO L87 Difference]: Start difference. First operand 457 states and 505 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-02-24 00:31:51,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:51,267 INFO L93 Difference]: Finished difference Result 584 states and 664 transitions. [2022-02-24 00:31:51,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-24 00:31:51,268 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-02-24 00:31:51,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:51,269 INFO L225 Difference]: With dead ends: 584 [2022-02-24 00:31:51,269 INFO L226 Difference]: Without dead ends: 531 [2022-02-24 00:31:51,270 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2022-02-24 00:31:51,270 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 284 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 1783 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 1918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:51,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 1430 Invalid, 1918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1783 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-24 00:31:51,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2022-02-24 00:31:51,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 491. [2022-02-24 00:31:51,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 390 states have (on average 1.146153846153846) internal successors, (447), 394 states have internal predecessors, (447), 46 states have call successors, (46), 46 states have call predecessors, (46), 54 states have return successors, (54), 50 states have call predecessors, (54), 44 states have call successors, (54) [2022-02-24 00:31:51,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 547 transitions. [2022-02-24 00:31:51,350 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 547 transitions. Word has length 150 [2022-02-24 00:31:51,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:51,351 INFO L470 AbstractCegarLoop]: Abstraction has 491 states and 547 transitions. [2022-02-24 00:31:51,351 INFO L471 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-02-24 00:31:51,351 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 547 transitions. [2022-02-24 00:31:51,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-02-24 00:31:51,352 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:51,352 INFO L514 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-02-24 00:31:51,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-02-24 00:31:51,352 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:51,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:51,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2130033855, now seen corresponding path program 1 times [2022-02-24 00:31:51,353 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:51,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720104240] [2022-02-24 00:31:51,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:51,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:51,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:51,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:51,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:51,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:51,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:51,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-24 00:31:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:51,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:31:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:51,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:51,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:51,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:51,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-24 00:31:51,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:51,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:51,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-24 00:31:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:51,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:51,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:51,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:51,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-02-24 00:31:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:51,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-02-24 00:31:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-02-24 00:31:51,594 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:51,594 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720104240] [2022-02-24 00:31:51,594 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720104240] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:51,594 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:51,594 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-02-24 00:31:51,594 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619182803] [2022-02-24 00:31:51,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:51,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-24 00:31:51,595 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:51,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-24 00:31:51,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-02-24 00:31:51,595 INFO L87 Difference]: Start difference. First operand 491 states and 547 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-02-24 00:31:52,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:52,019 INFO L93 Difference]: Finished difference Result 664 states and 748 transitions. [2022-02-24 00:31:52,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-24 00:31:52,019 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-02-24 00:31:52,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:52,020 INFO L225 Difference]: With dead ends: 664 [2022-02-24 00:31:52,020 INFO L226 Difference]: Without dead ends: 519 [2022-02-24 00:31:52,021 INFO L932 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-02-24 00:31:52,021 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 284 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 1045 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:52,021 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 1191 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1045 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-24 00:31:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-02-24 00:31:52,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 491. [2022-02-24 00:31:52,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 390 states have (on average 1.141025641025641) internal successors, (445), 394 states have internal predecessors, (445), 46 states have call successors, (46), 46 states have call predecessors, (46), 54 states have return successors, (54), 50 states have call predecessors, (54), 44 states have call successors, (54) [2022-02-24 00:31:52,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 545 transitions. [2022-02-24 00:31:52,081 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 545 transitions. Word has length 151 [2022-02-24 00:31:52,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:52,082 INFO L470 AbstractCegarLoop]: Abstraction has 491 states and 545 transitions. [2022-02-24 00:31:52,082 INFO L471 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-02-24 00:31:52,082 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 545 transitions. [2022-02-24 00:31:52,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-02-24 00:31:52,083 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:52,083 INFO L514 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-02-24 00:31:52,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-02-24 00:31:52,083 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:52,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:52,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1959969322, now seen corresponding path program 1 times [2022-02-24 00:31:52,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:52,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272876561] [2022-02-24 00:31:52,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:52,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:52,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:52,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:52,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:52,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:52,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-24 00:31:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:52,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:31:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:52,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:52,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:52,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:52,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:52,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-24 00:31:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:52,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:52,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-24 00:31:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:52,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:52,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:52,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:52,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-02-24 00:31:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:52,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-02-24 00:31:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:52,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-02-24 00:31:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:52,365 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-24 00:31:52,365 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:52,365 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272876561] [2022-02-24 00:31:52,365 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272876561] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:52,365 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:52,365 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-02-24 00:31:52,366 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761944807] [2022-02-24 00:31:52,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:52,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-24 00:31:52,366 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:52,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-24 00:31:52,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2022-02-24 00:31:52,366 INFO L87 Difference]: Start difference. First operand 491 states and 545 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-02-24 00:31:53,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:53,150 INFO L93 Difference]: Finished difference Result 556 states and 624 transitions. [2022-02-24 00:31:53,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-24 00:31:53,151 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-02-24 00:31:53,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:53,152 INFO L225 Difference]: With dead ends: 556 [2022-02-24 00:31:53,152 INFO L226 Difference]: Without dead ends: 491 [2022-02-24 00:31:53,152 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2022-02-24 00:31:53,153 INFO L933 BasicCegarLoop]: 167 mSDtfsCounter, 144 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:53,153 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 1171 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-24 00:31:53,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-02-24 00:31:53,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 479. [2022-02-24 00:31:53,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 382 states have (on average 1.1282722513089005) internal successors, (431), 386 states have internal predecessors, (431), 44 states have call successors, (44), 44 states have call predecessors, (44), 52 states have return successors, (52), 48 states have call predecessors, (52), 42 states have call successors, (52) [2022-02-24 00:31:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 527 transitions. [2022-02-24 00:31:53,211 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 527 transitions. Word has length 153 [2022-02-24 00:31:53,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:53,212 INFO L470 AbstractCegarLoop]: Abstraction has 479 states and 527 transitions. [2022-02-24 00:31:53,212 INFO L471 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-02-24 00:31:53,212 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 527 transitions. [2022-02-24 00:31:53,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-02-24 00:31:53,213 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:53,213 INFO L514 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-02-24 00:31:53,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-02-24 00:31:53,213 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:53,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:53,214 INFO L85 PathProgramCache]: Analyzing trace with hash -249606396, now seen corresponding path program 1 times [2022-02-24 00:31:53,214 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:53,214 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946845668] [2022-02-24 00:31:53,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:53,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:53,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-24 00:31:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:31:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:53,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-24 00:31:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:53,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-24 00:31:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:53,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-02-24 00:31:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-02-24 00:31:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-02-24 00:31:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,429 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-24 00:31:53,429 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:53,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946845668] [2022-02-24 00:31:53,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946845668] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:53,429 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:53,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-02-24 00:31:53,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171009631] [2022-02-24 00:31:53,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:53,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-24 00:31:53,430 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:53,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-24 00:31:53,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-02-24 00:31:53,431 INFO L87 Difference]: Start difference. First operand 479 states and 527 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-02-24 00:31:53,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:53,768 INFO L93 Difference]: Finished difference Result 584 states and 642 transitions. [2022-02-24 00:31:53,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-24 00:31:53,770 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-02-24 00:31:53,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:53,771 INFO L225 Difference]: With dead ends: 584 [2022-02-24 00:31:53,771 INFO L226 Difference]: Without dead ends: 451 [2022-02-24 00:31:53,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2022-02-24 00:31:53,771 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 320 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:53,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 587 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-24 00:31:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-02-24 00:31:53,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 423. [2022-02-24 00:31:53,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 334 states have (on average 1.1107784431137724) internal successors, (371), 338 states have internal predecessors, (371), 42 states have call successors, (42), 42 states have call predecessors, (42), 46 states have return successors, (46), 42 states have call predecessors, (46), 40 states have call successors, (46) [2022-02-24 00:31:53,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 459 transitions. [2022-02-24 00:31:53,823 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 459 transitions. Word has length 158 [2022-02-24 00:31:53,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:53,824 INFO L470 AbstractCegarLoop]: Abstraction has 423 states and 459 transitions. [2022-02-24 00:31:53,824 INFO L471 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-02-24 00:31:53,824 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 459 transitions. [2022-02-24 00:31:53,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-02-24 00:31:53,825 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:53,825 INFO L514 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-02-24 00:31:53,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-02-24 00:31:53,825 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:53,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:53,825 INFO L85 PathProgramCache]: Analyzing trace with hash -2090831252, now seen corresponding path program 1 times [2022-02-24 00:31:53,825 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:53,825 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956078762] [2022-02-24 00:31:53,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:53,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-24 00:31:53,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:31:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:53,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-24 00:31:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-24 00:31:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-24 00:31:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-02-24 00:31:54,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-02-24 00:31:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-02-24 00:31:54,031 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:54,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956078762] [2022-02-24 00:31:54,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956078762] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:54,031 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:54,031 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-02-24 00:31:54,031 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655987300] [2022-02-24 00:31:54,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:54,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-24 00:31:54,031 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:54,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-24 00:31:54,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-02-24 00:31:54,032 INFO L87 Difference]: Start difference. First operand 423 states and 459 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-02-24 00:31:54,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:54,317 INFO L93 Difference]: Finished difference Result 536 states and 584 transitions. [2022-02-24 00:31:54,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-24 00:31:54,317 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-02-24 00:31:54,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:54,318 INFO L225 Difference]: With dead ends: 536 [2022-02-24 00:31:54,318 INFO L226 Difference]: Without dead ends: 381 [2022-02-24 00:31:54,318 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2022-02-24 00:31:54,318 INFO L933 BasicCegarLoop]: 149 mSDtfsCounter, 196 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:54,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 730 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-24 00:31:54,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-02-24 00:31:54,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2022-02-24 00:31:54,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 298 states have (on average 1.0973154362416107) internal successors, (327), 300 states have internal predecessors, (327), 40 states have call successors, (40), 40 states have call predecessors, (40), 42 states have return successors, (42), 40 states have call predecessors, (42), 38 states have call successors, (42) [2022-02-24 00:31:54,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 409 transitions. [2022-02-24 00:31:54,361 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 409 transitions. Word has length 160 [2022-02-24 00:31:54,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:54,361 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 409 transitions. [2022-02-24 00:31:54,361 INFO L471 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-02-24 00:31:54,361 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 409 transitions. [2022-02-24 00:31:54,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-02-24 00:31:54,362 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:54,362 INFO L514 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-02-24 00:31:54,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-02-24 00:31:54,362 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:54,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:54,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1980774501, now seen corresponding path program 1 times [2022-02-24 00:31:54,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:54,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724555003] [2022-02-24 00:31:54,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:54,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:54,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-24 00:31:54,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:31:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-24 00:31:54,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-24 00:31:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-24 00:31:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-02-24 00:31:54,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-02-24 00:31:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:54,649 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-24 00:31:54,649 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:54,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724555003] [2022-02-24 00:31:54,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724555003] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:54,650 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:54,650 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-02-24 00:31:54,650 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446649069] [2022-02-24 00:31:54,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:54,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-24 00:31:54,651 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:54,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-24 00:31:54,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-02-24 00:31:54,654 INFO L87 Difference]: Start difference. First operand 381 states and 409 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-02-24 00:31:55,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:55,359 INFO L93 Difference]: Finished difference Result 762 states and 821 transitions. [2022-02-24 00:31:55,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-02-24 00:31:55,359 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-02-24 00:31:55,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:55,360 INFO L225 Difference]: With dead ends: 762 [2022-02-24 00:31:55,360 INFO L226 Difference]: Without dead ends: 387 [2022-02-24 00:31:55,361 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2022-02-24 00:31:55,361 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 435 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:55,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [436 Valid, 597 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-24 00:31:55,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-02-24 00:31:55,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 381. [2022-02-24 00:31:55,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 298 states have (on average 1.0939597315436242) internal successors, (326), 300 states have internal predecessors, (326), 40 states have call successors, (40), 40 states have call predecessors, (40), 42 states have return successors, (42), 40 states have call predecessors, (42), 38 states have call successors, (42) [2022-02-24 00:31:55,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 408 transitions. [2022-02-24 00:31:55,404 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 408 transitions. Word has length 161 [2022-02-24 00:31:55,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:55,404 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 408 transitions. [2022-02-24 00:31:55,404 INFO L471 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-02-24 00:31:55,404 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 408 transitions. [2022-02-24 00:31:55,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-02-24 00:31:55,405 INFO L506 BasicCegarLoop]: Found error trace [2022-02-24 00:31:55,405 INFO L514 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-02-24 00:31:55,405 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-02-24 00:31:55,405 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-24 00:31:55,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-24 00:31:55,405 INFO L85 PathProgramCache]: Analyzing trace with hash -628292860, now seen corresponding path program 1 times [2022-02-24 00:31:55,405 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-24 00:31:55,405 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832198717] [2022-02-24 00:31:55,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-24 00:31:55,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-24 00:31:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:55,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-24 00:31:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:55,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-24 00:31:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:55,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-24 00:31:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:55,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-02-24 00:31:55,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:55,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-24 00:31:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:55,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-02-24 00:31:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:55,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:55,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:55,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:55,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:55,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-02-24 00:31:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:55,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:55,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-24 00:31:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:55,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-24 00:31:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:55,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-24 00:31:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:55,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-24 00:31:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:55,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-24 00:31:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:55,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-02-24 00:31:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:55,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-02-24 00:31:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-24 00:31:55,814 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-02-24 00:31:55,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-24 00:31:55,815 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832198717] [2022-02-24 00:31:55,815 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832198717] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-24 00:31:55,815 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-24 00:31:55,815 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-02-24 00:31:55,815 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980709262] [2022-02-24 00:31:55,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-24 00:31:55,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-24 00:31:55,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-24 00:31:55,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-24 00:31:55,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-02-24 00:31:55,816 INFO L87 Difference]: Start difference. First operand 381 states and 408 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-02-24 00:31:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-24 00:31:56,614 INFO L93 Difference]: Finished difference Result 387 states and 416 transitions. [2022-02-24 00:31:56,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-24 00:31:56,615 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-02-24 00:31:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-24 00:31:56,615 INFO L225 Difference]: With dead ends: 387 [2022-02-24 00:31:56,615 INFO L226 Difference]: Without dead ends: 0 [2022-02-24 00:31:56,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2022-02-24 00:31:56,616 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 432 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-24 00:31:56,616 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [432 Valid, 673 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-24 00:31:56,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-24 00:31:56,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-24 00:31:56,617 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-02-24 00:31:56,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-24 00:31:56,617 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2022-02-24 00:31:56,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-24 00:31:56,617 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-24 00:31:56,617 INFO L471 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-02-24 00:31:56,617 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-24 00:31:56,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-24 00:31:56,619 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-24 00:31:56,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-02-24 00:31:56,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.