/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 23:42:13,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 23:42:13,987 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 23:42:14,033 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 23:42:14,033 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 23:42:14,035 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 23:42:14,037 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 23:42:14,039 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 23:42:14,040 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 23:42:14,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 23:42:14,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 23:42:14,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 23:42:14,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 23:42:14,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 23:42:14,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 23:42:14,050 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 23:42:14,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 23:42:14,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 23:42:14,052 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 23:42:14,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 23:42:14,057 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 23:42:14,057 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 23:42:14,058 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 23:42:14,059 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 23:42:14,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 23:42:14,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 23:42:14,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 23:42:14,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 23:42:14,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 23:42:14,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 23:42:14,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 23:42:14,066 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 23:42:14,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 23:42:14,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 23:42:14,069 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 23:42:14,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 23:42:14,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 23:42:14,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 23:42:14,069 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 23:42:14,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 23:42:14,070 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 23:42:14,071 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-01-31 23:42:14,078 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 23:42:14,079 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 23:42:14,080 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 23:42:14,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 23:42:14,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 23:42:14,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 23:42:14,080 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 23:42:14,080 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 23:42:14,080 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 23:42:14,080 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 23:42:14,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 23:42:14,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 23:42:14,081 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 23:42:14,081 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 23:42:14,082 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 23:42:14,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:42:14,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 23:42:14,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 23:42:14,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 23:42:14,082 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-01-31 23:42:14,082 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-01-31 23:42:14,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 23:42:14,298 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 23:42:14,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 23:42:14,300 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 23:42:14,302 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 23:42:14,303 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c [2022-01-31 23:42:14,382 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fca29e38/56764be2380648a2befa830e8d4d157d/FLAG1acdbf364 [2022-01-31 23:42:14,751 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 23:42:14,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c [2022-01-31 23:42:14,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fca29e38/56764be2380648a2befa830e8d4d157d/FLAG1acdbf364 [2022-01-31 23:42:14,768 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fca29e38/56764be2380648a2befa830e8d4d157d [2022-01-31 23:42:14,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 23:42:14,770 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 23:42:14,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 23:42:14,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 23:42:14,782 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 23:42:14,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:42:14" (1/1) ... [2022-01-31 23:42:14,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30cbd0af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:14, skipping insertion in model container [2022-01-31 23:42:14,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:42:14" (1/1) ... [2022-01-31 23:42:14,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 23:42:14,808 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 23:42:14,950 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_simpl3.cil-2.c[2713,2726] [2022-01-31 23:42:15,004 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:42:15,010 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 23:42:15,019 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_simpl3.cil-2.c[2713,2726] [2022-01-31 23:42:15,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:42:15,061 INFO L208 MainTranslator]: Completed translation [2022-01-31 23:42:15,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:15 WrapperNode [2022-01-31 23:42:15,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 23:42:15,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 23:42:15,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 23:42:15,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 23:42:15,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:15" (1/1) ... [2022-01-31 23:42:15,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:15" (1/1) ... [2022-01-31 23:42:15,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:15" (1/1) ... [2022-01-31 23:42:15,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:15" (1/1) ... [2022-01-31 23:42:15,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:15" (1/1) ... [2022-01-31 23:42:15,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:15" (1/1) ... [2022-01-31 23:42:15,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:15" (1/1) ... [2022-01-31 23:42:15,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 23:42:15,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 23:42:15,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 23:42:15,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 23:42:15,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:15" (1/1) ... [2022-01-31 23:42:15,120 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:42:15,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 23:42:15,139 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-01-31 23:42:15,143 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-01-31 23:42:15,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 23:42:15,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 23:42:15,167 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 23:42:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-01-31 23:42:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-01-31 23:42:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2022-01-31 23:42:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2022-01-31 23:42:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2022-01-31 23:42:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2022-01-31 23:42:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2022-01-31 23:42:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2022-01-31 23:42:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2022-01-31 23:42:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-01-31 23:42:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 23:42:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-01-31 23:42:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-01-31 23:42:15,168 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-01-31 23:42:15,169 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-01-31 23:42:15,169 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-01-31 23:42:15,169 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-01-31 23:42:15,169 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-01-31 23:42:15,169 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-01-31 23:42:15,169 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-01-31 23:42:15,169 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-01-31 23:42:15,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-01-31 23:42:15,169 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-01-31 23:42:15,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-01-31 23:42:15,169 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2022-01-31 23:42:15,169 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 23:42:15,170 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 23:42:15,170 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 23:42:15,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 23:42:15,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-01-31 23:42:15,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 23:42:15,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-01-31 23:42:15,170 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2022-01-31 23:42:15,170 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2022-01-31 23:42:15,170 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2022-01-31 23:42:15,170 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2022-01-31 23:42:15,170 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2022-01-31 23:42:15,170 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2022-01-31 23:42:15,170 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-01-31 23:42:15,170 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-01-31 23:42:15,170 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-01-31 23:42:15,171 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-01-31 23:42:15,171 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-01-31 23:42:15,171 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-01-31 23:42:15,171 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-01-31 23:42:15,171 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-01-31 23:42:15,171 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-01-31 23:42:15,171 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-01-31 23:42:15,171 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-01-31 23:42:15,171 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-01-31 23:42:15,171 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-01-31 23:42:15,171 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-01-31 23:42:15,171 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2022-01-31 23:42:15,171 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-01-31 23:42:15,171 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 23:42:15,172 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-01-31 23:42:15,172 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2022-01-31 23:42:15,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 23:42:15,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 23:42:15,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 23:42:15,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 23:42:15,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 23:42:15,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 23:42:15,285 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 23:42:15,287 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 23:42:15,317 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:15,338 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:42:15,338 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:42:15,344 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:15,350 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:42:15,350 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:42:15,354 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:15,483 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-01-31 23:42:15,484 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-01-31 23:42:15,485 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:15,533 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2022-01-31 23:42:15,533 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2022-01-31 23:42:15,542 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:15,551 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-01-31 23:42:15,552 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-01-31 23:42:15,596 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:15,601 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:42:15,601 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:42:15,601 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:15,606 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:42:15,606 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:42:15,606 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:15,611 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:42:15,611 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:42:15,635 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:15,654 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-01-31 23:42:15,654 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-01-31 23:42:15,671 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:15,674 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:42:15,674 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:42:15,674 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:15,678 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:42:15,679 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:42:15,679 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:15,682 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:42:15,682 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:42:15,689 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 23:42:15,696 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 23:42:15,697 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 23:42:15,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:42:15 BoogieIcfgContainer [2022-01-31 23:42:15,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 23:42:15,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 23:42:15,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 23:42:15,702 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 23:42:15,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:42:14" (1/3) ... [2022-01-31 23:42:15,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8f29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:42:15, skipping insertion in model container [2022-01-31 23:42:15,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:15" (2/3) ... [2022-01-31 23:42:15,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8f29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:42:15, skipping insertion in model container [2022-01-31 23:42:15,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:42:15" (3/3) ... [2022-01-31 23:42:15,704 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2022-01-31 23:42:15,707 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 23:42:15,708 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 23:42:15,736 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 23:42:15,740 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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=QVASR [2022-01-31 23:42:15,740 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 23:42:15,755 INFO L276 IsEmpty]: Start isEmpty. Operand has 304 states, 221 states have (on average 1.420814479638009) internal successors, (314), 243 states have internal predecessors, (314), 56 states have call successors, (56), 24 states have call predecessors, (56), 24 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) [2022-01-31 23:42:15,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 23:42:15,760 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:15,761 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-01-31 23:42:15,761 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:15,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:15,765 INFO L85 PathProgramCache]: Analyzing trace with hash 678159399, now seen corresponding path program 1 times [2022-01-31 23:42:15,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:15,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1356676543] [2022-01-31 23:42:15,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:15,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:15,813 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:16,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:16,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:16,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:16,144 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:16,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1356676543] [2022-01-31 23:42:16,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1356676543] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:16,145 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:16,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 23:42:16,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891754614] [2022-01-31 23:42:16,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:16,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 23:42:16,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:16,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 23:42:16,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 23:42:16,178 INFO L87 Difference]: Start difference. First operand has 304 states, 221 states have (on average 1.420814479638009) internal successors, (314), 243 states have internal predecessors, (314), 56 states have call successors, (56), 24 states have call predecessors, (56), 24 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) 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-01-31 23:42:16,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:16,971 INFO L93 Difference]: Finished difference Result 538 states and 779 transitions. [2022-01-31 23:42:16,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 23:42:16,973 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-01-31 23:42:16,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:16,994 INFO L225 Difference]: With dead ends: 538 [2022-01-31 23:42:16,995 INFO L226 Difference]: Without dead ends: 322 [2022-01-31 23:42:17,001 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-01-31 23:42:17,004 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 240 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:17,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 571 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 23:42:17,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-01-31 23:42:17,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 292. [2022-01-31 23:42:17,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 213 states have (on average 1.3708920187793427) internal successors, (292), 233 states have internal predecessors, (292), 56 states have call successors, (56), 24 states have call predecessors, (56), 22 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-01-31 23:42:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 385 transitions. [2022-01-31 23:42:17,095 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 385 transitions. Word has length 20 [2022-01-31 23:42:17,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:17,095 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 385 transitions. [2022-01-31 23:42:17,095 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-01-31 23:42:17,096 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 385 transitions. [2022-01-31 23:42:17,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 23:42:17,097 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:17,097 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] [2022-01-31 23:42:17,097 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 23:42:17,098 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:17,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:17,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1368814580, now seen corresponding path program 1 times [2022-01-31 23:42:17,098 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:17,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1307226744] [2022-01-31 23:42:17,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:17,105 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:17,108 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:17,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:17,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:17,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:17,242 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:17,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1307226744] [2022-01-31 23:42:17,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1307226744] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:17,243 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:17,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:42:17,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700068152] [2022-01-31 23:42:17,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:17,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:42:17,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:17,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:42:17,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:42:17,245 INFO L87 Difference]: Start difference. First operand 292 states and 385 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 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-01-31 23:42:18,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:18,552 INFO L93 Difference]: Finished difference Result 637 states and 856 transitions. [2022-01-31 23:42:18,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:42:18,552 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 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 28 [2022-01-31 23:42:18,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:18,555 INFO L225 Difference]: With dead ends: 637 [2022-01-31 23:42:18,555 INFO L226 Difference]: Without dead ends: 476 [2022-01-31 23:42:18,556 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-01-31 23:42:18,557 INFO L933 BasicCegarLoop]: 504 mSDtfsCounter, 449 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:18,557 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [455 Valid, 741 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 23:42:18,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-01-31 23:42:18,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 429. [2022-01-31 23:42:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 328 states have (on average 1.3140243902439024) internal successors, (431), 334 states have internal predecessors, (431), 65 states have call successors, (65), 37 states have call predecessors, (65), 35 states have return successors, (74), 59 states have call predecessors, (74), 54 states have call successors, (74) [2022-01-31 23:42:18,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 570 transitions. [2022-01-31 23:42:18,588 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 570 transitions. Word has length 28 [2022-01-31 23:42:18,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:18,588 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 570 transitions. [2022-01-31 23:42:18,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 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-01-31 23:42:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 570 transitions. [2022-01-31 23:42:18,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 23:42:18,589 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:18,589 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] [2022-01-31 23:42:18,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 23:42:18,590 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:18,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:18,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1511850433, now seen corresponding path program 1 times [2022-01-31 23:42:18,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:18,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [217381638] [2022-01-31 23:42:18,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:18,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:18,592 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:18,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:18,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:18,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:18,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:18,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:18,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:18,757 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:18,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [217381638] [2022-01-31 23:42:18,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [217381638] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:18,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:18,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:42:18,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620761199] [2022-01-31 23:42:18,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:18,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:42:18,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:18,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:42:18,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:42:18,759 INFO L87 Difference]: Start difference. First operand 429 states and 570 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 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-01-31 23:42:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:19,395 INFO L93 Difference]: Finished difference Result 943 states and 1257 transitions. [2022-01-31 23:42:19,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:42:19,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 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 30 [2022-01-31 23:42:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:19,402 INFO L225 Difference]: With dead ends: 943 [2022-01-31 23:42:19,402 INFO L226 Difference]: Without dead ends: 675 [2022-01-31 23:42:19,403 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-01-31 23:42:19,408 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 647 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:19,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [654 Valid, 550 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 23:42:19,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-01-31 23:42:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 632. [2022-01-31 23:42:19,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 493 states have (on average 1.3144016227180528) internal successors, (648), 497 states have internal predecessors, (648), 85 states have call successors, (85), 55 states have call predecessors, (85), 53 states have return successors, (112), 81 states have call predecessors, (112), 76 states have call successors, (112) [2022-01-31 23:42:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 845 transitions. [2022-01-31 23:42:19,472 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 845 transitions. Word has length 30 [2022-01-31 23:42:19,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:19,473 INFO L470 AbstractCegarLoop]: Abstraction has 632 states and 845 transitions. [2022-01-31 23:42:19,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 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-01-31 23:42:19,475 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 845 transitions. [2022-01-31 23:42:19,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 23:42:19,482 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:19,482 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] [2022-01-31 23:42:19,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 23:42:19,484 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:19,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:19,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1740442034, now seen corresponding path program 1 times [2022-01-31 23:42:19,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:19,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [76837352] [2022-01-31 23:42:19,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:19,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:19,487 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:19,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:19,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:19,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:19,630 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:19,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [76837352] [2022-01-31 23:42:19,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [76837352] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:19,630 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:19,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:42:19,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988644033] [2022-01-31 23:42:19,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:19,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:42:19,631 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:19,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:42:19,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:42:19,631 INFO L87 Difference]: Start difference. First operand 632 states and 845 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 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-01-31 23:42:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:20,582 INFO L93 Difference]: Finished difference Result 739 states and 979 transitions. [2022-01-31 23:42:20,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:42:20,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 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 34 [2022-01-31 23:42:20,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:20,586 INFO L225 Difference]: With dead ends: 739 [2022-01-31 23:42:20,586 INFO L226 Difference]: Without dead ends: 721 [2022-01-31 23:42:20,586 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-01-31 23:42:20,586 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 474 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:20,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [481 Valid, 444 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 23:42:20,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2022-01-31 23:42:20,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 670. [2022-01-31 23:42:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 525 states have (on average 1.3161904761904761) internal successors, (691), 535 states have internal predecessors, (691), 86 states have call successors, (86), 57 states have call predecessors, (86), 58 states have return successors, (117), 80 states have call predecessors, (117), 78 states have call successors, (117) [2022-01-31 23:42:20,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 894 transitions. [2022-01-31 23:42:20,669 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 894 transitions. Word has length 34 [2022-01-31 23:42:20,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:20,669 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 894 transitions. [2022-01-31 23:42:20,669 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 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-01-31 23:42:20,669 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 894 transitions. [2022-01-31 23:42:20,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 23:42:20,670 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:20,670 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-01-31 23:42:20,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 23:42:20,671 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:20,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:20,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1127947077, now seen corresponding path program 1 times [2022-01-31 23:42:20,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:20,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2095857929] [2022-01-31 23:42:20,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:20,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:20,673 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:20,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:20,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:20,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:20,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:20,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 23:42:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:20,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:20,837 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:20,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2095857929] [2022-01-31 23:42:20,837 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2095857929] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:20,837 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:20,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 23:42:20,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286661850] [2022-01-31 23:42:20,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:20,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 23:42:20,838 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:20,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 23:42:20,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-31 23:42:20,839 INFO L87 Difference]: Start difference. First operand 670 states and 894 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 4 states have internal predecessors, (29), 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-01-31 23:42:22,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:22,068 INFO L93 Difference]: Finished difference Result 763 states and 1009 transitions. [2022-01-31 23:42:22,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:42:22,069 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 4 states have internal predecessors, (29), 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 41 [2022-01-31 23:42:22,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:22,072 INFO L225 Difference]: With dead ends: 763 [2022-01-31 23:42:22,072 INFO L226 Difference]: Without dead ends: 696 [2022-01-31 23:42:22,072 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:42:22,073 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 520 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:22,073 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 722 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 23:42:22,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-01-31 23:42:22,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 674. [2022-01-31 23:42:22,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 528 states have (on average 1.3143939393939394) internal successors, (694), 538 states have internal predecessors, (694), 86 states have call successors, (86), 57 states have call predecessors, (86), 59 states have return successors, (118), 81 states have call predecessors, (118), 78 states have call successors, (118) [2022-01-31 23:42:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 898 transitions. [2022-01-31 23:42:22,118 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 898 transitions. Word has length 41 [2022-01-31 23:42:22,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:22,118 INFO L470 AbstractCegarLoop]: Abstraction has 674 states and 898 transitions. [2022-01-31 23:42:22,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 4 states have internal predecessors, (29), 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-01-31 23:42:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 898 transitions. [2022-01-31 23:42:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 23:42:22,120 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:22,120 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-01-31 23:42:22,120 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 23:42:22,120 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:22,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:22,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1437203420, now seen corresponding path program 1 times [2022-01-31 23:42:22,120 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:22,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [894156210] [2022-01-31 23:42:22,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:22,121 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:22,122 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:22,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:22,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:22,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:22,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:22,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:22,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:22,234 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:22,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [894156210] [2022-01-31 23:42:22,234 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [894156210] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:22,234 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:22,234 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:42:22,234 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181160096] [2022-01-31 23:42:22,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:22,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:42:22,235 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:22,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:42:22,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:42:22,235 INFO L87 Difference]: Start difference. First operand 674 states and 898 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 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-01-31 23:42:22,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:22,831 INFO L93 Difference]: Finished difference Result 701 states and 932 transitions. [2022-01-31 23:42:22,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:42:22,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 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 40 [2022-01-31 23:42:22,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:22,834 INFO L225 Difference]: With dead ends: 701 [2022-01-31 23:42:22,834 INFO L226 Difference]: Without dead ends: 698 [2022-01-31 23:42:22,835 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-01-31 23:42:22,835 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 314 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:22,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 558 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 23:42:22,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2022-01-31 23:42:22,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 685. [2022-01-31 23:42:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 539 states have (on average 1.313543599257885) internal successors, (708), 548 states have internal predecessors, (708), 86 states have call successors, (86), 58 states have call predecessors, (86), 59 states have return successors, (118), 81 states have call predecessors, (118), 78 states have call successors, (118) [2022-01-31 23:42:22,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 912 transitions. [2022-01-31 23:42:22,878 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 912 transitions. Word has length 40 [2022-01-31 23:42:22,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:22,878 INFO L470 AbstractCegarLoop]: Abstraction has 685 states and 912 transitions. [2022-01-31 23:42:22,878 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 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-01-31 23:42:22,878 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 912 transitions. [2022-01-31 23:42:22,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 23:42:22,879 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:22,879 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-01-31 23:42:22,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 23:42:22,879 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:22,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:22,880 INFO L85 PathProgramCache]: Analyzing trace with hash 875613287, now seen corresponding path program 1 times [2022-01-31 23:42:22,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:22,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [114104385] [2022-01-31 23:42:22,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:22,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:22,881 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:22,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:22,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:23,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:23,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:23,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:42:23,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:23,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:23,057 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:23,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [114104385] [2022-01-31 23:42:23,057 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [114104385] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:23,057 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:23,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:42:23,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530045893] [2022-01-31 23:42:23,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:23,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:42:23,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:23,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:42:23,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:42:23,058 INFO L87 Difference]: Start difference. First operand 685 states and 912 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 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-01-31 23:42:23,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:23,708 INFO L93 Difference]: Finished difference Result 752 states and 994 transitions. [2022-01-31 23:42:23,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:42:23,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 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-01-31 23:42:23,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:23,711 INFO L225 Difference]: With dead ends: 752 [2022-01-31 23:42:23,711 INFO L226 Difference]: Without dead ends: 747 [2022-01-31 23:42:23,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-31 23:42:23,712 INFO L933 BasicCegarLoop]: 330 mSDtfsCounter, 422 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:23,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 713 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 23:42:23,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-01-31 23:42:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 718. [2022-01-31 23:42:23,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 566 states have (on average 1.3091872791519434) internal successors, (741), 578 states have internal predecessors, (741), 86 states have call successors, (86), 58 states have call predecessors, (86), 65 states have return successors, (124), 83 states have call predecessors, (124), 78 states have call successors, (124) [2022-01-31 23:42:23,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 951 transitions. [2022-01-31 23:42:23,756 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 951 transitions. Word has length 41 [2022-01-31 23:42:23,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:23,756 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 951 transitions. [2022-01-31 23:42:23,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 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-01-31 23:42:23,756 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 951 transitions. [2022-01-31 23:42:23,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 23:42:23,757 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:23,757 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-01-31 23:42:23,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 23:42:23,757 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:23,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:23,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1826085718, now seen corresponding path program 1 times [2022-01-31 23:42:23,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:23,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [268662309] [2022-01-31 23:42:23,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:23,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:23,759 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:23,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:23,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:23,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:23,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:23,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:23,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:23,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:42:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:23,947 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:23,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [268662309] [2022-01-31 23:42:23,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [268662309] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:23,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:23,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:42:23,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415615611] [2022-01-31 23:42:23,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:23,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:42:23,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:23,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:42:23,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:42:23,948 INFO L87 Difference]: Start difference. First operand 718 states and 951 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 7 states have internal predecessors, (30), 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-01-31 23:42:24,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:24,806 INFO L93 Difference]: Finished difference Result 753 states and 993 transitions. [2022-01-31 23:42:24,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 23:42:24,806 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 7 states have internal predecessors, (30), 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 42 [2022-01-31 23:42:24,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:24,810 INFO L225 Difference]: With dead ends: 753 [2022-01-31 23:42:24,810 INFO L226 Difference]: Without dead ends: 747 [2022-01-31 23:42:24,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-01-31 23:42:24,811 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 1226 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:24,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1236 Valid, 666 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 23:42:24,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-01-31 23:42:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 718. [2022-01-31 23:42:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 566 states have (on average 1.3074204946996466) internal successors, (740), 578 states have internal predecessors, (740), 86 states have call successors, (86), 58 states have call predecessors, (86), 65 states have return successors, (124), 83 states have call predecessors, (124), 78 states have call successors, (124) [2022-01-31 23:42:24,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 950 transitions. [2022-01-31 23:42:24,922 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 950 transitions. Word has length 42 [2022-01-31 23:42:24,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:24,922 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 950 transitions. [2022-01-31 23:42:24,922 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 7 states have internal predecessors, (30), 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-01-31 23:42:24,922 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 950 transitions. [2022-01-31 23:42:24,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 23:42:24,939 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:24,939 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-01-31 23:42:24,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 23:42:24,940 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:24,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:24,940 INFO L85 PathProgramCache]: Analyzing trace with hash -86309196, now seen corresponding path program 1 times [2022-01-31 23:42:24,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:24,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [342033511] [2022-01-31 23:42:24,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:24,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:24,942 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:25,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:25,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:25,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:25,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:25,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:25,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:25,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:25,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:42:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:25,147 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:25,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [342033511] [2022-01-31 23:42:25,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [342033511] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:25,147 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:25,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:42:25,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241456126] [2022-01-31 23:42:25,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:25,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:42:25,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:25,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:42:25,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:42:25,148 INFO L87 Difference]: Start difference. First operand 718 states and 950 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 7 states have internal predecessors, (31), 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-01-31 23:42:26,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:26,177 INFO L93 Difference]: Finished difference Result 753 states and 992 transitions. [2022-01-31 23:42:26,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 23:42:26,177 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 7 states have internal predecessors, (31), 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 43 [2022-01-31 23:42:26,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:26,180 INFO L225 Difference]: With dead ends: 753 [2022-01-31 23:42:26,180 INFO L226 Difference]: Without dead ends: 747 [2022-01-31 23:42:26,180 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-01-31 23:42:26,181 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 662 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:26,181 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [672 Valid, 732 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 23:42:26,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-01-31 23:42:26,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 718. [2022-01-31 23:42:26,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 566 states have (on average 1.3056537102473498) internal successors, (739), 578 states have internal predecessors, (739), 86 states have call successors, (86), 58 states have call predecessors, (86), 65 states have return successors, (124), 83 states have call predecessors, (124), 78 states have call successors, (124) [2022-01-31 23:42:26,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 949 transitions. [2022-01-31 23:42:26,241 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 949 transitions. Word has length 43 [2022-01-31 23:42:26,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:26,241 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 949 transitions. [2022-01-31 23:42:26,241 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 7 states have internal predecessors, (31), 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-01-31 23:42:26,241 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 949 transitions. [2022-01-31 23:42:26,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 23:42:26,242 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:26,242 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-01-31 23:42:26,242 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 23:42:26,242 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:26,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:26,243 INFO L85 PathProgramCache]: Analyzing trace with hash -730291913, now seen corresponding path program 1 times [2022-01-31 23:42:26,243 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:26,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1383581662] [2022-01-31 23:42:26,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:26,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:26,247 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:26,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:26,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:26,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:26,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 23:42:26,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:26,366 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:26,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1383581662] [2022-01-31 23:42:26,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1383581662] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:26,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:26,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:42:26,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884173089] [2022-01-31 23:42:26,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:26,367 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:42:26,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:26,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:42:26,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:42:26,367 INFO L87 Difference]: Start difference. First operand 718 states and 949 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 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-01-31 23:42:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:27,095 INFO L93 Difference]: Finished difference Result 1093 states and 1463 transitions. [2022-01-31 23:42:27,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:42:27,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 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 44 [2022-01-31 23:42:27,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:27,100 INFO L225 Difference]: With dead ends: 1093 [2022-01-31 23:42:27,101 INFO L226 Difference]: Without dead ends: 1090 [2022-01-31 23:42:27,101 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-01-31 23:42:27,102 INFO L933 BasicCegarLoop]: 434 mSDtfsCounter, 653 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:27,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [666 Valid, 634 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 23:42:27,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2022-01-31 23:42:27,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 831. [2022-01-31 23:42:27,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 657 states have (on average 1.3135464231354643) internal successors, (863), 671 states have internal predecessors, (863), 96 states have call successors, (96), 68 states have call predecessors, (96), 77 states have return successors, (144), 93 states have call predecessors, (144), 88 states have call successors, (144) [2022-01-31 23:42:27,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1103 transitions. [2022-01-31 23:42:27,176 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1103 transitions. Word has length 44 [2022-01-31 23:42:27,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:27,176 INFO L470 AbstractCegarLoop]: Abstraction has 831 states and 1103 transitions. [2022-01-31 23:42:27,176 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 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-01-31 23:42:27,176 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1103 transitions. [2022-01-31 23:42:27,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 23:42:27,178 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:27,178 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-01-31 23:42:27,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 23:42:27,178 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:27,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:27,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1703157951, now seen corresponding path program 1 times [2022-01-31 23:42:27,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:27,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [912284925] [2022-01-31 23:42:27,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:27,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:27,180 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:27,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:27,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:27,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:27,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:27,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:27,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:42:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:27,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:27,315 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:27,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [912284925] [2022-01-31 23:42:27,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [912284925] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:27,315 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:27,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:42:27,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626871598] [2022-01-31 23:42:27,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:27,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:42:27,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:27,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:42:27,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:42:27,316 INFO L87 Difference]: Start difference. First operand 831 states and 1103 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 4 states have internal predecessors, (32), 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-01-31 23:42:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:28,052 INFO L93 Difference]: Finished difference Result 874 states and 1154 transitions. [2022-01-31 23:42:28,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 23:42:28,052 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 4 states have internal predecessors, (32), 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 44 [2022-01-31 23:42:28,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:28,056 INFO L225 Difference]: With dead ends: 874 [2022-01-31 23:42:28,056 INFO L226 Difference]: Without dead ends: 856 [2022-01-31 23:42:28,058 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-01-31 23:42:28,058 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 257 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:28,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 1080 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 23:42:28,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2022-01-31 23:42:28,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 829. [2022-01-31 23:42:28,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 656 states have (on average 1.3125) internal successors, (861), 670 states have internal predecessors, (861), 95 states have call successors, (95), 68 states have call predecessors, (95), 77 states have return successors, (143), 92 states have call predecessors, (143), 87 states have call successors, (143) [2022-01-31 23:42:28,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1099 transitions. [2022-01-31 23:42:28,164 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1099 transitions. Word has length 44 [2022-01-31 23:42:28,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:28,164 INFO L470 AbstractCegarLoop]: Abstraction has 829 states and 1099 transitions. [2022-01-31 23:42:28,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 4 states have internal predecessors, (32), 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-01-31 23:42:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1099 transitions. [2022-01-31 23:42:28,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 23:42:28,165 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:28,165 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-01-31 23:42:28,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 23:42:28,165 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:28,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:28,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1402041733, now seen corresponding path program 1 times [2022-01-31 23:42:28,165 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:28,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1689808559] [2022-01-31 23:42:28,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:28,166 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:28,167 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:28,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:28,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:28,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:28,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:28,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 23:42:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:28,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:28,347 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:28,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1689808559] [2022-01-31 23:42:28,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1689808559] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:28,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:28,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:42:28,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657673475] [2022-01-31 23:42:28,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:28,348 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:42:28,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:28,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:42:28,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:42:28,348 INFO L87 Difference]: Start difference. First operand 829 states and 1099 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 6 states have internal predecessors, (33), 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-01-31 23:42:29,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:29,848 INFO L93 Difference]: Finished difference Result 1427 states and 1864 transitions. [2022-01-31 23:42:29,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:42:29,848 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 6 states have internal predecessors, (33), 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 45 [2022-01-31 23:42:29,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:29,852 INFO L225 Difference]: With dead ends: 1427 [2022-01-31 23:42:29,852 INFO L226 Difference]: Without dead ends: 874 [2022-01-31 23:42:29,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-01-31 23:42:29,853 INFO L933 BasicCegarLoop]: 450 mSDtfsCounter, 1298 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:29,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1310 Valid, 698 Invalid, 1767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 23:42:29,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2022-01-31 23:42:29,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 820. [2022-01-31 23:42:29,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 647 states have (on average 1.2982998454404946) internal successors, (840), 661 states have internal predecessors, (840), 95 states have call successors, (95), 68 states have call predecessors, (95), 77 states have return successors, (143), 92 states have call predecessors, (143), 87 states have call successors, (143) [2022-01-31 23:42:29,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1078 transitions. [2022-01-31 23:42:29,948 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1078 transitions. Word has length 45 [2022-01-31 23:42:29,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:29,948 INFO L470 AbstractCegarLoop]: Abstraction has 820 states and 1078 transitions. [2022-01-31 23:42:29,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 6 states have internal predecessors, (33), 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-01-31 23:42:29,948 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1078 transitions. [2022-01-31 23:42:29,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 23:42:29,949 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:29,949 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] [2022-01-31 23:42:29,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 23:42:29,949 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:29,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:29,950 INFO L85 PathProgramCache]: Analyzing trace with hash -81440673, now seen corresponding path program 1 times [2022-01-31 23:42:29,950 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:29,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1719355646] [2022-01-31 23:42:29,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:29,950 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:29,951 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:30,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:30,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:30,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:30,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:30,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 23:42:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:30,067 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:30,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1719355646] [2022-01-31 23:42:30,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1719355646] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:30,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:30,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:42:30,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232837098] [2022-01-31 23:42:30,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:30,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:42:30,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:30,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:42:30,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:42:30,068 INFO L87 Difference]: Start difference. First operand 820 states and 1078 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 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-01-31 23:42:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:30,845 INFO L93 Difference]: Finished difference Result 919 states and 1179 transitions. [2022-01-31 23:42:30,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 23:42:30,846 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 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 49 [2022-01-31 23:42:30,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:30,847 INFO L225 Difference]: With dead ends: 919 [2022-01-31 23:42:30,847 INFO L226 Difference]: Without dead ends: 580 [2022-01-31 23:42:30,848 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-01-31 23:42:30,850 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 685 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:30,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [692 Valid, 747 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 23:42:30,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2022-01-31 23:42:30,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 528. [2022-01-31 23:42:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 416 states have (on average 1.2740384615384615) internal successors, (530), 427 states have internal predecessors, (530), 62 states have call successors, (62), 43 states have call predecessors, (62), 49 states have return successors, (75), 59 states have call predecessors, (75), 54 states have call successors, (75) [2022-01-31 23:42:30,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 667 transitions. [2022-01-31 23:42:30,907 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 667 transitions. Word has length 49 [2022-01-31 23:42:30,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:30,907 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 667 transitions. [2022-01-31 23:42:30,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 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-01-31 23:42:30,907 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 667 transitions. [2022-01-31 23:42:30,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 23:42:30,908 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:30,908 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-01-31 23:42:30,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 23:42:30,908 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:30,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:30,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1263125299, now seen corresponding path program 1 times [2022-01-31 23:42:30,908 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:30,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [672039509] [2022-01-31 23:42:30,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:30,908 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:30,910 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:30,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:30,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:31,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:31,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:31,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 23:42:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:31,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:42:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:31,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 23:42:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:31,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:31,050 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:31,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [672039509] [2022-01-31 23:42:31,050 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [672039509] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:31,050 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:31,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:42:31,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149676159] [2022-01-31 23:42:31,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:31,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:42:31,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:31,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:42:31,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:42:31,051 INFO L87 Difference]: Start difference. First operand 528 states and 667 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 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-01-31 23:42:31,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:31,940 INFO L93 Difference]: Finished difference Result 834 states and 1062 transitions. [2022-01-31 23:42:31,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 23:42:31,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 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 58 [2022-01-31 23:42:31,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:31,954 INFO L225 Difference]: With dead ends: 834 [2022-01-31 23:42:31,954 INFO L226 Difference]: Without dead ends: 569 [2022-01-31 23:42:31,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:42:31,955 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 288 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:31,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 761 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 23:42:31,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-01-31 23:42:32,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 542. [2022-01-31 23:42:32,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 429 states have (on average 1.275058275058275) internal successors, (547), 440 states have internal predecessors, (547), 62 states have call successors, (62), 43 states have call predecessors, (62), 50 states have return successors, (78), 59 states have call predecessors, (78), 54 states have call successors, (78) [2022-01-31 23:42:32,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 687 transitions. [2022-01-31 23:42:32,075 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 687 transitions. Word has length 58 [2022-01-31 23:42:32,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:32,075 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 687 transitions. [2022-01-31 23:42:32,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 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-01-31 23:42:32,076 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 687 transitions. [2022-01-31 23:42:32,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 23:42:32,076 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:32,076 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-01-31 23:42:32,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 23:42:32,077 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:32,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:32,077 INFO L85 PathProgramCache]: Analyzing trace with hash 445989130, now seen corresponding path program 1 times [2022-01-31 23:42:32,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:32,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1723496874] [2022-01-31 23:42:32,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:32,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:32,079 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:32,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:32,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:32,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:32,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:32,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:32,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:32,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:42:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:32,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:32,244 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:32,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1723496874] [2022-01-31 23:42:32,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1723496874] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:32,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:32,244 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:42:32,245 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724131048] [2022-01-31 23:42:32,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:32,245 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:42:32,245 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:32,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:42:32,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:42:32,245 INFO L87 Difference]: Start difference. First operand 542 states and 687 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 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-01-31 23:42:33,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:33,524 INFO L93 Difference]: Finished difference Result 780 states and 989 transitions. [2022-01-31 23:42:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 23:42:33,524 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 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-01-31 23:42:33,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:33,527 INFO L225 Difference]: With dead ends: 780 [2022-01-31 23:42:33,527 INFO L226 Difference]: Without dead ends: 714 [2022-01-31 23:42:33,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2022-01-31 23:42:33,531 INFO L933 BasicCegarLoop]: 433 mSDtfsCounter, 1020 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:33,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1022 Valid, 1068 Invalid, 1805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 23:42:33,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-01-31 23:42:33,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 571. [2022-01-31 23:42:33,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 452 states have (on average 1.2676991150442478) internal successors, (573), 464 states have internal predecessors, (573), 64 states have call successors, (64), 44 states have call predecessors, (64), 54 states have return successors, (83), 63 states have call predecessors, (83), 56 states have call successors, (83) [2022-01-31 23:42:33,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 720 transitions. [2022-01-31 23:42:33,628 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 720 transitions. Word has length 52 [2022-01-31 23:42:33,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:33,628 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 720 transitions. [2022-01-31 23:42:33,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 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-01-31 23:42:33,628 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 720 transitions. [2022-01-31 23:42:33,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 23:42:33,629 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:33,629 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-01-31 23:42:33,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 23:42:33,629 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:33,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:33,629 INFO L85 PathProgramCache]: Analyzing trace with hash -119997841, now seen corresponding path program 1 times [2022-01-31 23:42:33,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:33,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1493384938] [2022-01-31 23:42:33,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:33,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:33,631 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:33,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:33,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:33,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:33,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:33,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:33,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:42:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:33,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:33,792 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:33,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1493384938] [2022-01-31 23:42:33,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1493384938] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:33,792 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:33,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:42:33,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852645541] [2022-01-31 23:42:33,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:33,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:42:33,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:33,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:42:33,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:42:33,793 INFO L87 Difference]: Start difference. First operand 571 states and 720 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), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 23:42:34,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:34,888 INFO L93 Difference]: Finished difference Result 1006 states and 1293 transitions. [2022-01-31 23:42:34,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:42:34,889 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), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2022-01-31 23:42:34,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:34,902 INFO L225 Difference]: With dead ends: 1006 [2022-01-31 23:42:34,902 INFO L226 Difference]: Without dead ends: 638 [2022-01-31 23:42:34,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-01-31 23:42:34,904 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 502 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:34,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [516 Valid, 750 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 23:42:34,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-01-31 23:42:35,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 583. [2022-01-31 23:42:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 464 states have (on average 1.271551724137931) internal successors, (590), 476 states have internal predecessors, (590), 64 states have call successors, (64), 44 states have call predecessors, (64), 54 states have return successors, (83), 63 states have call predecessors, (83), 56 states have call successors, (83) [2022-01-31 23:42:35,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 737 transitions. [2022-01-31 23:42:35,007 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 737 transitions. Word has length 54 [2022-01-31 23:42:35,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:35,007 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 737 transitions. [2022-01-31 23:42:35,008 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), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 23:42:35,008 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 737 transitions. [2022-01-31 23:42:35,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 23:42:35,009 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:35,009 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-01-31 23:42:35,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 23:42:35,009 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:35,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:35,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1708345743, now seen corresponding path program 1 times [2022-01-31 23:42:35,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:35,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [193138719] [2022-01-31 23:42:35,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:35,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:35,011 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:35,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:35,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:35,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:35,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:35,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:42:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:35,189 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:35,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [193138719] [2022-01-31 23:42:35,189 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [193138719] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:35,189 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:35,189 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 23:42:35,189 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470830805] [2022-01-31 23:42:35,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:35,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 23:42:35,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:35,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 23:42:35,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-01-31 23:42:35,190 INFO L87 Difference]: Start difference. First operand 583 states and 737 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 8 states have internal predecessors, (42), 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-01-31 23:42:36,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:36,579 INFO L93 Difference]: Finished difference Result 692 states and 873 transitions. [2022-01-31 23:42:36,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 23:42:36,579 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 8 states have internal predecessors, (42), 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 54 [2022-01-31 23:42:36,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:36,581 INFO L225 Difference]: With dead ends: 692 [2022-01-31 23:42:36,581 INFO L226 Difference]: Without dead ends: 611 [2022-01-31 23:42:36,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-01-31 23:42:36,582 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 545 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:36,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [553 Valid, 906 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 23:42:36,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-01-31 23:42:36,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 564. [2022-01-31 23:42:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 447 states have (on average 1.2662192393736018) internal successors, (566), 459 states have internal predecessors, (566), 64 states have call successors, (64), 44 states have call predecessors, (64), 52 states have return successors, (81), 61 states have call predecessors, (81), 56 states have call successors, (81) [2022-01-31 23:42:36,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 711 transitions. [2022-01-31 23:42:36,683 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 711 transitions. Word has length 54 [2022-01-31 23:42:36,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:36,683 INFO L470 AbstractCegarLoop]: Abstraction has 564 states and 711 transitions. [2022-01-31 23:42:36,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 8 states have internal predecessors, (42), 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-01-31 23:42:36,684 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 711 transitions. [2022-01-31 23:42:36,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 23:42:36,688 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:36,688 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-01-31 23:42:36,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 23:42:36,688 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:36,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:36,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1565066385, now seen corresponding path program 1 times [2022-01-31 23:42:36,688 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:36,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [218112124] [2022-01-31 23:42:36,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:36,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:36,690 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:36,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:36,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:36,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:36,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:36,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:36,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:42:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:36,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-01-31 23:42:36,824 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:36,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [218112124] [2022-01-31 23:42:36,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [218112124] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:36,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:36,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:42:36,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451012464] [2022-01-31 23:42:36,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:36,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:42:36,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:36,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:42:36,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:42:36,825 INFO L87 Difference]: Start difference. First operand 564 states and 711 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 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-01-31 23:42:37,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:37,571 INFO L93 Difference]: Finished difference Result 679 states and 856 transitions. [2022-01-31 23:42:37,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 23:42:37,571 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 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 54 [2022-01-31 23:42:37,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:37,573 INFO L225 Difference]: With dead ends: 679 [2022-01-31 23:42:37,573 INFO L226 Difference]: Without dead ends: 666 [2022-01-31 23:42:37,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-31 23:42:37,574 INFO L933 BasicCegarLoop]: 421 mSDtfsCounter, 441 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:37,574 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [450 Valid, 788 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 23:42:37,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-01-31 23:42:37,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 580. [2022-01-31 23:42:37,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 461 states have (on average 1.2668112798264641) internal successors, (584), 473 states have internal predecessors, (584), 64 states have call successors, (64), 45 states have call predecessors, (64), 54 states have return successors, (85), 62 states have call predecessors, (85), 57 states have call successors, (85) [2022-01-31 23:42:37,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 733 transitions. [2022-01-31 23:42:37,680 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 733 transitions. Word has length 54 [2022-01-31 23:42:37,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:37,681 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 733 transitions. [2022-01-31 23:42:37,681 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 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-01-31 23:42:37,681 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 733 transitions. [2022-01-31 23:42:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 23:42:37,681 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:37,682 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-01-31 23:42:37,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 23:42:37,682 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:37,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:37,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1595293189, now seen corresponding path program 1 times [2022-01-31 23:42:37,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:37,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [899009952] [2022-01-31 23:42:37,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:37,682 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:37,683 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:37,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:37,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:37,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:37,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 23:42:37,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:37,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:42:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:37,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:42:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:37,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:37,909 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:37,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [899009952] [2022-01-31 23:42:37,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [899009952] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:37,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:37,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:42:37,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902054242] [2022-01-31 23:42:37,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:37,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:42:37,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:37,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:42:37,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:42:37,910 INFO L87 Difference]: Start difference. First operand 580 states and 733 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 4 states have internal predecessors, (45), 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-01-31 23:42:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:38,536 INFO L93 Difference]: Finished difference Result 877 states and 1118 transitions. [2022-01-31 23:42:38,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:42:38,537 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 4 states have internal predecessors, (45), 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 61 [2022-01-31 23:42:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:38,539 INFO L225 Difference]: With dead ends: 877 [2022-01-31 23:42:38,539 INFO L226 Difference]: Without dead ends: 544 [2022-01-31 23:42:38,540 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-01-31 23:42:38,540 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 464 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:38,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [470 Valid, 1080 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 23:42:38,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-01-31 23:42:38,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 506. [2022-01-31 23:42:38,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 398 states have (on average 1.2487437185929648) internal successors, (497), 406 states have internal predecessors, (497), 60 states have call successors, (60), 43 states have call predecessors, (60), 47 states have return successors, (70), 57 states have call predecessors, (70), 54 states have call successors, (70) [2022-01-31 23:42:38,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 627 transitions. [2022-01-31 23:42:38,618 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 627 transitions. Word has length 61 [2022-01-31 23:42:38,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:38,618 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 627 transitions. [2022-01-31 23:42:38,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 4 states have internal predecessors, (45), 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-01-31 23:42:38,618 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 627 transitions. [2022-01-31 23:42:38,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 23:42:38,619 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:38,619 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-01-31 23:42:38,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 23:42:38,619 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:38,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:38,619 INFO L85 PathProgramCache]: Analyzing trace with hash -820540082, now seen corresponding path program 1 times [2022-01-31 23:42:38,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:38,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1305194749] [2022-01-31 23:42:38,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:38,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:38,622 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:38,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:38,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:38,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:38,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:38,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:42:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:38,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:38,775 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:38,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1305194749] [2022-01-31 23:42:38,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1305194749] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:38,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:38,777 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 23:42:38,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655423880] [2022-01-31 23:42:38,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:38,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 23:42:38,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:38,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 23:42:38,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-01-31 23:42:38,778 INFO L87 Difference]: Start difference. First operand 506 states and 627 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 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-01-31 23:42:39,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:39,651 INFO L93 Difference]: Finished difference Result 571 states and 711 transitions. [2022-01-31 23:42:39,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:42:39,652 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 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 55 [2022-01-31 23:42:39,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:39,653 INFO L225 Difference]: With dead ends: 571 [2022-01-31 23:42:39,654 INFO L226 Difference]: Without dead ends: 567 [2022-01-31 23:42:39,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:42:39,654 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 344 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:39,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 1544 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 23:42:39,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-01-31 23:42:39,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 523. [2022-01-31 23:42:39,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 413 states have (on average 1.2397094430992737) internal successors, (512), 421 states have internal predecessors, (512), 60 states have call successors, (60), 43 states have call predecessors, (60), 49 states have return successors, (77), 59 states have call predecessors, (77), 54 states have call successors, (77) [2022-01-31 23:42:39,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 649 transitions. [2022-01-31 23:42:39,741 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 649 transitions. Word has length 55 [2022-01-31 23:42:39,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:39,741 INFO L470 AbstractCegarLoop]: Abstraction has 523 states and 649 transitions. [2022-01-31 23:42:39,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 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-01-31 23:42:39,742 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 649 transitions. [2022-01-31 23:42:39,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 23:42:39,742 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:39,742 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-01-31 23:42:39,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 23:42:39,743 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:39,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:39,743 INFO L85 PathProgramCache]: Analyzing trace with hash -820263252, now seen corresponding path program 1 times [2022-01-31 23:42:39,743 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:39,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [541197498] [2022-01-31 23:42:39,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:39,743 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:39,744 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:39,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:39,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:39,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:39,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:39,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:39,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:42:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:39,918 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:39,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [541197498] [2022-01-31 23:42:39,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [541197498] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:39,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:39,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 23:42:39,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033665113] [2022-01-31 23:42:39,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:39,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 23:42:39,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:39,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 23:42:39,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-01-31 23:42:39,920 INFO L87 Difference]: Start difference. First operand 523 states and 649 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 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-01-31 23:42:41,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:41,279 INFO L93 Difference]: Finished difference Result 566 states and 699 transitions. [2022-01-31 23:42:41,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 23:42:41,280 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 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 55 [2022-01-31 23:42:41,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:41,282 INFO L225 Difference]: With dead ends: 566 [2022-01-31 23:42:41,282 INFO L226 Difference]: Without dead ends: 551 [2022-01-31 23:42:41,282 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-01-31 23:42:41,282 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 156 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 2145 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 2205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:41,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 1484 Invalid, 2205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2145 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 23:42:41,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-01-31 23:42:41,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 520. [2022-01-31 23:42:41,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 410 states have (on average 1.2414634146341463) internal successors, (509), 419 states have internal predecessors, (509), 60 states have call successors, (60), 43 states have call predecessors, (60), 49 states have return successors, (76), 58 states have call predecessors, (76), 54 states have call successors, (76) [2022-01-31 23:42:41,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 645 transitions. [2022-01-31 23:42:41,365 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 645 transitions. Word has length 55 [2022-01-31 23:42:41,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:41,365 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 645 transitions. [2022-01-31 23:42:41,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 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-01-31 23:42:41,365 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 645 transitions. [2022-01-31 23:42:41,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 23:42:41,366 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:41,366 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] [2022-01-31 23:42:41,366 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 23:42:41,367 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:41,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:41,367 INFO L85 PathProgramCache]: Analyzing trace with hash 329966136, now seen corresponding path program 1 times [2022-01-31 23:42:41,367 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:41,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2084535272] [2022-01-31 23:42:41,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:41,367 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:41,368 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:41,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:41,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:41,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:41,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:41,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:41,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:41,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 23:42:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:41,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 23:42:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:41,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:41,542 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:41,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2084535272] [2022-01-31 23:42:41,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2084535272] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:41,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:41,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:42:41,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705732267] [2022-01-31 23:42:41,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:41,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:42:41,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:41,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:42:41,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:42:41,543 INFO L87 Difference]: Start difference. First operand 520 states and 645 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 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-01-31 23:42:42,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:42,477 INFO L93 Difference]: Finished difference Result 566 states and 698 transitions. [2022-01-31 23:42:42,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 23:42:42,477 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 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 57 [2022-01-31 23:42:42,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:42,479 INFO L225 Difference]: With dead ends: 566 [2022-01-31 23:42:42,479 INFO L226 Difference]: Without dead ends: 523 [2022-01-31 23:42:42,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:42:42,480 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 420 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:42,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [431 Valid, 793 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 23:42:42,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-01-31 23:42:42,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 496. [2022-01-31 23:42:42,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 392 states have (on average 1.2372448979591837) internal successors, (485), 400 states have internal predecessors, (485), 58 states have call successors, (58), 41 states have call predecessors, (58), 45 states have return successors, (72), 55 states have call predecessors, (72), 52 states have call successors, (72) [2022-01-31 23:42:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 615 transitions. [2022-01-31 23:42:42,560 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 615 transitions. Word has length 57 [2022-01-31 23:42:42,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:42,560 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 615 transitions. [2022-01-31 23:42:42,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 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-01-31 23:42:42,560 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 615 transitions. [2022-01-31 23:42:42,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 23:42:42,561 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:42,561 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] [2022-01-31 23:42:42,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 23:42:42,562 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:42,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:42,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1260835731, now seen corresponding path program 1 times [2022-01-31 23:42:42,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:42,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [32730096] [2022-01-31 23:42:42,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:42,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:42,564 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:42,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:42,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:42,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:42,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:42,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:42,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:42:42,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:42,750 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:42,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [32730096] [2022-01-31 23:42:42,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [32730096] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:42,750 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:42,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:42:42,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249690823] [2022-01-31 23:42:42,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:42,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:42:42,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:42,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:42:42,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:42:42,751 INFO L87 Difference]: Start difference. First operand 496 states and 615 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 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-01-31 23:42:43,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:43,794 INFO L93 Difference]: Finished difference Result 531 states and 655 transitions. [2022-01-31 23:42:43,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:42:43,794 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 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 56 [2022-01-31 23:42:43,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:43,796 INFO L225 Difference]: With dead ends: 531 [2022-01-31 23:42:43,796 INFO L226 Difference]: Without dead ends: 513 [2022-01-31 23:42:43,796 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-01-31 23:42:43,796 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 590 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:43,797 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [602 Valid, 688 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 23:42:43,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-01-31 23:42:43,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 478. [2022-01-31 23:42:43,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 377 states have (on average 1.2413793103448276) internal successors, (468), 384 states have internal predecessors, (468), 57 states have call successors, (57), 41 states have call predecessors, (57), 43 states have return successors, (65), 53 states have call predecessors, (65), 51 states have call successors, (65) [2022-01-31 23:42:43,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 590 transitions. [2022-01-31 23:42:43,872 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 590 transitions. Word has length 56 [2022-01-31 23:42:43,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:43,872 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 590 transitions. [2022-01-31 23:42:43,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 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-01-31 23:42:43,872 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 590 transitions. [2022-01-31 23:42:43,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-31 23:42:43,872 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:43,873 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] [2022-01-31 23:42:43,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 23:42:43,873 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:43,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:43,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1413489118, now seen corresponding path program 1 times [2022-01-31 23:42:43,873 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:43,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1092119850] [2022-01-31 23:42:43,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:43,873 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:43,874 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:43,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:43,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:43,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:43,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:43,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 23:42:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:44,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:42:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:44,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:42:44,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:44,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:42:44,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:44,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:44,063 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:44,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1092119850] [2022-01-31 23:42:44,063 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1092119850] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:44,063 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:44,063 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:42:44,063 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232634522] [2022-01-31 23:42:44,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:44,065 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:42:44,065 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:44,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:42:44,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:42:44,065 INFO L87 Difference]: Start difference. First operand 478 states and 590 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 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-01-31 23:42:45,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:45,130 INFO L93 Difference]: Finished difference Result 770 states and 962 transitions. [2022-01-31 23:42:45,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 23:42:45,131 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 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 65 [2022-01-31 23:42:45,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:45,132 INFO L225 Difference]: With dead ends: 770 [2022-01-31 23:42:45,132 INFO L226 Difference]: Without dead ends: 511 [2022-01-31 23:42:45,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-01-31 23:42:45,134 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 586 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:45,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [597 Valid, 831 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 23:42:45,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-01-31 23:42:45,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 478. [2022-01-31 23:42:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 377 states have (on average 1.2360742705570291) internal successors, (466), 384 states have internal predecessors, (466), 57 states have call successors, (57), 41 states have call predecessors, (57), 43 states have return successors, (65), 53 states have call predecessors, (65), 51 states have call successors, (65) [2022-01-31 23:42:45,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 588 transitions. [2022-01-31 23:42:45,221 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 588 transitions. Word has length 65 [2022-01-31 23:42:45,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:45,222 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 588 transitions. [2022-01-31 23:42:45,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 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-01-31 23:42:45,222 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 588 transitions. [2022-01-31 23:42:45,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 23:42:45,223 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:45,223 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-01-31 23:42:45,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 23:42:45,223 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:45,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:45,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1686744212, now seen corresponding path program 1 times [2022-01-31 23:42:45,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:45,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1331513199] [2022-01-31 23:42:45,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:45,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:45,226 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:45,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:45,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:45,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:45,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:45,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:45,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:45,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:45,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:45,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:45,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:45,405 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:45,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1331513199] [2022-01-31 23:42:45,405 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1331513199] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:45,405 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:45,405 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:42:45,405 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926031395] [2022-01-31 23:42:45,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:45,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:42:45,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:45,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:42:45,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:42:45,406 INFO L87 Difference]: Start difference. First operand 478 states and 588 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 7 states have internal predecessors, (48), 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-01-31 23:42:46,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:46,368 INFO L93 Difference]: Finished difference Result 522 states and 639 transitions. [2022-01-31 23:42:46,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:42:46,368 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 7 states have internal predecessors, (48), 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 60 [2022-01-31 23:42:46,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:46,370 INFO L225 Difference]: With dead ends: 522 [2022-01-31 23:42:46,370 INFO L226 Difference]: Without dead ends: 501 [2022-01-31 23:42:46,370 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-01-31 23:42:46,371 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 355 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 1887 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:46,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 1540 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1887 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 23:42:46,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-01-31 23:42:46,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 474. [2022-01-31 23:42:46,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 374 states have (on average 1.2352941176470589) internal successors, (462), 381 states have internal predecessors, (462), 56 states have call successors, (56), 41 states have call predecessors, (56), 43 states have return successors, (64), 52 states have call predecessors, (64), 50 states have call successors, (64) [2022-01-31 23:42:46,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 582 transitions. [2022-01-31 23:42:46,446 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 582 transitions. Word has length 60 [2022-01-31 23:42:46,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:46,446 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 582 transitions. [2022-01-31 23:42:46,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 7 states have internal predecessors, (48), 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-01-31 23:42:46,446 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 582 transitions. [2022-01-31 23:42:46,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 23:42:46,447 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:46,447 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-01-31 23:42:46,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 23:42:46,447 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:46,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:46,447 INFO L85 PathProgramCache]: Analyzing trace with hash -748372448, now seen corresponding path program 1 times [2022-01-31 23:42:46,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:46,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [265715655] [2022-01-31 23:42:46,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:46,448 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:46,449 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:46,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:46,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:46,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:46,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:46,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 23:42:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:46,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:42:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:46,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:42:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:46,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:42:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:46,643 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:46,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [265715655] [2022-01-31 23:42:46,643 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [265715655] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:46,643 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:46,643 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:42:46,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442482772] [2022-01-31 23:42:46,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:46,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:42:46,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:46,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:42:46,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:42:46,644 INFO L87 Difference]: Start difference. First operand 474 states and 582 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 5 states have internal predecessors, (50), 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-01-31 23:42:47,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:47,506 INFO L93 Difference]: Finished difference Result 752 states and 931 transitions. [2022-01-31 23:42:47,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 23:42:47,507 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 5 states have internal predecessors, (50), 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 68 [2022-01-31 23:42:47,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:47,509 INFO L225 Difference]: With dead ends: 752 [2022-01-31 23:42:47,509 INFO L226 Difference]: Without dead ends: 526 [2022-01-31 23:42:47,509 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-01-31 23:42:47,510 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 347 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:47,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [355 Valid, 1298 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 23:42:47,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-01-31 23:42:47,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 474. [2022-01-31 23:42:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 374 states have (on average 1.2299465240641712) internal successors, (460), 381 states have internal predecessors, (460), 56 states have call successors, (56), 41 states have call predecessors, (56), 43 states have return successors, (64), 52 states have call predecessors, (64), 50 states have call successors, (64) [2022-01-31 23:42:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 580 transitions. [2022-01-31 23:42:47,589 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 580 transitions. Word has length 68 [2022-01-31 23:42:47,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:47,589 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 580 transitions. [2022-01-31 23:42:47,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 5 states have internal predecessors, (50), 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-01-31 23:42:47,590 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 580 transitions. [2022-01-31 23:42:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 23:42:47,590 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:47,590 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-01-31 23:42:47,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 23:42:47,590 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:47,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:47,591 INFO L85 PathProgramCache]: Analyzing trace with hash 923167144, now seen corresponding path program 1 times [2022-01-31 23:42:47,591 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:47,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1064349530] [2022-01-31 23:42:47,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:47,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:47,592 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:47,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:47,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:47,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:47,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:47,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:47,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:42:47,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:47,776 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:47,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1064349530] [2022-01-31 23:42:47,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1064349530] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:47,776 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:47,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:42:47,776 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211390080] [2022-01-31 23:42:47,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:47,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:42:47,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:47,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:42:47,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:42:47,777 INFO L87 Difference]: Start difference. First operand 474 states and 580 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 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-01-31 23:42:48,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:48,632 INFO L93 Difference]: Finished difference Result 518 states and 631 transitions. [2022-01-31 23:42:48,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:42:48,633 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 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 61 [2022-01-31 23:42:48,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:48,634 INFO L225 Difference]: With dead ends: 518 [2022-01-31 23:42:48,634 INFO L226 Difference]: Without dead ends: 496 [2022-01-31 23:42:48,635 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-01-31 23:42:48,635 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 399 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 1729 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 1872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:48,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 1580 Invalid, 1872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1729 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 23:42:48,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-01-31 23:42:48,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 469. [2022-01-31 23:42:48,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 370 states have (on average 1.2297297297297298) internal successors, (455), 377 states have internal predecessors, (455), 55 states have call successors, (55), 41 states have call predecessors, (55), 43 states have return successors, (63), 51 states have call predecessors, (63), 49 states have call successors, (63) [2022-01-31 23:42:48,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 573 transitions. [2022-01-31 23:42:48,711 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 573 transitions. Word has length 61 [2022-01-31 23:42:48,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:48,712 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 573 transitions. [2022-01-31 23:42:48,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 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-01-31 23:42:48,712 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 573 transitions. [2022-01-31 23:42:48,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 23:42:48,715 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:48,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:42:48,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 23:42:48,715 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:48,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:48,716 INFO L85 PathProgramCache]: Analyzing trace with hash -6944326, now seen corresponding path program 1 times [2022-01-31 23:42:48,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:48,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [856057179] [2022-01-31 23:42:48,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:48,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:48,718 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:48,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:48,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:48,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:48,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:48,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:42:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:48,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:48,912 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:48,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [856057179] [2022-01-31 23:42:48,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [856057179] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:48,912 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:48,912 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:42:48,912 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501162416] [2022-01-31 23:42:48,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:48,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:42:48,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:48,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:42:48,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:42:48,913 INFO L87 Difference]: Start difference. First operand 469 states and 573 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 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-01-31 23:42:49,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:49,850 INFO L93 Difference]: Finished difference Result 513 states and 624 transitions. [2022-01-31 23:42:49,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:42:49,850 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 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 61 [2022-01-31 23:42:49,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:49,852 INFO L225 Difference]: With dead ends: 513 [2022-01-31 23:42:49,852 INFO L226 Difference]: Without dead ends: 492 [2022-01-31 23:42:49,853 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:42:49,853 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 312 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:49,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 1452 Invalid, 1838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 23:42:49,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-01-31 23:42:49,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 465. [2022-01-31 23:42:49,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 367 states have (on average 1.228882833787466) internal successors, (451), 374 states have internal predecessors, (451), 54 states have call successors, (54), 41 states have call predecessors, (54), 43 states have return successors, (62), 50 states have call predecessors, (62), 48 states have call successors, (62) [2022-01-31 23:42:49,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 567 transitions. [2022-01-31 23:42:49,929 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 567 transitions. Word has length 61 [2022-01-31 23:42:49,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:49,929 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 567 transitions. [2022-01-31 23:42:49,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 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-01-31 23:42:49,930 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 567 transitions. [2022-01-31 23:42:49,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 23:42:49,930 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:49,930 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] [2022-01-31 23:42:49,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-31 23:42:49,930 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:49,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:49,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1018894417, now seen corresponding path program 1 times [2022-01-31 23:42:49,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:49,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1071536886] [2022-01-31 23:42:49,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:49,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:49,932 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:50,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:50,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:50,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:50,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 23:42:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:50,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:42:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:50,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:42:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:50,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:42:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:50,077 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:50,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1071536886] [2022-01-31 23:42:50,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1071536886] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:50,077 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:50,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 23:42:50,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565801466] [2022-01-31 23:42:50,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:50,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 23:42:50,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:50,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 23:42:50,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-31 23:42:50,078 INFO L87 Difference]: Start difference. First operand 465 states and 567 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 3 states have internal predecessors, (48), 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-01-31 23:42:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:50,844 INFO L93 Difference]: Finished difference Result 889 states and 1094 transitions. [2022-01-31 23:42:50,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 23:42:50,844 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 3 states have internal predecessors, (48), 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 67 [2022-01-31 23:42:50,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:50,846 INFO L225 Difference]: With dead ends: 889 [2022-01-31 23:42:50,846 INFO L226 Difference]: Without dead ends: 636 [2022-01-31 23:42:50,847 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-01-31 23:42:50,851 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 466 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:50,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [477 Valid, 879 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 23:42:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-01-31 23:42:50,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 586. [2022-01-31 23:42:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 460 states have (on average 1.2195652173913043) internal successors, (561), 469 states have internal predecessors, (561), 67 states have call successors, (67), 51 states have call predecessors, (67), 58 states have return successors, (87), 66 states have call predecessors, (87), 62 states have call successors, (87) [2022-01-31 23:42:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 715 transitions. [2022-01-31 23:42:50,954 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 715 transitions. Word has length 67 [2022-01-31 23:42:50,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:50,954 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 715 transitions. [2022-01-31 23:42:50,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 3 states have internal predecessors, (48), 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-01-31 23:42:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 715 transitions. [2022-01-31 23:42:50,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-31 23:42:50,955 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:50,955 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] [2022-01-31 23:42:50,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-31 23:42:50,956 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:50,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:50,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1715322647, now seen corresponding path program 1 times [2022-01-31 23:42:50,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:50,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1082121046] [2022-01-31 23:42:50,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:50,956 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:50,957 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:51,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:51,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:51,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:51,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:51,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:51,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-31 23:42:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:51,163 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:51,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1082121046] [2022-01-31 23:42:51,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1082121046] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:51,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:51,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:42:51,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092945176] [2022-01-31 23:42:51,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:51,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:42:51,163 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:51,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:42:51,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:42:51,164 INFO L87 Difference]: Start difference. First operand 586 states and 715 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 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-01-31 23:42:52,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:52,026 INFO L93 Difference]: Finished difference Result 630 states and 767 transitions. [2022-01-31 23:42:52,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:42:52,027 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 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 65 [2022-01-31 23:42:52,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:52,029 INFO L225 Difference]: With dead ends: 630 [2022-01-31 23:42:52,029 INFO L226 Difference]: Without dead ends: 587 [2022-01-31 23:42:52,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:42:52,029 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 273 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:52,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 1432 Invalid, 1873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 23:42:52,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-01-31 23:42:52,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 560. [2022-01-31 23:42:52,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 439 states have (on average 1.2186788154897494) internal successors, (535), 448 states have internal predecessors, (535), 64 states have call successors, (64), 49 states have call predecessors, (64), 56 states have return successors, (84), 63 states have call predecessors, (84), 59 states have call successors, (84) [2022-01-31 23:42:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 683 transitions. [2022-01-31 23:42:52,125 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 683 transitions. Word has length 65 [2022-01-31 23:42:52,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:52,125 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 683 transitions. [2022-01-31 23:42:52,125 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 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-01-31 23:42:52,125 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 683 transitions. [2022-01-31 23:42:52,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-31 23:42:52,126 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:52,126 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] [2022-01-31 23:42:52,126 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-31 23:42:52,126 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:52,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:52,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1497395800, now seen corresponding path program 1 times [2022-01-31 23:42:52,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:52,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [792387983] [2022-01-31 23:42:52,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:52,127 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:52,129 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:52,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:52,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:52,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:52,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 23:42:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:52,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:42:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:52,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:42:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:52,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:42:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:52,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-31 23:42:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:52,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:52,378 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:52,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [792387983] [2022-01-31 23:42:52,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [792387983] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:52,378 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:52,378 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 23:42:52,379 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086287888] [2022-01-31 23:42:52,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:52,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 23:42:52,379 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:52,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 23:42:52,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-01-31 23:42:52,379 INFO L87 Difference]: Start difference. First operand 560 states and 683 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 5 states have internal predecessors, (59), 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-01-31 23:42:53,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:53,440 INFO L93 Difference]: Finished difference Result 892 states and 1092 transitions. [2022-01-31 23:42:53,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 23:42:53,440 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 5 states have internal predecessors, (59), 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 79 [2022-01-31 23:42:53,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:53,442 INFO L225 Difference]: With dead ends: 892 [2022-01-31 23:42:53,442 INFO L226 Difference]: Without dead ends: 575 [2022-01-31 23:42:53,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2022-01-31 23:42:53,443 INFO L933 BasicCegarLoop]: 406 mSDtfsCounter, 511 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:53,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [518 Valid, 1041 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 23:42:53,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-01-31 23:42:53,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 542. [2022-01-31 23:42:53,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 425 states have (on average 1.2188235294117646) internal successors, (518), 433 states have internal predecessors, (518), 62 states have call successors, (62), 49 states have call predecessors, (62), 54 states have return successors, (73), 60 states have call predecessors, (73), 57 states have call successors, (73) [2022-01-31 23:42:53,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 653 transitions. [2022-01-31 23:42:53,553 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 653 transitions. Word has length 79 [2022-01-31 23:42:53,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:53,553 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 653 transitions. [2022-01-31 23:42:53,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 5 states have internal predecessors, (59), 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-01-31 23:42:53,553 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 653 transitions. [2022-01-31 23:42:53,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-31 23:42:53,554 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:53,554 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] [2022-01-31 23:42:53,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-31 23:42:53,554 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:53,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:53,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1454956329, now seen corresponding path program 1 times [2022-01-31 23:42:53,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:53,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [53968170] [2022-01-31 23:42:53,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:53,555 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:53,556 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:53,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:53,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:53,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:53,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 23:42:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:53,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:42:53,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:53,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:42:53,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:53,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:42:53,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:53,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-31 23:42:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:53,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:42:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:53,762 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:53,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [53968170] [2022-01-31 23:42:53,763 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [53968170] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:53,763 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:53,763 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:42:53,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193413240] [2022-01-31 23:42:53,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:53,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:42:53,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:53,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:42:53,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:42:53,764 INFO L87 Difference]: Start difference. First operand 542 states and 653 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 5 states have internal predecessors, (57), 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-01-31 23:42:54,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:54,682 INFO L93 Difference]: Finished difference Result 905 states and 1127 transitions. [2022-01-31 23:42:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 23:42:54,683 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 5 states have internal predecessors, (57), 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 80 [2022-01-31 23:42:54,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:54,685 INFO L225 Difference]: With dead ends: 905 [2022-01-31 23:42:54,685 INFO L226 Difference]: Without dead ends: 651 [2022-01-31 23:42:54,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-01-31 23:42:54,687 INFO L933 BasicCegarLoop]: 351 mSDtfsCounter, 464 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:54,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [475 Valid, 1579 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 23:42:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-01-31 23:42:54,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 506. [2022-01-31 23:42:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 401 states have (on average 1.2194513715710724) internal successors, (489), 407 states have internal predecessors, (489), 55 states have call successors, (55), 43 states have call predecessors, (55), 49 states have return successors, (63), 56 states have call predecessors, (63), 51 states have call successors, (63) [2022-01-31 23:42:54,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 607 transitions. [2022-01-31 23:42:54,806 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 607 transitions. Word has length 80 [2022-01-31 23:42:54,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:54,806 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 607 transitions. [2022-01-31 23:42:54,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 5 states have internal predecessors, (57), 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-01-31 23:42:54,806 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 607 transitions. [2022-01-31 23:42:54,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-31 23:42:54,807 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:54,807 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] [2022-01-31 23:42:54,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-31 23:42:54,807 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:54,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:54,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1018185184, now seen corresponding path program 1 times [2022-01-31 23:42:54,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:54,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1692280702] [2022-01-31 23:42:54,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:54,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:54,810 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:54,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:54,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:54,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:54,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:54,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:54,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:42:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:55,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:42:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:55,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:42:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:55,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:42:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:55,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 23:42:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:55,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:55,041 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:55,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1692280702] [2022-01-31 23:42:55,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1692280702] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:55,041 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:55,041 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 23:42:55,041 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059084468] [2022-01-31 23:42:55,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:55,042 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 23:42:55,042 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:55,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 23:42:55,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:42:55,042 INFO L87 Difference]: Start difference. First operand 506 states and 607 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 7 states have internal predecessors, (65), 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-01-31 23:42:55,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:55,966 INFO L93 Difference]: Finished difference Result 584 states and 699 transitions. [2022-01-31 23:42:55,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 23:42:55,967 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 7 states have internal predecessors, (65), 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 85 [2022-01-31 23:42:55,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:55,969 INFO L225 Difference]: With dead ends: 584 [2022-01-31 23:42:55,969 INFO L226 Difference]: Without dead ends: 563 [2022-01-31 23:42:55,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2022-01-31 23:42:55,969 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 270 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 1948 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 2046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:55,970 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 1763 Invalid, 2046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1948 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 23:42:55,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-01-31 23:42:56,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 514. [2022-01-31 23:42:56,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 408 states have (on average 1.2156862745098038) internal successors, (496), 414 states have internal predecessors, (496), 55 states have call successors, (55), 43 states have call predecessors, (55), 50 states have return successors, (66), 57 states have call predecessors, (66), 51 states have call successors, (66) [2022-01-31 23:42:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 617 transitions. [2022-01-31 23:42:56,072 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 617 transitions. Word has length 85 [2022-01-31 23:42:56,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:56,072 INFO L470 AbstractCegarLoop]: Abstraction has 514 states and 617 transitions. [2022-01-31 23:42:56,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 7 states have internal predecessors, (65), 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-01-31 23:42:56,072 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 617 transitions. [2022-01-31 23:42:56,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-31 23:42:56,073 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:56,073 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] [2022-01-31 23:42:56,073 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-31 23:42:56,073 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:56,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:56,073 INFO L85 PathProgramCache]: Analyzing trace with hash 20545018, now seen corresponding path program 1 times [2022-01-31 23:42:56,073 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:56,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1618195421] [2022-01-31 23:42:56,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:56,074 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:56,075 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:56,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:56,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:56,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:56,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:56,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:56,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 23:42:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:56,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:56,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 23:42:56,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:56,231 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:56,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1618195421] [2022-01-31 23:42:56,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1618195421] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:56,232 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:56,232 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:42:56,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476757174] [2022-01-31 23:42:56,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:56,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:42:56,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:56,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:42:56,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:42:56,233 INFO L87 Difference]: Start difference. First operand 514 states and 617 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 5 states have internal predecessors, (64), 5 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-31 23:42:57,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:57,236 INFO L93 Difference]: Finished difference Result 1003 states and 1185 transitions. [2022-01-31 23:42:57,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 23:42:57,236 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 5 states have internal predecessors, (64), 5 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 80 [2022-01-31 23:42:57,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:57,238 INFO L225 Difference]: With dead ends: 1003 [2022-01-31 23:42:57,238 INFO L226 Difference]: Without dead ends: 667 [2022-01-31 23:42:57,239 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2022-01-31 23:42:57,239 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 797 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:57,239 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [804 Valid, 572 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 23:42:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-01-31 23:42:57,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 635. [2022-01-31 23:42:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 505 states have (on average 1.205940594059406) internal successors, (609), 513 states have internal predecessors, (609), 63 states have call successors, (63), 55 states have call predecessors, (63), 66 states have return successors, (77), 67 states have call predecessors, (77), 59 states have call successors, (77) [2022-01-31 23:42:57,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 749 transitions. [2022-01-31 23:42:57,357 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 749 transitions. Word has length 80 [2022-01-31 23:42:57,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:57,357 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 749 transitions. [2022-01-31 23:42:57,357 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 5 states have internal predecessors, (64), 5 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-31 23:42:57,357 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 749 transitions. [2022-01-31 23:42:57,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-01-31 23:42:57,358 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:57,358 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] [2022-01-31 23:42:57,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-31 23:42:57,358 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:57,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:57,358 INFO L85 PathProgramCache]: Analyzing trace with hash -609741853, now seen corresponding path program 1 times [2022-01-31 23:42:57,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:57,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1230656288] [2022-01-31 23:42:57,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:57,359 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:57,361 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:57,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:57,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:57,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:57,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:57,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:57,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:42:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:57,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:42:57,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:57,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:42:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:57,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:42:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:57,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-31 23:42:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:57,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:57,590 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:57,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1230656288] [2022-01-31 23:42:57,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1230656288] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:57,590 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:57,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 23:42:57,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263542906] [2022-01-31 23:42:57,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:57,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 23:42:57,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:57,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 23:42:57,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:42:57,591 INFO L87 Difference]: Start difference. First operand 635 states and 749 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 7 states have internal predecessors, (66), 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-01-31 23:42:58,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:58,568 INFO L93 Difference]: Finished difference Result 685 states and 801 transitions. [2022-01-31 23:42:58,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 23:42:58,568 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 7 states have internal predecessors, (66), 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 86 [2022-01-31 23:42:58,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:58,570 INFO L225 Difference]: With dead ends: 685 [2022-01-31 23:42:58,570 INFO L226 Difference]: Without dead ends: 664 [2022-01-31 23:42:58,570 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-01-31 23:42:58,571 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 429 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 1826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:58,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [433 Valid, 1675 Invalid, 1826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 23:42:58,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2022-01-31 23:42:58,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 627. [2022-01-31 23:42:58,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 498 states have (on average 1.2068273092369477) internal successors, (601), 506 states have internal predecessors, (601), 63 states have call successors, (63), 55 states have call predecessors, (63), 65 states have return successors, (75), 66 states have call predecessors, (75), 59 states have call successors, (75) [2022-01-31 23:42:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 739 transitions. [2022-01-31 23:42:58,687 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 739 transitions. Word has length 86 [2022-01-31 23:42:58,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:58,688 INFO L470 AbstractCegarLoop]: Abstraction has 627 states and 739 transitions. [2022-01-31 23:42:58,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 7 states have internal predecessors, (66), 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-01-31 23:42:58,688 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 739 transitions. [2022-01-31 23:42:58,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-31 23:42:58,688 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:58,688 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] [2022-01-31 23:42:58,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-31 23:42:58,689 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:58,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:58,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1602369481, now seen corresponding path program 1 times [2022-01-31 23:42:58,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:58,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1209916085] [2022-01-31 23:42:58,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:58,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:58,690 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:58,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:58,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:58,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:58,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:58,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 23:42:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:58,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:58,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-31 23:42:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:58,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:58,842 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:58,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1209916085] [2022-01-31 23:42:58,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1209916085] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:58,842 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:58,842 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:42:58,842 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614400944] [2022-01-31 23:42:58,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:58,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:42:58,842 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:58,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:42:58,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:42:58,843 INFO L87 Difference]: Start difference. First operand 627 states and 739 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 23:42:59,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:59,617 INFO L93 Difference]: Finished difference Result 645 states and 757 transitions. [2022-01-31 23:42:59,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:42:59,617 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 81 [2022-01-31 23:42:59,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:59,619 INFO L225 Difference]: With dead ends: 645 [2022-01-31 23:42:59,619 INFO L226 Difference]: Without dead ends: 581 [2022-01-31 23:42:59,619 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:42:59,619 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 313 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:59,619 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 444 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 23:42:59,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-01-31 23:42:59,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2022-01-31 23:42:59,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 456 states have (on average 1.206140350877193) internal successors, (550), 464 states have internal predecessors, (550), 61 states have call successors, (61), 53 states have call predecessors, (61), 61 states have return successors, (71), 62 states have call predecessors, (71), 57 states have call successors, (71) [2022-01-31 23:42:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 682 transitions. [2022-01-31 23:42:59,722 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 682 transitions. Word has length 81 [2022-01-31 23:42:59,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:59,722 INFO L470 AbstractCegarLoop]: Abstraction has 579 states and 682 transitions. [2022-01-31 23:42:59,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 23:42:59,722 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 682 transitions. [2022-01-31 23:42:59,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-01-31 23:42:59,723 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:59,723 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] [2022-01-31 23:42:59,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-31 23:42:59,723 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:59,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:59,724 INFO L85 PathProgramCache]: Analyzing trace with hash 577455992, now seen corresponding path program 1 times [2022-01-31 23:42:59,724 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:59,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1780299442] [2022-01-31 23:42:59,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:59,724 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:59,725 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:59,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:59,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:59,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:59,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:59,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 23:42:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:59,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:42:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:59,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 23:42:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:59,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 23:42:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:59,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:59,906 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:59,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1780299442] [2022-01-31 23:42:59,906 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1780299442] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:59,906 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:59,907 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 23:42:59,907 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852095491] [2022-01-31 23:42:59,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:59,908 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 23:42:59,908 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:59,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 23:42:59,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:42:59,909 INFO L87 Difference]: Start difference. First operand 579 states and 682 transitions. Second operand has 16 states, 16 states have (on average 4.5) internal successors, (72), 7 states have internal predecessors, (72), 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-01-31 23:43:00,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:00,777 INFO L93 Difference]: Finished difference Result 583 states and 685 transitions. [2022-01-31 23:43:00,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 23:43:00,777 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 7 states have internal predecessors, (72), 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 90 [2022-01-31 23:43:00,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:00,779 INFO L225 Difference]: With dead ends: 583 [2022-01-31 23:43:00,779 INFO L226 Difference]: Without dead ends: 495 [2022-01-31 23:43:00,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-01-31 23:43:00,780 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 628 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 2095 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 2312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 2095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:00,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [641 Valid, 611 Invalid, 2312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 2095 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 23:43:00,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-01-31 23:43:00,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2022-01-31 23:43:00,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 384 states have (on average 1.2083333333333333) internal successors, (464), 391 states have internal predecessors, (464), 54 states have call successors, (54), 47 states have call predecessors, (54), 54 states have return successors, (64), 55 states have call predecessors, (64), 51 states have call successors, (64) [2022-01-31 23:43:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 582 transitions. [2022-01-31 23:43:00,873 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 582 transitions. Word has length 90 [2022-01-31 23:43:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:00,873 INFO L470 AbstractCegarLoop]: Abstraction has 493 states and 582 transitions. [2022-01-31 23:43:00,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 7 states have internal predecessors, (72), 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-01-31 23:43:00,873 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 582 transitions. [2022-01-31 23:43:00,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-31 23:43:00,874 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:00,874 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] [2022-01-31 23:43:00,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-31 23:43:00,874 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:00,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:00,874 INFO L85 PathProgramCache]: Analyzing trace with hash -950683054, now seen corresponding path program 1 times [2022-01-31 23:43:00,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:00,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [884323149] [2022-01-31 23:43:00,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:00,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:00,875 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:00,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:00,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:00,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:00,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:00,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:00,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:43:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 23:43:01,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-31 23:43:01,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:01,055 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:01,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [884323149] [2022-01-31 23:43:01,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [884323149] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:01,056 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:01,056 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:43:01,056 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604401154] [2022-01-31 23:43:01,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:01,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:43:01,057 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:01,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:43:01,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:43:01,058 INFO L87 Difference]: Start difference. First operand 493 states and 582 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 5 states have internal predecessors, (74), 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-01-31 23:43:01,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:01,388 INFO L93 Difference]: Finished difference Result 528 states and 616 transitions. [2022-01-31 23:43:01,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:43:01,388 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 5 states have internal predecessors, (74), 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 96 [2022-01-31 23:43:01,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:01,390 INFO L225 Difference]: With dead ends: 528 [2022-01-31 23:43:01,390 INFO L226 Difference]: Without dead ends: 489 [2022-01-31 23:43:01,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:43:01,391 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 194 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:01,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 861 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 23:43:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-01-31 23:43:01,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 436. [2022-01-31 23:43:01,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 340 states have (on average 1.1970588235294117) internal successors, (407), 346 states have internal predecessors, (407), 47 states have call successors, (47), 42 states have call predecessors, (47), 48 states have return successors, (55), 48 states have call predecessors, (55), 44 states have call successors, (55) [2022-01-31 23:43:01,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 509 transitions. [2022-01-31 23:43:01,479 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 509 transitions. Word has length 96 [2022-01-31 23:43:01,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:01,479 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 509 transitions. [2022-01-31 23:43:01,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 5 states have internal predecessors, (74), 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-01-31 23:43:01,479 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 509 transitions. [2022-01-31 23:43:01,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-31 23:43:01,480 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:01,480 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] [2022-01-31 23:43:01,480 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-31 23:43:01,480 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:01,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:01,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1418124295, now seen corresponding path program 1 times [2022-01-31 23:43:01,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:01,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1964582031] [2022-01-31 23:43:01,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:01,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:01,482 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:01,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:43:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:01,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 23:43:01,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-31 23:43:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:01,690 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:01,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1964582031] [2022-01-31 23:43:01,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1964582031] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:01,690 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:01,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 23:43:01,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708803798] [2022-01-31 23:43:01,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:01,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 23:43:01,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:01,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 23:43:01,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-01-31 23:43:01,691 INFO L87 Difference]: Start difference. First operand 436 states and 509 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-01-31 23:43:02,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:02,538 INFO L93 Difference]: Finished difference Result 836 states and 980 transitions. [2022-01-31 23:43:02,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 23:43:02,538 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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 96 [2022-01-31 23:43:02,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:02,541 INFO L225 Difference]: With dead ends: 836 [2022-01-31 23:43:02,541 INFO L226 Difference]: Without dead ends: 791 [2022-01-31 23:43:02,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2022-01-31 23:43:02,542 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 353 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:02,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [362 Valid, 1604 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 23:43:02,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-01-31 23:43:02,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 416. [2022-01-31 23:43:02,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 324 states have (on average 1.1975308641975309) internal successors, (388), 329 states have internal predecessors, (388), 44 states have call successors, (44), 41 states have call predecessors, (44), 47 states have return successors, (52), 45 states have call predecessors, (52), 41 states have call successors, (52) [2022-01-31 23:43:02,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 484 transitions. [2022-01-31 23:43:02,642 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 484 transitions. Word has length 96 [2022-01-31 23:43:02,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:02,643 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 484 transitions. [2022-01-31 23:43:02,643 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 6 states have internal predecessors, (74), 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-01-31 23:43:02,643 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 484 transitions. [2022-01-31 23:43:02,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-31 23:43:02,644 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:02,644 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] [2022-01-31 23:43:02,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-31 23:43:02,644 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:02,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:02,644 INFO L85 PathProgramCache]: Analyzing trace with hash -2046322684, now seen corresponding path program 1 times [2022-01-31 23:43:02,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:02,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1455663216] [2022-01-31 23:43:02,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:02,645 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:02,646 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:02,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:02,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:02,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:02,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:43:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:02,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:43:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:02,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:02,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:02,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:02,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:02,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:02,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 23:43:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:02,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:02,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 23:43:02,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:02,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:02,941 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:02,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1455663216] [2022-01-31 23:43:02,941 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1455663216] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:02,941 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:02,941 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 23:43:02,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437354792] [2022-01-31 23:43:02,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:02,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 23:43:02,942 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:02,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 23:43:02,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-01-31 23:43:02,942 INFO L87 Difference]: Start difference. First operand 416 states and 484 transitions. Second operand has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 7 states have internal predecessors, (75), 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-01-31 23:43:03,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:03,700 INFO L93 Difference]: Finished difference Result 558 states and 653 transitions. [2022-01-31 23:43:03,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 23:43:03,700 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 7 states have internal predecessors, (75), 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 101 [2022-01-31 23:43:03,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:03,701 INFO L225 Difference]: With dead ends: 558 [2022-01-31 23:43:03,701 INFO L226 Difference]: Without dead ends: 435 [2022-01-31 23:43:03,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2022-01-31 23:43:03,702 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 131 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:03,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 1111 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 23:43:03,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-01-31 23:43:03,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 425. [2022-01-31 23:43:03,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 332 states have (on average 1.1837349397590362) internal successors, (393), 338 states have internal predecessors, (393), 45 states have call successors, (45), 41 states have call predecessors, (45), 47 states have return successors, (52), 45 states have call predecessors, (52), 41 states have call successors, (52) [2022-01-31 23:43:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 490 transitions. [2022-01-31 23:43:03,812 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 490 transitions. Word has length 101 [2022-01-31 23:43:03,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:03,812 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 490 transitions. [2022-01-31 23:43:03,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 7 states have internal predecessors, (75), 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-01-31 23:43:03,813 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 490 transitions. [2022-01-31 23:43:03,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-31 23:43:03,813 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:03,813 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] [2022-01-31 23:43:03,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-31 23:43:03,814 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:03,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:03,814 INFO L85 PathProgramCache]: Analyzing trace with hash 499266527, now seen corresponding path program 1 times [2022-01-31 23:43:03,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:03,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [275629802] [2022-01-31 23:43:03,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:03,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:03,816 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:03,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:03,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:03,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:03,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 23:43:03,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:03,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:03,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:03,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:03,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 23:43:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:03,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:03,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:43:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:04,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:04,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:04,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:04,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:04,019 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:04,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [275629802] [2022-01-31 23:43:04,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [275629802] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:04,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:04,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:43:04,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327277257] [2022-01-31 23:43:04,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:04,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:43:04,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:04,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:43:04,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:43:04,021 INFO L87 Difference]: Start difference. First operand 425 states and 490 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 5 states have internal predecessors, (67), 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-01-31 23:43:04,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:04,419 INFO L93 Difference]: Finished difference Result 460 states and 524 transitions. [2022-01-31 23:43:04,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 23:43:04,419 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 5 states have internal predecessors, (67), 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 110 [2022-01-31 23:43:04,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:04,420 INFO L225 Difference]: With dead ends: 460 [2022-01-31 23:43:04,420 INFO L226 Difference]: Without dead ends: 376 [2022-01-31 23:43:04,421 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-01-31 23:43:04,421 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 161 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:04,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 869 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 23:43:04,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-01-31 23:43:04,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 242. [2022-01-31 23:43:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 189 states have (on average 1.1428571428571428) internal successors, (216), 191 states have internal predecessors, (216), 26 states have call successors, (26), 26 states have call predecessors, (26), 26 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2022-01-31 23:43:04,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 268 transitions. [2022-01-31 23:43:04,489 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 268 transitions. Word has length 110 [2022-01-31 23:43:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:04,489 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 268 transitions. [2022-01-31 23:43:04,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 5 states have internal predecessors, (67), 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-01-31 23:43:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 268 transitions. [2022-01-31 23:43:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-31 23:43:04,490 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:04,490 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] [2022-01-31 23:43:04,490 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-31 23:43:04,490 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:04,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:04,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1316472481, now seen corresponding path program 1 times [2022-01-31 23:43:04,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:04,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1225140126] [2022-01-31 23:43:04,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:04,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:04,492 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:04,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:04,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:04,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:04,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:04,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:43:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:04,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:43:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:04,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:04,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:04,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:04,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:04,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 23:43:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:04,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:04,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 23:43:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:04,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 23:43:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:04,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:04,709 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:04,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1225140126] [2022-01-31 23:43:04,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1225140126] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:04,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:04,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 23:43:04,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092835204] [2022-01-31 23:43:04,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:04,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 23:43:04,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:04,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 23:43:04,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-01-31 23:43:04,711 INFO L87 Difference]: Start difference. First operand 242 states and 268 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 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-01-31 23:43:05,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:05,253 INFO L93 Difference]: Finished difference Result 286 states and 315 transitions. [2022-01-31 23:43:05,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 23:43:05,253 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 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 117 [2022-01-31 23:43:05,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:05,254 INFO L225 Difference]: With dead ends: 286 [2022-01-31 23:43:05,254 INFO L226 Difference]: Without dead ends: 256 [2022-01-31 23:43:05,254 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-01-31 23:43:05,255 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 250 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:05,255 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 724 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 23:43:05,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-01-31 23:43:05,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 246. [2022-01-31 23:43:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 192 states have (on average 1.140625) internal successors, (219), 194 states have internal predecessors, (219), 26 states have call successors, (26), 26 states have call predecessors, (26), 27 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2022-01-31 23:43:05,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 272 transitions. [2022-01-31 23:43:05,320 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 272 transitions. Word has length 117 [2022-01-31 23:43:05,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:05,320 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 272 transitions. [2022-01-31 23:43:05,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 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-01-31 23:43:05,320 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 272 transitions. [2022-01-31 23:43:05,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-31 23:43:05,320 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:05,321 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] [2022-01-31 23:43:05,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-31 23:43:05,321 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:05,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:05,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1497958978, now seen corresponding path program 1 times [2022-01-31 23:43:05,322 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:05,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [138162335] [2022-01-31 23:43:05,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:05,322 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:05,323 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:05,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:05,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:05,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:05,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:43:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:05,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:43:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:05,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:05,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:05,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:05,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:05,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 23:43:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:05,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:05,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:05,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 23:43:05,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:05,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 23:43:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:05,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:05,533 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:05,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [138162335] [2022-01-31 23:43:05,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [138162335] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:05,533 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:05,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 23:43:05,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103434030] [2022-01-31 23:43:05,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:05,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 23:43:05,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:05,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 23:43:05,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-01-31 23:43:05,534 INFO L87 Difference]: Start difference. First operand 246 states and 272 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 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-01-31 23:43:05,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:05,954 INFO L93 Difference]: Finished difference Result 332 states and 370 transitions. [2022-01-31 23:43:05,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 23:43:05,954 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 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 117 [2022-01-31 23:43:05,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:05,955 INFO L225 Difference]: With dead ends: 332 [2022-01-31 23:43:05,955 INFO L226 Difference]: Without dead ends: 252 [2022-01-31 23:43:05,956 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-01-31 23:43:05,956 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 323 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:05,956 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 658 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 23:43:05,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-01-31 23:43:06,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 246. [2022-01-31 23:43:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 192 states have (on average 1.1354166666666667) internal successors, (218), 194 states have internal predecessors, (218), 26 states have call successors, (26), 26 states have call predecessors, (26), 27 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2022-01-31 23:43:06,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 271 transitions. [2022-01-31 23:43:06,028 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 271 transitions. Word has length 117 [2022-01-31 23:43:06,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:06,029 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 271 transitions. [2022-01-31 23:43:06,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 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-01-31 23:43:06,029 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 271 transitions. [2022-01-31 23:43:06,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-01-31 23:43:06,030 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:06,030 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] [2022-01-31 23:43:06,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-31 23:43:06,030 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:06,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:06,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1606855094, now seen corresponding path program 1 times [2022-01-31 23:43:06,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:06,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1703832326] [2022-01-31 23:43:06,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:06,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:06,032 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:06,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:43:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:43:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 23:43:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:06,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:43:06,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:06,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 23:43:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-31 23:43:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:06,489 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:06,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1703832326] [2022-01-31 23:43:06,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1703832326] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:06,489 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:06,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 23:43:06,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720845156] [2022-01-31 23:43:06,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:06,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 23:43:06,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:06,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 23:43:06,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2022-01-31 23:43:06,490 INFO L87 Difference]: Start difference. First operand 246 states and 271 transitions. Second operand has 25 states, 25 states have (on average 3.92) internal successors, (98), 11 states have internal predecessors, (98), 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-01-31 23:43:07,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:07,323 INFO L93 Difference]: Finished difference Result 318 states and 359 transitions. [2022-01-31 23:43:07,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 23:43:07,323 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 11 states have internal predecessors, (98), 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 147 [2022-01-31 23:43:07,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:07,324 INFO L225 Difference]: With dead ends: 318 [2022-01-31 23:43:07,325 INFO L226 Difference]: Without dead ends: 283 [2022-01-31 23:43:07,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 23:43:07,325 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 290 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 1765 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:07,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 1382 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1765 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 23:43:07,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-01-31 23:43:07,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 263. [2022-01-31 23:43:07,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 207 states have (on average 1.144927536231884) internal successors, (237), 209 states have internal predecessors, (237), 26 states have call successors, (26), 26 states have call predecessors, (26), 29 states have return successors, (29), 27 states have call predecessors, (29), 24 states have call successors, (29) [2022-01-31 23:43:07,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 292 transitions. [2022-01-31 23:43:07,390 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 292 transitions. Word has length 147 [2022-01-31 23:43:07,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:07,390 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 292 transitions. [2022-01-31 23:43:07,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 11 states have internal predecessors, (98), 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-01-31 23:43:07,390 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 292 transitions. [2022-01-31 23:43:07,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-31 23:43:07,391 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:07,391 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] [2022-01-31 23:43:07,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-31 23:43:07,391 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:07,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:07,391 INFO L85 PathProgramCache]: Analyzing trace with hash 470260381, now seen corresponding path program 1 times [2022-01-31 23:43:07,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:07,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [923217372] [2022-01-31 23:43:07,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:07,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:07,393 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:43:07,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:43:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:07,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:07,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 23:43:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:43:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:07,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-31 23:43:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-31 23:43:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:07,745 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:07,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [923217372] [2022-01-31 23:43:07,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [923217372] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:07,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:07,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-31 23:43:07,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473274027] [2022-01-31 23:43:07,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:07,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 23:43:07,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:07,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 23:43:07,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-01-31 23:43:07,746 INFO L87 Difference]: Start difference. First operand 263 states and 292 transitions. Second operand has 24 states, 24 states have (on average 4.166666666666667) internal successors, (100), 10 states have internal predecessors, (100), 2 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-01-31 23:43:08,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:08,361 INFO L93 Difference]: Finished difference Result 358 states and 401 transitions. [2022-01-31 23:43:08,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 23:43:08,361 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.166666666666667) internal successors, (100), 10 states have internal predecessors, (100), 2 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 148 [2022-01-31 23:43:08,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:08,362 INFO L225 Difference]: With dead ends: 358 [2022-01-31 23:43:08,362 INFO L226 Difference]: Without dead ends: 277 [2022-01-31 23:43:08,363 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2022-01-31 23:43:08,363 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 208 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:08,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 1552 Invalid, 1773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1689 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 23:43:08,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-01-31 23:43:08,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 263. [2022-01-31 23:43:08,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 207 states have (on average 1.1400966183574879) internal successors, (236), 209 states have internal predecessors, (236), 26 states have call successors, (26), 26 states have call predecessors, (26), 29 states have return successors, (29), 27 states have call predecessors, (29), 24 states have call successors, (29) [2022-01-31 23:43:08,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 291 transitions. [2022-01-31 23:43:08,428 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 291 transitions. Word has length 148 [2022-01-31 23:43:08,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:08,428 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 291 transitions. [2022-01-31 23:43:08,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.166666666666667) internal successors, (100), 10 states have internal predecessors, (100), 2 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-01-31 23:43:08,428 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 291 transitions. [2022-01-31 23:43:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-31 23:43:08,429 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:08,429 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-01-31 23:43:08,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-31 23:43:08,429 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:08,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:08,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1786465971, now seen corresponding path program 1 times [2022-01-31 23:43:08,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:08,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1213745207] [2022-01-31 23:43:08,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:08,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:08,431 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:43:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:43:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 23:43:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:43:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-01-31 23:43:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-01-31 23:43:08,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-31 23:43:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:08,761 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:08,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1213745207] [2022-01-31 23:43:08,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1213745207] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:08,761 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:08,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 23:43:08,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349497661] [2022-01-31 23:43:08,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:08,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 23:43:08,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:08,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 23:43:08,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2022-01-31 23:43:08,762 INFO L87 Difference]: Start difference. First operand 263 states and 291 transitions. Second operand has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 8 states have internal predecessors, (93), 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-01-31 23:43:09,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:09,391 INFO L93 Difference]: Finished difference Result 304 states and 339 transitions. [2022-01-31 23:43:09,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 23:43:09,392 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 8 states have internal predecessors, (93), 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 150 [2022-01-31 23:43:09,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:09,393 INFO L225 Difference]: With dead ends: 304 [2022-01-31 23:43:09,393 INFO L226 Difference]: Without dead ends: 263 [2022-01-31 23:43:09,393 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-01-31 23:43:09,394 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 252 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:09,394 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 1132 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 23:43:09,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-01-31 23:43:09,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 257. [2022-01-31 23:43:09,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 203 states have (on average 1.1280788177339902) internal successors, (229), 205 states have internal predecessors, (229), 25 states have call successors, (25), 25 states have call predecessors, (25), 28 states have return successors, (28), 26 states have call predecessors, (28), 23 states have call successors, (28) [2022-01-31 23:43:09,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 282 transitions. [2022-01-31 23:43:09,483 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 282 transitions. Word has length 150 [2022-01-31 23:43:09,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:09,483 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 282 transitions. [2022-01-31 23:43:09,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 8 states have internal predecessors, (93), 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-01-31 23:43:09,483 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 282 transitions. [2022-01-31 23:43:09,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-01-31 23:43:09,484 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:09,484 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] [2022-01-31 23:43:09,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-31 23:43:09,484 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:09,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:09,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1782392170, now seen corresponding path program 1 times [2022-01-31 23:43:09,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:09,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [185944128] [2022-01-31 23:43:09,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:09,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:09,487 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:43:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:43:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:09,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:09,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 23:43:09,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:43:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 23:43:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 23:43:09,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-01-31 23:43:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:09,755 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:09,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [185944128] [2022-01-31 23:43:09,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [185944128] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:09,756 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:09,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 23:43:09,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352572568] [2022-01-31 23:43:09,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:09,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 23:43:09,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:09,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 23:43:09,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-01-31 23:43:09,756 INFO L87 Difference]: Start difference. First operand 257 states and 282 transitions. Second operand has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 5 states have internal predecessors, (98), 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-01-31 23:43:10,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:10,308 INFO L93 Difference]: Finished difference Result 318 states and 348 transitions. [2022-01-31 23:43:10,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 23:43:10,308 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 5 states have internal predecessors, (98), 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 155 [2022-01-31 23:43:10,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:10,309 INFO L225 Difference]: With dead ends: 318 [2022-01-31 23:43:10,309 INFO L226 Difference]: Without dead ends: 243 [2022-01-31 23:43:10,310 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2022-01-31 23:43:10,310 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 330 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:10,310 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 501 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 23:43:10,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-01-31 23:43:10,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 229. [2022-01-31 23:43:10,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 179 states have (on average 1.111731843575419) internal successors, (199), 181 states have internal predecessors, (199), 24 states have call successors, (24), 24 states have call predecessors, (24), 25 states have return successors, (25), 23 states have call predecessors, (25), 22 states have call successors, (25) [2022-01-31 23:43:10,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 248 transitions. [2022-01-31 23:43:10,370 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 248 transitions. Word has length 155 [2022-01-31 23:43:10,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:10,371 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 248 transitions. [2022-01-31 23:43:10,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 5 states have internal predecessors, (98), 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-01-31 23:43:10,371 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 248 transitions. [2022-01-31 23:43:10,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-01-31 23:43:10,372 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:10,372 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] [2022-01-31 23:43:10,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-31 23:43:10,372 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:10,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:10,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1939794977, now seen corresponding path program 1 times [2022-01-31 23:43:10,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:10,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1781383237] [2022-01-31 23:43:10,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:10,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:10,374 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:10,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:10,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:10,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:10,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:43:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:10,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:43:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:10,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:10,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:10,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:10,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:10,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:10,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 23:43:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:10,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:10,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:43:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:10,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:10,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:10,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:10,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:10,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 23:43:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:10,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-31 23:43:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:10,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-31 23:43:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:10,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:10,651 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:10,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1781383237] [2022-01-31 23:43:10,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1781383237] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:10,651 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:10,651 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 23:43:10,651 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715044530] [2022-01-31 23:43:10,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:10,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 23:43:10,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:10,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 23:43:10,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-01-31 23:43:10,652 INFO L87 Difference]: Start difference. First operand 229 states and 248 transitions. Second operand has 17 states, 17 states have (on average 6.235294117647059) internal successors, (106), 5 states have internal predecessors, (106), 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-01-31 23:43:11,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:11,161 INFO L93 Difference]: Finished difference Result 294 states and 319 transitions. [2022-01-31 23:43:11,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 23:43:11,162 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.235294117647059) internal successors, (106), 5 states have internal predecessors, (106), 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 157 [2022-01-31 23:43:11,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:11,162 INFO L225 Difference]: With dead ends: 294 [2022-01-31 23:43:11,163 INFO L226 Difference]: Without dead ends: 208 [2022-01-31 23:43:11,163 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2022-01-31 23:43:11,163 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 192 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:11,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 773 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 23:43:11,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-01-31 23:43:11,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-01-31 23:43:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 161 states have (on average 1.0993788819875776) internal successors, (177), 162 states have internal predecessors, (177), 23 states have call successors, (23), 23 states have call predecessors, (23), 23 states have return successors, (23), 22 states have call predecessors, (23), 21 states have call successors, (23) [2022-01-31 23:43:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 223 transitions. [2022-01-31 23:43:11,282 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 223 transitions. Word has length 157 [2022-01-31 23:43:11,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:11,282 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 223 transitions. [2022-01-31 23:43:11,282 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.235294117647059) internal successors, (106), 5 states have internal predecessors, (106), 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-01-31 23:43:11,282 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 223 transitions. [2022-01-31 23:43:11,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-31 23:43:11,283 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:11,283 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] [2022-01-31 23:43:11,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-31 23:43:11,283 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:11,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:11,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1409620627, now seen corresponding path program 1 times [2022-01-31 23:43:11,283 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:11,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [984523610] [2022-01-31 23:43:11,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:11,284 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:11,285 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:11,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:43:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:43:11,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:11,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 23:43:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:43:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 23:43:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-31 23:43:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-31 23:43:11,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:11,616 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:11,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [984523610] [2022-01-31 23:43:11,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [984523610] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:11,616 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:11,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 23:43:11,616 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843926259] [2022-01-31 23:43:11,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:11,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 23:43:11,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:11,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 23:43:11,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-01-31 23:43:11,617 INFO L87 Difference]: Start difference. First operand 208 states and 223 transitions. Second operand has 20 states, 20 states have (on average 5.2) internal successors, (104), 8 states have internal predecessors, (104), 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-01-31 23:43:12,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:12,517 INFO L93 Difference]: Finished difference Result 410 states and 441 transitions. [2022-01-31 23:43:12,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-31 23:43:12,517 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 8 states have internal predecessors, (104), 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 158 [2022-01-31 23:43:12,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:12,519 INFO L225 Difference]: With dead ends: 410 [2022-01-31 23:43:12,519 INFO L226 Difference]: Without dead ends: 211 [2022-01-31 23:43:12,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2022-01-31 23:43:12,520 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 591 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:12,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [592 Valid, 542 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 23:43:12,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-01-31 23:43:12,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2022-01-31 23:43:12,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 161 states have (on average 1.093167701863354) internal successors, (176), 162 states have internal predecessors, (176), 23 states have call successors, (23), 23 states have call predecessors, (23), 23 states have return successors, (23), 22 states have call predecessors, (23), 21 states have call successors, (23) [2022-01-31 23:43:12,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 222 transitions. [2022-01-31 23:43:12,578 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 222 transitions. Word has length 158 [2022-01-31 23:43:12,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:12,578 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 222 transitions. [2022-01-31 23:43:12,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 8 states have internal predecessors, (104), 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-01-31 23:43:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 222 transitions. [2022-01-31 23:43:12,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-31 23:43:12,579 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:12,579 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] [2022-01-31 23:43:12,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-31 23:43:12,579 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:12,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:12,579 INFO L85 PathProgramCache]: Analyzing trace with hash -954221035, now seen corresponding path program 1 times [2022-01-31 23:43:12,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:12,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2113828752] [2022-01-31 23:43:12,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:12,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:12,581 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:43:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:43:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 23:43:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:12,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:43:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 23:43:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-31 23:43:12,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-31 23:43:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:12,944 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:12,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2113828752] [2022-01-31 23:43:12,944 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2113828752] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:12,944 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:12,944 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 23:43:12,944 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331622388] [2022-01-31 23:43:12,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:12,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 23:43:12,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:12,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 23:43:12,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-01-31 23:43:12,945 INFO L87 Difference]: Start difference. First operand 208 states and 222 transitions. Second operand has 25 states, 25 states have (on average 4.16) internal successors, (104), 11 states have internal predecessors, (104), 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-01-31 23:43:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:13,739 INFO L93 Difference]: Finished difference Result 211 states and 226 transitions. [2022-01-31 23:43:13,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 23:43:13,739 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.16) internal successors, (104), 11 states have internal predecessors, (104), 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 158 [2022-01-31 23:43:13,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:13,739 INFO L225 Difference]: With dead ends: 211 [2022-01-31 23:43:13,739 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 23:43:13,756 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-01-31 23:43:13,756 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 412 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:13,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 698 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 23:43:13,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 23:43:13,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 23:43:13,758 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-01-31 23:43:13,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 23:43:13,758 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2022-01-31 23:43:13,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:13,758 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 23:43:13,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.16) internal successors, (104), 11 states have internal predecessors, (104), 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-01-31 23:43:13,758 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 23:43:13,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 23:43:13,761 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 23:43:13,762 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-31 23:43:13,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 23:54:12,251 WARN L228 SmtUtils]: Spent 10.97m on a formula simplification that was a NOOP. DAG size: 174 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)