/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_simpl4.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 23:42:14,620 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 23:42:14,622 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 23:42:14,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 23:42:14,655 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 23:42:14,659 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 23:42:14,662 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 23:42:14,690 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 23:42:14,691 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 23:42:14,692 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 23:42:14,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 23:42:14,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 23:42:14,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 23:42:14,695 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 23:42:14,696 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 23:42:14,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 23:42:14,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 23:42:14,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 23:42:14,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 23:42:14,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 23:42:14,705 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 23:42:14,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 23:42:14,707 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 23:42:14,708 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 23:42:14,710 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 23:42:14,710 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 23:42:14,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 23:42:14,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 23:42:14,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 23:42:14,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 23:42:14,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 23:42:14,713 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 23:42:14,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 23:42:14,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 23:42:14,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 23:42:14,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 23:42:14,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 23:42:14,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 23:42:14,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 23:42:14,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 23:42:14,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 23:42:14,718 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,725 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 23:42:14,726 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 23:42:14,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 23:42:14,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 23:42:14,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 23:42:14,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 23:42:14,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 23:42:14,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 23:42:14,727 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 23:42:14,727 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 23:42:14,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 23:42:14,728 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 23:42:14,728 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 23:42:14,728 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 23:42:14,728 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 23:42:14,728 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:42:14,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 23:42:14,729 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 23:42:14,729 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 23:42:14,729 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-01-31 23:42:14,729 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,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 23:42:14,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 23:42:14,939 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 23:42:14,940 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 23:42:14,941 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 23:42:14,942 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-01-31 23:42:15,006 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1df7c11/c66f9e7fd7094652b9e55f3d35e44675/FLAGe19beeef6 [2022-01-31 23:42:15,362 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 23:42:15,363 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c [2022-01-31 23:42:15,376 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1df7c11/c66f9e7fd7094652b9e55f3d35e44675/FLAGe19beeef6 [2022-01-31 23:42:15,742 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a1df7c11/c66f9e7fd7094652b9e55f3d35e44675 [2022-01-31 23:42:15,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 23:42:15,745 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 23:42:15,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 23:42:15,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 23:42:15,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 23:42:15,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:42:15" (1/1) ... [2022-01-31 23:42:15,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fb1e75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:15, skipping insertion in model container [2022-01-31 23:42:15,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 11:42:15" (1/1) ... [2022-01-31 23:42:15,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 23:42:15,808 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 23:42:16,120 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2022-01-31 23:42:16,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:42:16,129 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 23:42:16,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl4.cil-2.c[48585,48598] [2022-01-31 23:42:16,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 23:42:16,205 INFO L208 MainTranslator]: Completed translation [2022-01-31 23:42:16,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:16 WrapperNode [2022-01-31 23:42:16,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 23:42:16,207 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 23:42:16,207 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 23:42:16,207 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 23:42:16,216 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:16" (1/1) ... [2022-01-31 23:42:16,216 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:16" (1/1) ... [2022-01-31 23:42:16,231 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:16" (1/1) ... [2022-01-31 23:42:16,231 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:16" (1/1) ... [2022-01-31 23:42:16,254 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:16" (1/1) ... [2022-01-31 23:42:16,281 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:16" (1/1) ... [2022-01-31 23:42:16,285 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:16" (1/1) ... [2022-01-31 23:42:16,291 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 23:42:16,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 23:42:16,308 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 23:42:16,308 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 23:42:16,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:16" (1/1) ... [2022-01-31 23:42:16,315 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 23:42:16,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 23:42:16,349 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:16,351 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:16,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 23:42:16,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 23:42:16,386 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 23:42:16,386 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-01-31 23:42:16,387 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2022-01-31 23:42:16,387 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2022-01-31 23:42:16,387 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2022-01-31 23:42:16,387 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2022-01-31 23:42:16,388 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2022-01-31 23:42:16,388 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2022-01-31 23:42:16,388 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2022-01-31 23:42:16,388 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-01-31 23:42:16,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 23:42:16,389 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-01-31 23:42:16,389 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-01-31 23:42:16,390 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-01-31 23:42:16,390 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-01-31 23:42:16,390 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-01-31 23:42:16,390 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-01-31 23:42:16,390 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-01-31 23:42:16,390 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-01-31 23:42:16,390 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-01-31 23:42:16,391 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-01-31 23:42:16,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-01-31 23:42:16,391 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-01-31 23:42:16,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-01-31 23:42:16,391 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2022-01-31 23:42:16,391 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyDeviceControl [2022-01-31 23:42:16,391 INFO L138 BoogieDeclarations]: Found implementation of procedure FlCheckFormatParameters [2022-01-31 23:42:16,392 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyQueueRequest [2022-01-31 23:42:16,392 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-01-31 23:42:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 23:42:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 23:42:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 23:42:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 23:42:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-01-31 23:42:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 23:42:16,392 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-01-31 23:42:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2022-01-31 23:42:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2022-01-31 23:42:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2022-01-31 23:42:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2022-01-31 23:42:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2022-01-31 23:42:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2022-01-31 23:42:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-01-31 23:42:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-01-31 23:42:16,393 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-01-31 23:42:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-01-31 23:42:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-01-31 23:42:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-01-31 23:42:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-01-31 23:42:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-01-31 23:42:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-01-31 23:42:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-01-31 23:42:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-01-31 23:42:16,394 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2022-01-31 23:42:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyQueueRequest [2022-01-31 23:42:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyDeviceControl [2022-01-31 23:42:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure FlCheckFormatParameters [2022-01-31 23:42:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-01-31 23:42:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-01-31 23:42:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-01-31 23:42:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2022-01-31 23:42:16,395 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-01-31 23:42:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 23:42:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-01-31 23:42:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 23:42:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 23:42:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 23:42:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 23:42:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 23:42:16,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 23:42:16,639 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 23:42:16,641 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 23:42:16,659 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:16,684 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:42:16,684 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:42:16,691 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:16,697 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:42:16,697 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:42:16,701 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:16,844 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-01-31 23:42:16,844 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-01-31 23:42:16,846 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:16,929 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume !false; [2022-01-31 23:42:16,929 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume false; [2022-01-31 23:42:16,943 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:16,963 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-01-31 23:42:16,963 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-01-31 23:42:17,031 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:17,041 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:42:17,041 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:42:17,042 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:17,050 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:42:17,051 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:42:17,051 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:17,060 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:42:17,060 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:42:17,104 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:17,127 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-01-31 23:42:17,127 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-01-31 23:42:17,130 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:17,241 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume !false; [2022-01-31 23:42:17,241 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##37: assume false; [2022-01-31 23:42:17,280 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:17,283 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:42:17,284 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:42:17,284 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:17,295 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:42:17,295 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:42:17,295 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 23:42:17,301 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 23:42:17,301 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 23:42:17,317 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 23:42:17,338 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 23:42:17,338 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 23:42:17,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:42:17 BoogieIcfgContainer [2022-01-31 23:42:17,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 23:42:17,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 23:42:17,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 23:42:17,352 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 23:42:17,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 11:42:15" (1/3) ... [2022-01-31 23:42:17,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ccfb30f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:42:17, skipping insertion in model container [2022-01-31 23:42:17,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 11:42:16" (2/3) ... [2022-01-31 23:42:17,355 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ccfb30f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 11:42:17, skipping insertion in model container [2022-01-31 23:42:17,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 11:42:17" (3/3) ... [2022-01-31 23:42:17,357 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl4.cil-2.c [2022-01-31 23:42:17,361 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 23:42:17,361 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 23:42:17,412 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 23:42:17,421 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:17,421 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 23:42:17,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 389 states, 288 states have (on average 1.46875) internal successors, (423), 314 states have internal predecessors, (423), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 66 states have call predecessors, (71), 71 states have call successors, (71) [2022-01-31 23:42:17,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 23:42:17,472 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:17,473 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:17,473 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:17,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:17,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1386555085, now seen corresponding path program 1 times [2022-01-31 23:42:17,489 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:17,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1146131903] [2022-01-31 23:42:17,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:17,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:17,551 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:17,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:17,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:17,951 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,952 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:17,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1146131903] [2022-01-31 23:42:17,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1146131903] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:17,954 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:17,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 23:42:17,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013061190] [2022-01-31 23:42:17,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:17,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 23:42:17,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:17,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 23:42:17,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 23:42:17,985 INFO L87 Difference]: Start difference. First operand has 389 states, 288 states have (on average 1.46875) internal successors, (423), 314 states have internal predecessors, (423), 71 states have call successors, (71), 28 states have call predecessors, (71), 28 states have return successors, (71), 66 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 23:42:19,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:19,252 INFO L93 Difference]: Finished difference Result 666 states and 978 transitions. [2022-01-31 23:42:19,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 23:42:19,254 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:19,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:19,274 INFO L225 Difference]: With dead ends: 666 [2022-01-31 23:42:19,274 INFO L226 Difference]: Without dead ends: 422 [2022-01-31 23:42:19,282 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:19,287 INFO L933 BasicCegarLoop]: 496 mSDtfsCounter, 408 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:19,289 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [418 Valid, 735 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 23:42:19,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-01-31 23:42:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 380. [2022-01-31 23:42:19,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 282 states have (on average 1.429078014184397) internal successors, (403), 306 states have internal predecessors, (403), 71 states have call successors, (71), 28 states have call predecessors, (71), 26 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2022-01-31 23:42:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 523 transitions. [2022-01-31 23:42:19,409 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 523 transitions. Word has length 20 [2022-01-31 23:42:19,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:19,409 INFO L470 AbstractCegarLoop]: Abstraction has 380 states and 523 transitions. [2022-01-31 23:42:19,409 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:19,409 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 523 transitions. [2022-01-31 23:42:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 23:42:19,411 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:19,411 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:42:19,411 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 23:42:19,412 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:19,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:19,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1836211626, now seen corresponding path program 1 times [2022-01-31 23:42:19,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:19,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1064260210] [2022-01-31 23:42:19,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:19,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:19,418 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:19,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:19,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:19,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:19,626 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,626 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:19,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1064260210] [2022-01-31 23:42:19,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1064260210] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:19,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:19,627 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:42:19,627 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150688785] [2022-01-31 23:42:19,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:19,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:42:19,628 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:19,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:42:19,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:42:19,629 INFO L87 Difference]: Start difference. First operand 380 states and 523 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 23:42:21,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:21,406 INFO L93 Difference]: Finished difference Result 747 states and 1022 transitions. [2022-01-31 23:42:21,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:42:21,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-01-31 23:42:21,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:21,411 INFO L225 Difference]: With dead ends: 747 [2022-01-31 23:42:21,411 INFO L226 Difference]: Without dead ends: 584 [2022-01-31 23:42:21,412 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:42:21,413 INFO L933 BasicCegarLoop]: 634 mSDtfsCounter, 650 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:21,413 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 914 Invalid, 1498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-31 23:42:21,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2022-01-31 23:42:21,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 525. [2022-01-31 23:42:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 405 states have (on average 1.3530864197530865) internal successors, (548), 410 states have internal predecessors, (548), 78 states have call successors, (78), 41 states have call predecessors, (78), 41 states have return successors, (90), 75 states have call predecessors, (90), 66 states have call successors, (90) [2022-01-31 23:42:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 716 transitions. [2022-01-31 23:42:21,470 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 716 transitions. Word has length 25 [2022-01-31 23:42:21,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:21,471 INFO L470 AbstractCegarLoop]: Abstraction has 525 states and 716 transitions. [2022-01-31 23:42:21,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 23:42:21,472 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 716 transitions. [2022-01-31 23:42:21,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 23:42:21,473 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:21,474 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:42:21,474 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 23:42:21,474 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:21,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:21,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1775067862, now seen corresponding path program 1 times [2022-01-31 23:42:21,475 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:21,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [611173018] [2022-01-31 23:42:21,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:21,476 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:21,479 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:21,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:21,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:21,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:21,625 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:21,625 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:21,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [611173018] [2022-01-31 23:42:21,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [611173018] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:21,625 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:21,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:42:21,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821135462] [2022-01-31 23:42:21,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:21,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:42:21,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:21,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:42:21,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:42:21,627 INFO L87 Difference]: Start difference. First operand 525 states and 716 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 23:42:22,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:22,701 INFO L93 Difference]: Finished difference Result 695 states and 934 transitions. [2022-01-31 23:42:22,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:42:22,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-01-31 23:42:22,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:22,706 INFO L225 Difference]: With dead ends: 695 [2022-01-31 23:42:22,707 INFO L226 Difference]: Without dead ends: 676 [2022-01-31 23:42:22,707 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:22,708 INFO L933 BasicCegarLoop]: 459 mSDtfsCounter, 758 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:22,709 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 604 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 23:42:22,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-01-31 23:42:22,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 583. [2022-01-31 23:42:22,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 450 states have (on average 1.3488888888888888) internal successors, (607), 463 states have internal predecessors, (607), 82 states have call successors, (82), 46 states have call predecessors, (82), 50 states have return successors, (101), 78 states have call predecessors, (101), 72 states have call successors, (101) [2022-01-31 23:42:22,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 790 transitions. [2022-01-31 23:42:22,773 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 790 transitions. Word has length 31 [2022-01-31 23:42:22,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:22,773 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 790 transitions. [2022-01-31 23:42:22,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 23:42:22,774 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 790 transitions. [2022-01-31 23:42:22,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-01-31 23:42:22,775 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:22,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:42:22,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 23:42:22,776 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:22,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:22,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1405496584, now seen corresponding path program 1 times [2022-01-31 23:42:22,776 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:22,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [998646918] [2022-01-31 23:42:22,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:22,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:22,779 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:22,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:22,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:22,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:22,916 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,916 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:22,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [998646918] [2022-01-31 23:42:22,917 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [998646918] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:22,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:22,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:42:22,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088768857] [2022-01-31 23:42:22,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:22,918 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:42:22,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:22,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:42:22,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:42:22,919 INFO L87 Difference]: Start difference. First operand 583 states and 790 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 23:42:24,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:24,038 INFO L93 Difference]: Finished difference Result 1117 states and 1501 transitions. [2022-01-31 23:42:24,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:42:24,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-01-31 23:42:24,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:24,045 INFO L225 Difference]: With dead ends: 1117 [2022-01-31 23:42:24,045 INFO L226 Difference]: Without dead ends: 819 [2022-01-31 23:42:24,047 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:24,048 INFO L933 BasicCegarLoop]: 541 mSDtfsCounter, 832 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 840 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:24,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [840 Valid, 761 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 23:42:24,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2022-01-31 23:42:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 771. [2022-01-31 23:42:24,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 606 states have (on average 1.33993399339934) internal successors, (812), 616 states have internal predecessors, (812), 99 states have call successors, (99), 61 states have call predecessors, (99), 65 states have return successors, (136), 97 states have call predecessors, (136), 91 states have call successors, (136) [2022-01-31 23:42:24,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1047 transitions. [2022-01-31 23:42:24,122 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1047 transitions. Word has length 33 [2022-01-31 23:42:24,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:24,122 INFO L470 AbstractCegarLoop]: Abstraction has 771 states and 1047 transitions. [2022-01-31 23:42:24,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 3 states have internal predecessors, (23), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 23:42:24,122 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1047 transitions. [2022-01-31 23:42:24,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 23:42:24,124 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:24,124 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:42:24,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 23:42:24,125 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:24,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:24,125 INFO L85 PathProgramCache]: Analyzing trace with hash -883255635, now seen corresponding path program 1 times [2022-01-31 23:42:24,125 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:24,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1749410852] [2022-01-31 23:42:24,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:24,126 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:24,128 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:24,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:24,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:24,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:24,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:24,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:24,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:42:24,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:24,263 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:24,264 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:24,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1749410852] [2022-01-31 23:42:24,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1749410852] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:24,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:24,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:42:24,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199861987] [2022-01-31 23:42:24,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:24,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:42:24,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:24,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:42:24,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:42:24,265 INFO L87 Difference]: Start difference. First operand 771 states and 1047 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:42:25,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:25,438 INFO L93 Difference]: Finished difference Result 865 states and 1163 transitions. [2022-01-31 23:42:25,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:42:25,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 38 [2022-01-31 23:42:25,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:25,449 INFO L225 Difference]: With dead ends: 865 [2022-01-31 23:42:25,449 INFO L226 Difference]: Without dead ends: 860 [2022-01-31 23:42:25,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:42:25,454 INFO L933 BasicCegarLoop]: 476 mSDtfsCounter, 712 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:25,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [713 Valid, 892 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 23:42:25,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-01-31 23:42:25,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 808. [2022-01-31 23:42:25,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 636 states have (on average 1.3333333333333333) internal successors, (848), 648 states have internal predecessors, (848), 99 states have call successors, (99), 61 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2022-01-31 23:42:25,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1090 transitions. [2022-01-31 23:42:25,542 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1090 transitions. Word has length 38 [2022-01-31 23:42:25,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:25,544 INFO L470 AbstractCegarLoop]: Abstraction has 808 states and 1090 transitions. [2022-01-31 23:42:25,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:42:25,544 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1090 transitions. [2022-01-31 23:42:25,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-31 23:42:25,546 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:25,546 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:42:25,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 23:42:25,546 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:25,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:25,546 INFO L85 PathProgramCache]: Analyzing trace with hash 726893149, now seen corresponding path program 1 times [2022-01-31 23:42:25,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:25,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1706686216] [2022-01-31 23:42:25,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:25,548 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:25,550 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:25,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:25,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:25,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:25,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:25,697 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,697 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:25,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1706686216] [2022-01-31 23:42:25,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1706686216] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:25,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:25,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 23:42:25,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465072822] [2022-01-31 23:42:25,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:25,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 23:42:25,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:25,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 23:42:25,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 23:42:25,699 INFO L87 Difference]: Start difference. First operand 808 states and 1090 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 23:42:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:26,776 INFO L93 Difference]: Finished difference Result 842 states and 1132 transitions. [2022-01-31 23:42:26,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 23:42:26,779 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2022-01-31 23:42:26,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:26,784 INFO L225 Difference]: With dead ends: 842 [2022-01-31 23:42:26,784 INFO L226 Difference]: Without dead ends: 839 [2022-01-31 23:42:26,785 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:26,785 INFO L933 BasicCegarLoop]: 467 mSDtfsCounter, 320 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:26,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [324 Valid, 720 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 23:42:26,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2022-01-31 23:42:26,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 819. [2022-01-31 23:42:26,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.3323029366306027) internal successors, (862), 658 states have internal predecessors, (862), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2022-01-31 23:42:26,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1104 transitions. [2022-01-31 23:42:26,862 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1104 transitions. Word has length 38 [2022-01-31 23:42:26,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:26,863 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1104 transitions. [2022-01-31 23:42:26,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 23:42:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1104 transitions. [2022-01-31 23:42:26,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 23:42:26,864 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:26,864 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:26,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 23:42:26,865 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:26,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:26,865 INFO L85 PathProgramCache]: Analyzing trace with hash 2055229827, now seen corresponding path program 1 times [2022-01-31 23:42:26,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:26,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [521186937] [2022-01-31 23:42:26,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:26,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:26,868 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:26,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:27,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:27,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:27,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 23:42:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:27,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:42:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:27,134 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,135 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:27,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [521186937] [2022-01-31 23:42:27,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [521186937] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:27,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:27,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:42:27,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390184811] [2022-01-31 23:42:27,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:27,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:42:27,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:27,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:42:27,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:42:27,137 INFO L87 Difference]: Start difference. First operand 819 states and 1104 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 23:42:29,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:29,109 INFO L93 Difference]: Finished difference Result 877 states and 1176 transitions. [2022-01-31 23:42:29,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 23:42:29,110 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2022-01-31 23:42:29,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:29,114 INFO L225 Difference]: With dead ends: 877 [2022-01-31 23:42:29,114 INFO L226 Difference]: Without dead ends: 871 [2022-01-31 23:42:29,114 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2022-01-31 23:42:29,117 INFO L933 BasicCegarLoop]: 455 mSDtfsCounter, 1023 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 2019 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 2286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 2019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:29,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1038 Valid, 1188 Invalid, 2286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 2019 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-31 23:42:29,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-01-31 23:42:29,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2022-01-31 23:42:29,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.330757341576507) internal successors, (861), 658 states have internal predecessors, (861), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2022-01-31 23:42:29,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1103 transitions. [2022-01-31 23:42:29,221 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1103 transitions. Word has length 40 [2022-01-31 23:42:29,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:29,221 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1103 transitions. [2022-01-31 23:42:29,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 23:42:29,222 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1103 transitions. [2022-01-31 23:42:29,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 23:42:29,223 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:29,224 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:42:29,224 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 23:42:29,224 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:29,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:29,224 INFO L85 PathProgramCache]: Analyzing trace with hash -1573005165, now seen corresponding path program 1 times [2022-01-31 23:42:29,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:29,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [259760243] [2022-01-31 23:42:29,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:29,225 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:29,228 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:29,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:29,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:29,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:29,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 23:42:29,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:29,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:42:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:29,436 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:29,436 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:29,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [259760243] [2022-01-31 23:42:29,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [259760243] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:29,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:29,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:42:29,436 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425948660] [2022-01-31 23:42:29,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:29,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:42:29,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:29,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:42:29,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:42:29,438 INFO L87 Difference]: Start difference. First operand 819 states and 1103 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 23:42:30,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:30,954 INFO L93 Difference]: Finished difference Result 877 states and 1175 transitions. [2022-01-31 23:42:30,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 23:42:30,954 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 41 [2022-01-31 23:42:30,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:30,959 INFO L225 Difference]: With dead ends: 877 [2022-01-31 23:42:30,959 INFO L226 Difference]: Without dead ends: 871 [2022-01-31 23:42:30,959 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2022-01-31 23:42:30,960 INFO L933 BasicCegarLoop]: 456 mSDtfsCounter, 1279 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:30,960 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1294 Valid, 928 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 23:42:30,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-01-31 23:42:31,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 819. [2022-01-31 23:42:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 647 states have (on average 1.3292117465224111) internal successors, (860), 658 states have internal predecessors, (860), 99 states have call successors, (99), 62 states have call predecessors, (99), 72 states have return successors, (143), 100 states have call predecessors, (143), 91 states have call successors, (143) [2022-01-31 23:42:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1102 transitions. [2022-01-31 23:42:31,066 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1102 transitions. Word has length 41 [2022-01-31 23:42:31,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:31,067 INFO L470 AbstractCegarLoop]: Abstraction has 819 states and 1102 transitions. [2022-01-31 23:42:31,067 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 23:42:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1102 transitions. [2022-01-31 23:42:31,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 23:42:31,069 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:31,069 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:31,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 23:42:31,069 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:31,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:31,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1434972884, now seen corresponding path program 1 times [2022-01-31 23:42:31,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:31,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1838870509] [2022-01-31 23:42:31,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:31,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:31,072 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:31,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:31,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:31,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:31,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 23:42:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:31,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:42:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:31,257 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,257 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:31,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1838870509] [2022-01-31 23:42:31,257 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1838870509] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:31,258 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:31,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:42:31,258 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504758590] [2022-01-31 23:42:31,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:31,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:42:31,258 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:31,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:42:31,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:42:31,259 INFO L87 Difference]: Start difference. First operand 819 states and 1102 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:42:32,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:32,455 INFO L93 Difference]: Finished difference Result 882 states and 1180 transitions. [2022-01-31 23:42:32,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 23:42:32,455 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2022-01-31 23:42:32,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:32,459 INFO L225 Difference]: With dead ends: 882 [2022-01-31 23:42:32,460 INFO L226 Difference]: Without dead ends: 867 [2022-01-31 23:42:32,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:42:32,461 INFO L933 BasicCegarLoop]: 488 mSDtfsCounter, 539 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 1571 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 1732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:32,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [548 Valid, 1451 Invalid, 1732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1571 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 23:42:32,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2022-01-31 23:42:32,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 817. [2022-01-31 23:42:32,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 817 states, 646 states have (on average 1.328173374613003) internal successors, (858), 657 states have internal predecessors, (858), 98 states have call successors, (98), 62 states have call predecessors, (98), 72 states have return successors, (142), 99 states have call predecessors, (142), 90 states have call successors, (142) [2022-01-31 23:42:32,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1098 transitions. [2022-01-31 23:42:32,559 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1098 transitions. Word has length 42 [2022-01-31 23:42:32,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:32,559 INFO L470 AbstractCegarLoop]: Abstraction has 817 states and 1098 transitions. [2022-01-31 23:42:32,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:42:32,560 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1098 transitions. [2022-01-31 23:42:32,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 23:42:32,561 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:32,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] [2022-01-31 23:42:32,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 23:42:32,561 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:32,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:32,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1612959141, now seen corresponding path program 1 times [2022-01-31 23:42:32,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:32,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [804579397] [2022-01-31 23:42:32,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:32,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:32,564 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:32,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:32,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:32,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:32,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:32,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 23:42:32,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:32,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:42:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:32,735 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,735 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:32,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [804579397] [2022-01-31 23:42:32,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [804579397] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:32,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:32,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:42:32,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108209120] [2022-01-31 23:42:32,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:32,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:42:32,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:32,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:42:32,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:42:32,737 INFO L87 Difference]: Start difference. First operand 817 states and 1098 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:42:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:33,908 INFO L93 Difference]: Finished difference Result 880 states and 1176 transitions. [2022-01-31 23:42:33,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 23:42:33,909 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2022-01-31 23:42:33,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:33,913 INFO L225 Difference]: With dead ends: 880 [2022-01-31 23:42:33,913 INFO L226 Difference]: Without dead ends: 860 [2022-01-31 23:42:33,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:42:33,914 INFO L933 BasicCegarLoop]: 475 mSDtfsCounter, 734 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:33,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [742 Valid, 1283 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1452 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 23:42:33,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2022-01-31 23:42:34,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 810. [2022-01-31 23:42:34,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 810 states, 642 states have (on average 1.3286604361370717) internal successors, (853), 653 states have internal predecessors, (853), 96 states have call successors, (96), 61 states have call predecessors, (96), 71 states have return successors, (140), 97 states have call predecessors, (140), 88 states have call successors, (140) [2022-01-31 23:42:34,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 1089 transitions. [2022-01-31 23:42:34,018 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 1089 transitions. Word has length 41 [2022-01-31 23:42:34,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:34,018 INFO L470 AbstractCegarLoop]: Abstraction has 810 states and 1089 transitions. [2022-01-31 23:42:34,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:42:34,018 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 1089 transitions. [2022-01-31 23:42:34,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 23:42:34,020 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:34,020 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:34,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 23:42:34,020 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:34,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:34,021 INFO L85 PathProgramCache]: Analyzing trace with hash 2069240196, now seen corresponding path program 1 times [2022-01-31 23:42:34,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:34,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [545691954] [2022-01-31 23:42:34,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:34,021 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:34,023 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:34,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:34,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:34,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:34,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:42:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:34,215 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:34,215 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:34,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [545691954] [2022-01-31 23:42:34,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [545691954] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:34,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:34,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:42:34,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084794496] [2022-01-31 23:42:34,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:34,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:42:34,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:34,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:42:34,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:42:34,217 INFO L87 Difference]: Start difference. First operand 810 states and 1089 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 23:42:35,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:35,509 INFO L93 Difference]: Finished difference Result 857 states and 1144 transitions. [2022-01-31 23:42:35,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:42:35,515 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2022-01-31 23:42:35,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:35,520 INFO L225 Difference]: With dead ends: 857 [2022-01-31 23:42:35,520 INFO L226 Difference]: Without dead ends: 835 [2022-01-31 23:42:35,520 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:42:35,521 INFO L933 BasicCegarLoop]: 456 mSDtfsCounter, 235 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:35,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [239 Valid, 1014 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1608 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 23:42:35,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2022-01-31 23:42:35,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 812. [2022-01-31 23:42:35,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 644 states have (on average 1.3276397515527951) internal successors, (855), 655 states have internal predecessors, (855), 96 states have call successors, (96), 61 states have call predecessors, (96), 71 states have return successors, (140), 97 states have call predecessors, (140), 88 states have call successors, (140) [2022-01-31 23:42:35,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1091 transitions. [2022-01-31 23:42:35,629 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1091 transitions. Word has length 42 [2022-01-31 23:42:35,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:35,629 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 1091 transitions. [2022-01-31 23:42:35,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 23:42:35,629 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1091 transitions. [2022-01-31 23:42:35,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 23:42:35,630 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:35,630 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:42:35,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 23:42:35,631 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:35,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:35,631 INFO L85 PathProgramCache]: Analyzing trace with hash -289846458, now seen corresponding path program 1 times [2022-01-31 23:42:35,631 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:35,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2108058317] [2022-01-31 23:42:35,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:35,632 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:35,635 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:35,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:35,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:35,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:35,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:35,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 23:42:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:35,820 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,821 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:35,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2108058317] [2022-01-31 23:42:35,821 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2108058317] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:35,821 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:35,821 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 23:42:35,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720126306] [2022-01-31 23:42:35,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:35,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 23:42:35,822 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:35,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 23:42:35,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-31 23:42:35,822 INFO L87 Difference]: Start difference. First operand 812 states and 1091 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 23:42:37,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:37,061 INFO L93 Difference]: Finished difference Result 908 states and 1209 transitions. [2022-01-31 23:42:37,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:42:37,062 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-01-31 23:42:37,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:37,065 INFO L225 Difference]: With dead ends: 908 [2022-01-31 23:42:37,065 INFO L226 Difference]: Without dead ends: 840 [2022-01-31 23:42:37,066 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:37,066 INFO L933 BasicCegarLoop]: 432 mSDtfsCounter, 616 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 1790 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 1983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:37,066 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [634 Valid, 931 Invalid, 1983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1790 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 23:42:37,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-01-31 23:42:37,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 816. [2022-01-31 23:42:37,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 647 states have (on average 1.3261205564142196) internal successors, (858), 658 states have internal predecessors, (858), 96 states have call successors, (96), 61 states have call predecessors, (96), 72 states have return successors, (142), 98 states have call predecessors, (142), 88 states have call successors, (142) [2022-01-31 23:42:37,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2022-01-31 23:42:37,169 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 44 [2022-01-31 23:42:37,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:37,169 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2022-01-31 23:42:37,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 23:42:37,170 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2022-01-31 23:42:37,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 23:42:37,171 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:37,171 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:37,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 23:42:37,171 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:37,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:37,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1666051445, now seen corresponding path program 1 times [2022-01-31 23:42:37,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:37,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1813863022] [2022-01-31 23:42:37,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:37,172 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:37,174 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:37,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:37,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:37,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:37,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:42:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:37,324 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,324 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:37,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1813863022] [2022-01-31 23:42:37,324 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1813863022] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:37,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:37,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:42:37,325 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055665051] [2022-01-31 23:42:37,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:37,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:42:37,325 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:37,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:42:37,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:42:37,326 INFO L87 Difference]: Start difference. First operand 816 states and 1096 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 23:42:38,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:38,575 INFO L93 Difference]: Finished difference Result 860 states and 1147 transitions. [2022-01-31 23:42:38,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 23:42:38,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 43 [2022-01-31 23:42:38,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:38,578 INFO L225 Difference]: With dead ends: 860 [2022-01-31 23:42:38,578 INFO L226 Difference]: Without dead ends: 838 [2022-01-31 23:42:38,579 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-01-31 23:42:38,579 INFO L933 BasicCegarLoop]: 461 mSDtfsCounter, 293 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:38,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 1010 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 23:42:38,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2022-01-31 23:42:38,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 816. [2022-01-31 23:42:38,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 647 states have (on average 1.3261205564142196) internal successors, (858), 658 states have internal predecessors, (858), 96 states have call successors, (96), 61 states have call predecessors, (96), 72 states have return successors, (142), 98 states have call predecessors, (142), 88 states have call successors, (142) [2022-01-31 23:42:38,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 1096 transitions. [2022-01-31 23:42:38,694 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 1096 transitions. Word has length 43 [2022-01-31 23:42:38,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:38,696 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 1096 transitions. [2022-01-31 23:42:38,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 23:42:38,696 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 1096 transitions. [2022-01-31 23:42:38,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 23:42:38,697 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:38,697 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:38,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 23:42:38,697 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:38,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:38,698 INFO L85 PathProgramCache]: Analyzing trace with hash -233101078, now seen corresponding path program 1 times [2022-01-31 23:42:38,698 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:38,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1081889086] [2022-01-31 23:42:38,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:38,699 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:38,701 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:38,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:38,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:38,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:38,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:42:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:38,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 23:42:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:38,913 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,913 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:38,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1081889086] [2022-01-31 23:42:38,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1081889086] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:38,913 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:38,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:42:38,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632461740] [2022-01-31 23:42:38,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:38,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:42:38,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:38,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:42:38,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:42:38,914 INFO L87 Difference]: Start difference. First operand 816 states and 1096 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:42:39,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:39,922 INFO L93 Difference]: Finished difference Result 861 states and 1149 transitions. [2022-01-31 23:42:39,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:42:39,922 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 45 [2022-01-31 23:42:39,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:39,924 INFO L225 Difference]: With dead ends: 861 [2022-01-31 23:42:39,925 INFO L226 Difference]: Without dead ends: 843 [2022-01-31 23:42:39,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:42:39,925 INFO L933 BasicCegarLoop]: 457 mSDtfsCounter, 632 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:39,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [636 Valid, 1326 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1502 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 23:42:39,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2022-01-31 23:42:40,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 814. [2022-01-31 23:42:40,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 646 states have (on average 1.325077399380805) internal successors, (856), 657 states have internal predecessors, (856), 95 states have call successors, (95), 61 states have call predecessors, (95), 72 states have return successors, (141), 97 states have call predecessors, (141), 87 states have call successors, (141) [2022-01-31 23:42:40,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1092 transitions. [2022-01-31 23:42:40,028 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1092 transitions. Word has length 45 [2022-01-31 23:42:40,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:40,028 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 1092 transitions. [2022-01-31 23:42:40,028 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:42:40,029 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1092 transitions. [2022-01-31 23:42:40,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 23:42:40,030 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:40,030 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:42:40,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 23:42:40,030 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:40,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:40,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1086119000, now seen corresponding path program 1 times [2022-01-31 23:42:40,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:40,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [705272243] [2022-01-31 23:42:40,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:40,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:40,033 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:40,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:40,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:40,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:40,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:42:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:40,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 23:42:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:40,193 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:40,193 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:40,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [705272243] [2022-01-31 23:42:40,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [705272243] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:40,194 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:40,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:42:40,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582146727] [2022-01-31 23:42:40,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:40,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:42:40,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:40,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:42:40,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:42:40,195 INFO L87 Difference]: Start difference. First operand 814 states and 1092 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:42:41,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:41,543 INFO L93 Difference]: Finished difference Result 880 states and 1173 transitions. [2022-01-31 23:42:41,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 23:42:41,543 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2022-01-31 23:42:41,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:41,557 INFO L225 Difference]: With dead ends: 880 [2022-01-31 23:42:41,557 INFO L226 Difference]: Without dead ends: 804 [2022-01-31 23:42:41,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-31 23:42:41,558 INFO L933 BasicCegarLoop]: 486 mSDtfsCounter, 336 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 1660 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 1741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:41,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 900 Invalid, 1741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1660 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 23:42:41,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2022-01-31 23:42:41,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 775. [2022-01-31 23:42:41,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 616 states have (on average 1.3246753246753247) internal successors, (816), 628 states have internal predecessors, (816), 93 states have call successors, (93), 60 states have call predecessors, (93), 65 states have return successors, (132), 88 states have call predecessors, (132), 85 states have call successors, (132) [2022-01-31 23:42:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1041 transitions. [2022-01-31 23:42:41,661 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1041 transitions. Word has length 46 [2022-01-31 23:42:41,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:41,661 INFO L470 AbstractCegarLoop]: Abstraction has 775 states and 1041 transitions. [2022-01-31 23:42:41,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:42:41,661 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1041 transitions. [2022-01-31 23:42:41,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 23:42:41,662 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:41,662 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:42:41,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 23:42:41,663 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:41,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:41,663 INFO L85 PathProgramCache]: Analyzing trace with hash 380283320, now seen corresponding path program 1 times [2022-01-31 23:42:41,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:41,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [615001045] [2022-01-31 23:42:41,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:41,663 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:41,665 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:41,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:41,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:41,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:41,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 23:42:41,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:41,787 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,788 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:41,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [615001045] [2022-01-31 23:42:41,788 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [615001045] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:41,788 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:41,788 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 23:42:41,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488939103] [2022-01-31 23:42:41,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:41,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 23:42:41,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:41,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 23:42:41,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 23:42:41,789 INFO L87 Difference]: Start difference. First operand 775 states and 1041 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 23:42:43,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:43,378 INFO L93 Difference]: Finished difference Result 1134 states and 1535 transitions. [2022-01-31 23:42:43,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:42:43,378 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2022-01-31 23:42:43,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:43,382 INFO L225 Difference]: With dead ends: 1134 [2022-01-31 23:42:43,382 INFO L226 Difference]: Without dead ends: 1131 [2022-01-31 23:42:43,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:42:43,383 INFO L933 BasicCegarLoop]: 533 mSDtfsCounter, 429 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 1594 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:43,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [446 Valid, 784 Invalid, 1711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1594 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 23:42:43,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2022-01-31 23:42:43,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 888. [2022-01-31 23:42:43,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 707 states have (on average 1.3295615275813295) internal successors, (940), 721 states have internal predecessors, (940), 103 states have call successors, (103), 70 states have call predecessors, (103), 77 states have return successors, (152), 98 states have call predecessors, (152), 95 states have call successors, (152) [2022-01-31 23:42:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1195 transitions. [2022-01-31 23:42:43,523 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1195 transitions. Word has length 47 [2022-01-31 23:42:43,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:43,523 INFO L470 AbstractCegarLoop]: Abstraction has 888 states and 1195 transitions. [2022-01-31 23:42:43,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 23:42:43,523 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1195 transitions. [2022-01-31 23:42:43,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 23:42:43,525 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:43,525 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:42:43,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 23:42:43,525 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:43,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:43,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1845769478, now seen corresponding path program 1 times [2022-01-31 23:42:43,525 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:43,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1355130803] [2022-01-31 23:42:43,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:43,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:43,528 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:43,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:43,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:43,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:43,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:43,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:42:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:43,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:42:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:43,692 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:43,692 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:43,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1355130803] [2022-01-31 23:42:43,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1355130803] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:43,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:43,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:42:43,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126608461] [2022-01-31 23:42:43,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:43,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:42:43,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:43,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:42:43,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:42:43,694 INFO L87 Difference]: Start difference. First operand 888 states and 1195 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:42:44,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:44,888 INFO L93 Difference]: Finished difference Result 933 states and 1248 transitions. [2022-01-31 23:42:44,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 23:42:44,889 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-01-31 23:42:44,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:44,893 INFO L225 Difference]: With dead ends: 933 [2022-01-31 23:42:44,893 INFO L226 Difference]: Without dead ends: 915 [2022-01-31 23:42:44,893 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:44,894 INFO L933 BasicCegarLoop]: 448 mSDtfsCounter, 404 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1281 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:44,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [408 Valid, 1281 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 23:42:44,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2022-01-31 23:42:45,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 886. [2022-01-31 23:42:45,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 706 states have (on average 1.3286118980169972) internal successors, (938), 720 states have internal predecessors, (938), 102 states have call successors, (102), 70 states have call predecessors, (102), 77 states have return successors, (151), 97 states have call predecessors, (151), 94 states have call successors, (151) [2022-01-31 23:42:45,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1191 transitions. [2022-01-31 23:42:45,039 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1191 transitions. Word has length 47 [2022-01-31 23:42:45,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:45,040 INFO L470 AbstractCegarLoop]: Abstraction has 886 states and 1191 transitions. [2022-01-31 23:42:45,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 4 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:42:45,040 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1191 transitions. [2022-01-31 23:42:45,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 23:42:45,041 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:45,041 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:42:45,041 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 23:42:45,041 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:45,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:45,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1334176634, now seen corresponding path program 1 times [2022-01-31 23:42:45,042 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:45,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1532178807] [2022-01-31 23:42:45,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:45,042 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:45,044 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:45,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:45,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:45,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:45,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-01-31 23:42:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:45,259 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,259 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:45,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1532178807] [2022-01-31 23:42:45,259 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1532178807] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:45,259 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:45,259 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:42:45,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592478515] [2022-01-31 23:42:45,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:45,260 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:42:45,260 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:45,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:42:45,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:42:45,260 INFO L87 Difference]: Start difference. First operand 886 states and 1191 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 23:42:47,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:47,042 INFO L93 Difference]: Finished difference Result 1483 states and 1950 transitions. [2022-01-31 23:42:47,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:42:47,043 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 48 [2022-01-31 23:42:47,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:47,046 INFO L225 Difference]: With dead ends: 1483 [2022-01-31 23:42:47,046 INFO L226 Difference]: Without dead ends: 936 [2022-01-31 23:42:47,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-01-31 23:42:47,048 INFO L933 BasicCegarLoop]: 558 mSDtfsCounter, 1791 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 1367 mSolverCounterSat, 579 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1803 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 579 IncrementalHoareTripleChecker+Valid, 1367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:47,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1803 Valid, 859 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [579 Valid, 1367 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 23:42:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 936 states. [2022-01-31 23:42:47,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 936 to 877. [2022-01-31 23:42:47,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 697 states have (on average 1.3156384505021521) internal successors, (917), 711 states have internal predecessors, (917), 102 states have call successors, (102), 70 states have call predecessors, (102), 77 states have return successors, (151), 97 states have call predecessors, (151), 94 states have call successors, (151) [2022-01-31 23:42:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1170 transitions. [2022-01-31 23:42:47,174 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1170 transitions. Word has length 48 [2022-01-31 23:42:47,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:47,174 INFO L470 AbstractCegarLoop]: Abstraction has 877 states and 1170 transitions. [2022-01-31 23:42:47,174 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 6 states have internal predecessors, (36), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 23:42:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1170 transitions. [2022-01-31 23:42:47,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 23:42:47,176 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:47,176 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:42:47,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 23:42:47,176 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:47,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:47,176 INFO L85 PathProgramCache]: Analyzing trace with hash -934618588, now seen corresponding path program 1 times [2022-01-31 23:42:47,176 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:47,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1851918203] [2022-01-31 23:42:47,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:47,177 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:47,179 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:47,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:47,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:47,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:47,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:47,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:47,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:47,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:42:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:47,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:47,358 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,358 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:47,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1851918203] [2022-01-31 23:42:47,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1851918203] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:47,358 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:47,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:42:47,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425440812] [2022-01-31 23:42:47,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:47,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:42:47,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:47,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:42:47,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:42:47,359 INFO L87 Difference]: Start difference. First operand 877 states and 1170 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 23:42:49,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:49,300 INFO L93 Difference]: Finished difference Result 1151 states and 1528 transitions. [2022-01-31 23:42:49,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 23:42:49,301 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-01-31 23:42:49,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:49,306 INFO L225 Difference]: With dead ends: 1151 [2022-01-31 23:42:49,306 INFO L226 Difference]: Without dead ends: 1075 [2022-01-31 23:42:49,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2022-01-31 23:42:49,307 INFO L933 BasicCegarLoop]: 545 mSDtfsCounter, 1331 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1334 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 2699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:49,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1334 Valid, 1405 Invalid, 2699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-31 23:42:49,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2022-01-31 23:42:49,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 932. [2022-01-31 23:42:49,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.3090418353576248) internal successors, (970), 757 states have internal predecessors, (970), 105 states have call successors, (105), 71 states have call predecessors, (105), 85 states have return successors, (168), 104 states have call predecessors, (168), 97 states have call successors, (168) [2022-01-31 23:42:49,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1243 transitions. [2022-01-31 23:42:49,490 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1243 transitions. Word has length 50 [2022-01-31 23:42:49,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:49,490 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1243 transitions. [2022-01-31 23:42:49,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 7 states have internal predecessors, (38), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 23:42:49,490 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1243 transitions. [2022-01-31 23:42:49,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 23:42:49,492 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:49,492 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:42:49,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 23:42:49,492 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:49,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:49,492 INFO L85 PathProgramCache]: Analyzing trace with hash -550624226, now seen corresponding path program 1 times [2022-01-31 23:42:49,492 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:49,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1658910156] [2022-01-31 23:42:49,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:49,493 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:49,495 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:49,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:49,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:49,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:49,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:42:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:49,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 23:42:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:49,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:42:49,690 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:49,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1658910156] [2022-01-31 23:42:49,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1658910156] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:49,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:49,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 23:42:49,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244191850] [2022-01-31 23:42:49,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:49,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 23:42:49,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:49,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 23:42:49,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-31 23:42:49,692 INFO L87 Difference]: Start difference. First operand 932 states and 1243 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 23:42:50,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:50,755 INFO L93 Difference]: Finished difference Result 979 states and 1296 transitions. [2022-01-31 23:42:50,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:42:50,759 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-01-31 23:42:50,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:50,763 INFO L225 Difference]: With dead ends: 979 [2022-01-31 23:42:50,763 INFO L226 Difference]: Without dead ends: 959 [2022-01-31 23:42:50,764 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:42:50,765 INFO L933 BasicCegarLoop]: 442 mSDtfsCounter, 779 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 783 SdHoareTripleChecker+Valid, 1355 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:50,765 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [783 Valid, 1355 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1521 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 23:42:50,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-01-31 23:42:50,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 932. [2022-01-31 23:42:50,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 741 states have (on average 1.2928475033738192) internal successors, (958), 757 states have internal predecessors, (958), 105 states have call successors, (105), 71 states have call predecessors, (105), 85 states have return successors, (168), 104 states have call predecessors, (168), 97 states have call successors, (168) [2022-01-31 23:42:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1231 transitions. [2022-01-31 23:42:50,896 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1231 transitions. Word has length 50 [2022-01-31 23:42:50,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:50,897 INFO L470 AbstractCegarLoop]: Abstraction has 932 states and 1231 transitions. [2022-01-31 23:42:50,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 23:42:50,897 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1231 transitions. [2022-01-31 23:42:50,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 23:42:50,898 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:50,898 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:50,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 23:42:50,899 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:50,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:50,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1358171884, now seen corresponding path program 1 times [2022-01-31 23:42:50,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:50,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2061755026] [2022-01-31 23:42:50,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:50,899 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:50,901 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:50,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:51,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:51,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:51,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 23:42:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:51,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:42:51,062 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:51,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2061755026] [2022-01-31 23:42:51,062 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2061755026] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:51,062 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:51,062 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:42:51,062 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833925580] [2022-01-31 23:42:51,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:51,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:42:51,063 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:51,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:42:51,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:42:51,064 INFO L87 Difference]: Start difference. First operand 932 states and 1231 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 23:42:52,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:52,224 INFO L93 Difference]: Finished difference Result 1041 states and 1345 transitions. [2022-01-31 23:42:52,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 23:42:52,225 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2022-01-31 23:42:52,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:52,227 INFO L225 Difference]: With dead ends: 1041 [2022-01-31 23:42:52,227 INFO L226 Difference]: Without dead ends: 685 [2022-01-31 23:42:52,228 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:52,228 INFO L933 BasicCegarLoop]: 470 mSDtfsCounter, 692 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:52,228 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [701 Valid, 831 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 23:42:52,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-01-31 23:42:52,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 623. [2022-01-31 23:42:52,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 498 states have (on average 1.2751004016064258) internal successors, (635), 509 states have internal predecessors, (635), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 68 states have call predecessors, (85), 63 states have call successors, (85) [2022-01-31 23:42:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 791 transitions. [2022-01-31 23:42:52,335 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 791 transitions. Word has length 52 [2022-01-31 23:42:52,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:52,335 INFO L470 AbstractCegarLoop]: Abstraction has 623 states and 791 transitions. [2022-01-31 23:42:52,335 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 4 states have internal predecessors, (39), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 23:42:52,335 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 791 transitions. [2022-01-31 23:42:52,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 23:42:52,337 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:52,337 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:42:52,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 23:42:52,337 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:52,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:52,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1083541932, now seen corresponding path program 1 times [2022-01-31 23:42:52,337 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:52,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1061234915] [2022-01-31 23:42:52,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:52,338 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:52,340 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:52,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:52,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:52,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:52,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:52,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:42:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:52,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:42:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:52,506 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,507 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:52,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1061234915] [2022-01-31 23:42:52,507 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1061234915] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:52,507 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:52,507 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 23:42:52,507 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346845270] [2022-01-31 23:42:52,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:52,507 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 23:42:52,508 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:52,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 23:42:52,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-31 23:42:52,508 INFO L87 Difference]: Start difference. First operand 623 states and 791 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:42:53,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:53,794 INFO L93 Difference]: Finished difference Result 681 states and 860 transitions. [2022-01-31 23:42:53,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 23:42:53,794 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2022-01-31 23:42:53,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:53,797 INFO L225 Difference]: With dead ends: 681 [2022-01-31 23:42:53,797 INFO L226 Difference]: Without dead ends: 659 [2022-01-31 23:42:53,797 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2022-01-31 23:42:53,798 INFO L933 BasicCegarLoop]: 414 mSDtfsCounter, 782 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 1949 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:53,798 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [798 Valid, 1006 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1949 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 23:42:53,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-01-31 23:42:53,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 624. [2022-01-31 23:42:53,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 499 states have (on average 1.2745490981963927) internal successors, (636), 509 states have internal predecessors, (636), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85) [2022-01-31 23:42:53,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 792 transitions. [2022-01-31 23:42:53,894 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 792 transitions. Word has length 51 [2022-01-31 23:42:53,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:53,894 INFO L470 AbstractCegarLoop]: Abstraction has 624 states and 792 transitions. [2022-01-31 23:42:53,894 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:42:53,894 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 792 transitions. [2022-01-31 23:42:53,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 23:42:53,895 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:53,895 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:42:53,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 23:42:53,896 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:53,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:53,896 INFO L85 PathProgramCache]: Analyzing trace with hash 325068325, now seen corresponding path program 1 times [2022-01-31 23:42:53,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:53,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1108037118] [2022-01-31 23:42:53,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:53,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:53,898 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:53,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:54,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:54,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:54,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:42:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:54,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:42:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:54,102 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:54,102 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:54,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1108037118] [2022-01-31 23:42:54,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1108037118] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:54,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:54,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 23:42:54,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922104372] [2022-01-31 23:42:54,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:54,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 23:42:54,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:54,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 23:42:54,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-01-31 23:42:54,103 INFO L87 Difference]: Start difference. First operand 624 states and 792 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 23:42:55,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:55,258 INFO L93 Difference]: Finished difference Result 676 states and 851 transitions. [2022-01-31 23:42:55,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:42:55,259 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-01-31 23:42:55,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:55,261 INFO L225 Difference]: With dead ends: 676 [2022-01-31 23:42:55,261 INFO L226 Difference]: Without dead ends: 648 [2022-01-31 23:42:55,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2022-01-31 23:42:55,262 INFO L933 BasicCegarLoop]: 441 mSDtfsCounter, 399 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 1877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:55,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [407 Valid, 1402 Invalid, 1877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1749 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 23:42:55,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2022-01-31 23:42:55,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 616. [2022-01-31 23:42:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 491 states have (on average 1.2688391038696538) internal successors, (623), 501 states have internal predecessors, (623), 71 states have call successors, (71), 46 states have call predecessors, (71), 53 states have return successors, (85), 69 states have call predecessors, (85), 63 states have call successors, (85) [2022-01-31 23:42:55,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 779 transitions. [2022-01-31 23:42:55,387 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 779 transitions. Word has length 51 [2022-01-31 23:42:55,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:55,387 INFO L470 AbstractCegarLoop]: Abstraction has 616 states and 779 transitions. [2022-01-31 23:42:55,387 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 5 states have internal predecessors, (39), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 23:42:55,387 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 779 transitions. [2022-01-31 23:42:55,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 23:42:55,388 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:55,388 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:55,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 23:42:55,388 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:55,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:55,389 INFO L85 PathProgramCache]: Analyzing trace with hash 519788489, now seen corresponding path program 1 times [2022-01-31 23:42:55,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:55,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1209295474] [2022-01-31 23:42:55,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:55,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:55,391 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:55,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:55,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:55,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:55,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:55,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:42:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:55,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:55,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:55,565 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,565 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:55,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1209295474] [2022-01-31 23:42:55,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1209295474] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:55,566 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:55,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:42:55,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60963399] [2022-01-31 23:42:55,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:55,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:42:55,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:55,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:42:55,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:42:55,568 INFO L87 Difference]: Start difference. First operand 616 states and 779 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:42:56,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:56,650 INFO L93 Difference]: Finished difference Result 865 states and 1111 transitions. [2022-01-31 23:42:56,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:42:56,650 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2022-01-31 23:42:56,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:56,654 INFO L225 Difference]: With dead ends: 865 [2022-01-31 23:42:56,654 INFO L226 Difference]: Without dead ends: 832 [2022-01-31 23:42:56,655 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:42:56,656 INFO L933 BasicCegarLoop]: 543 mSDtfsCounter, 539 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:56,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [549 Valid, 927 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 23:42:56,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2022-01-31 23:42:56,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 659. [2022-01-31 23:42:56,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 527 states have (on average 1.2580645161290323) internal successors, (663), 530 states have internal predecessors, (663), 73 states have call successors, (73), 48 states have call predecessors, (73), 58 states have return successors, (97), 81 states have call predecessors, (97), 65 states have call successors, (97) [2022-01-31 23:42:56,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 833 transitions. [2022-01-31 23:42:56,817 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 833 transitions. Word has length 52 [2022-01-31 23:42:56,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:56,818 INFO L470 AbstractCegarLoop]: Abstraction has 659 states and 833 transitions. [2022-01-31 23:42:56,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:42:56,818 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 833 transitions. [2022-01-31 23:42:56,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 23:42:56,819 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:56,819 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:56,820 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 23:42:56,820 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:56,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:56,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1964857033, now seen corresponding path program 1 times [2022-01-31 23:42:56,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:56,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1342395134] [2022-01-31 23:42:56,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:56,821 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:56,824 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:56,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:56,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:56,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:56,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:42:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:57,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:57,030 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,030 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:57,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1342395134] [2022-01-31 23:42:57,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1342395134] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:57,031 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:57,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:42:57,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338818330] [2022-01-31 23:42:57,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:57,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:42:57,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:57,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:42:57,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:42:57,032 INFO L87 Difference]: Start difference. First operand 659 states and 833 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 23:42:58,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:58,091 INFO L93 Difference]: Finished difference Result 1092 states and 1408 transitions. [2022-01-31 23:42:58,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 23:42:58,092 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 52 [2022-01-31 23:42:58,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:58,094 INFO L225 Difference]: With dead ends: 1092 [2022-01-31 23:42:58,094 INFO L226 Difference]: Without dead ends: 714 [2022-01-31 23:42:58,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:42:58,096 INFO L933 BasicCegarLoop]: 398 mSDtfsCounter, 1420 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1435 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:58,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1435 Valid, 867 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 23:42:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-01-31 23:42:58,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 666. [2022-01-31 23:42:58,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 534 states have (on average 1.2602996254681649) internal successors, (673), 537 states have internal predecessors, (673), 73 states have call successors, (73), 48 states have call predecessors, (73), 58 states have return successors, (97), 81 states have call predecessors, (97), 65 states have call successors, (97) [2022-01-31 23:42:58,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 843 transitions. [2022-01-31 23:42:58,221 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 843 transitions. Word has length 52 [2022-01-31 23:42:58,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:42:58,222 INFO L470 AbstractCegarLoop]: Abstraction has 666 states and 843 transitions. [2022-01-31 23:42:58,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 23:42:58,222 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 843 transitions. [2022-01-31 23:42:58,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 23:42:58,223 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:42:58,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] [2022-01-31 23:42:58,223 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 23:42:58,223 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:42:58,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:42:58,224 INFO L85 PathProgramCache]: Analyzing trace with hash 376509131, now seen corresponding path program 1 times [2022-01-31 23:42:58,224 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:42:58,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1110152902] [2022-01-31 23:42:58,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:42:58,224 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:42:58,227 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:42:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:58,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:42:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:58,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:58,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:58,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:42:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:58,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:42:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:58,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:42:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:42:58,430 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,430 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:42:58,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1110152902] [2022-01-31 23:42:58,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1110152902] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:42:58,430 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:42:58,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 23:42:58,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640226197] [2022-01-31 23:42:58,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:42:58,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 23:42:58,431 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:42:58,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 23:42:58,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-01-31 23:42:58,432 INFO L87 Difference]: Start difference. First operand 666 states and 843 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 23:42:59,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:42:59,905 INFO L93 Difference]: Finished difference Result 731 states and 921 transitions. [2022-01-31 23:42:59,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 23:42:59,905 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2022-01-31 23:42:59,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:42:59,908 INFO L225 Difference]: With dead ends: 731 [2022-01-31 23:42:59,908 INFO L226 Difference]: Without dead ends: 610 [2022-01-31 23:42:59,909 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-01-31 23:42:59,909 INFO L933 BasicCegarLoop]: 400 mSDtfsCounter, 1244 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:42:59,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1251 Valid, 1048 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 23:42:59,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-01-31 23:43:00,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 575. [2022-01-31 23:43:00,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 455 states have (on average 1.2747252747252746) internal successors, (580), 465 states have internal predecessors, (580), 69 states have call successors, (69), 44 states have call predecessors, (69), 50 states have return successors, (82), 66 states have call predecessors, (82), 61 states have call successors, (82) [2022-01-31 23:43:00,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 731 transitions. [2022-01-31 23:43:00,049 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 731 transitions. Word has length 52 [2022-01-31 23:43:00,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:00,049 INFO L470 AbstractCegarLoop]: Abstraction has 575 states and 731 transitions. [2022-01-31 23:43:00,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 23:43:00,049 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 731 transitions. [2022-01-31 23:43:00,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 23:43:00,050 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:00,050 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:00,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 23:43:00,051 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:00,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:00,051 INFO L85 PathProgramCache]: Analyzing trace with hash -614500354, now seen corresponding path program 1 times [2022-01-31 23:43:00,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:00,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [840674718] [2022-01-31 23:43:00,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:00,052 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:00,053 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:00,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:00,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:00,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:00,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:43:00,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:00,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:00,241 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:00,241 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:00,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [840674718] [2022-01-31 23:43:00,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [840674718] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:00,242 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:00,242 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 23:43:00,242 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008247482] [2022-01-31 23:43:00,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:00,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 23:43:00,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:00,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 23:43:00,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 23:43:00,244 INFO L87 Difference]: Start difference. First operand 575 states and 731 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:43:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:01,574 INFO L93 Difference]: Finished difference Result 609 states and 770 transitions. [2022-01-31 23:43:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:43:01,575 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2022-01-31 23:43:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:01,578 INFO L225 Difference]: With dead ends: 609 [2022-01-31 23:43:01,578 INFO L226 Difference]: Without dead ends: 605 [2022-01-31 23:43:01,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:43:01,579 INFO L933 BasicCegarLoop]: 407 mSDtfsCounter, 443 mSDsluCounter, 1178 mSDsCounter, 0 mSdLazyCounter, 2303 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 2474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 2303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:01,579 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [447 Valid, 1585 Invalid, 2474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 2303 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 23:43:01,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-01-31 23:43:01,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 583. [2022-01-31 23:43:01,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 462 states have (on average 1.2705627705627707) internal successors, (587), 472 states have internal predecessors, (587), 69 states have call successors, (69), 44 states have call predecessors, (69), 51 states have return successors, (83), 67 states have call predecessors, (83), 61 states have call successors, (83) [2022-01-31 23:43:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 739 transitions. [2022-01-31 23:43:01,688 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 739 transitions. Word has length 53 [2022-01-31 23:43:01,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:01,689 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 739 transitions. [2022-01-31 23:43:01,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:43:01,689 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 739 transitions. [2022-01-31 23:43:01,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 23:43:01,690 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:01,690 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:01,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 23:43:01,690 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:01,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:01,690 INFO L85 PathProgramCache]: Analyzing trace with hash -614777184, now seen corresponding path program 1 times [2022-01-31 23:43:01,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:01,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1836571980] [2022-01-31 23:43:01,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:01,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:01,693 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:43:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:01,940 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,940 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:01,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1836571980] [2022-01-31 23:43:01,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1836571980] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:01,940 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:01,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 23:43:01,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206879241] [2022-01-31 23:43:01,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:01,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 23:43:01,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:01,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 23:43:01,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 23:43:01,941 INFO L87 Difference]: Start difference. First operand 583 states and 739 transitions. Second operand has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:43:03,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:03,042 INFO L93 Difference]: Finished difference Result 644 states and 823 transitions. [2022-01-31 23:43:03,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 23:43:03,043 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 53 [2022-01-31 23:43:03,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:03,044 INFO L225 Difference]: With dead ends: 644 [2022-01-31 23:43:03,044 INFO L226 Difference]: Without dead ends: 629 [2022-01-31 23:43:03,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:43:03,045 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 529 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 1868 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 2048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:03,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [538 Valid, 1614 Invalid, 2048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1868 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 23:43:03,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2022-01-31 23:43:03,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 589. [2022-01-31 23:43:03,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 467 states have (on average 1.2676659528907923) internal successors, (592), 478 states have internal predecessors, (592), 69 states have call successors, (69), 44 states have call predecessors, (69), 52 states have return successors, (90), 67 states have call predecessors, (90), 61 states have call successors, (90) [2022-01-31 23:43:03,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 751 transitions. [2022-01-31 23:43:03,170 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 751 transitions. Word has length 53 [2022-01-31 23:43:03,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:03,170 INFO L470 AbstractCegarLoop]: Abstraction has 589 states and 751 transitions. [2022-01-31 23:43:03,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.1538461538461537) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:43:03,170 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 751 transitions. [2022-01-31 23:43:03,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 23:43:03,171 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:03,172 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:43:03,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-31 23:43:03,172 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:03,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:03,172 INFO L85 PathProgramCache]: Analyzing trace with hash -903470965, now seen corresponding path program 1 times [2022-01-31 23:43:03,172 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:03,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [947917252] [2022-01-31 23:43:03,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:03,173 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:03,175 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:03,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:03,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:03,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:03,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:43:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:03,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:03,346 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:03,347 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:03,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [947917252] [2022-01-31 23:43:03,347 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [947917252] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:03,347 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:03,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:43:03,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978947141] [2022-01-31 23:43:03,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:03,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:43:03,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:03,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:43:03,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:43:03,348 INFO L87 Difference]: Start difference. First operand 589 states and 751 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 23:43:04,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:04,909 INFO L93 Difference]: Finished difference Result 758 states and 985 transitions. [2022-01-31 23:43:04,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 23:43:04,910 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2022-01-31 23:43:04,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:04,912 INFO L225 Difference]: With dead ends: 758 [2022-01-31 23:43:04,912 INFO L226 Difference]: Without dead ends: 740 [2022-01-31 23:43:04,913 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=265, Unknown=0, NotChecked=0, Total=380 [2022-01-31 23:43:04,913 INFO L933 BasicCegarLoop]: 517 mSDtfsCounter, 954 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:04,913 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [969 Valid, 921 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 23:43:04,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2022-01-31 23:43:05,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 573. [2022-01-31 23:43:05,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 454 states have (on average 1.2731277533039647) internal successors, (578), 464 states have internal predecessors, (578), 68 states have call successors, (68), 44 states have call predecessors, (68), 50 states have return successors, (81), 65 states have call predecessors, (81), 60 states have call successors, (81) [2022-01-31 23:43:05,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 727 transitions. [2022-01-31 23:43:05,026 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 727 transitions. Word has length 54 [2022-01-31 23:43:05,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:05,026 INFO L470 AbstractCegarLoop]: Abstraction has 573 states and 727 transitions. [2022-01-31 23:43:05,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 23:43:05,026 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 727 transitions. [2022-01-31 23:43:05,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 23:43:05,027 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:05,027 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:43:05,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-31 23:43:05,027 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:05,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:05,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1947373933, now seen corresponding path program 1 times [2022-01-31 23:43:05,028 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:05,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1798887648] [2022-01-31 23:43:05,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:05,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:05,030 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:05,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:05,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:05,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:05,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:05,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:43:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:05,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 23:43:05,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:05,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 23:43:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:05,238 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,238 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:05,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1798887648] [2022-01-31 23:43:05,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1798887648] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:05,238 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:05,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:43:05,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900662965] [2022-01-31 23:43:05,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:05,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:43:05,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:05,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:43:05,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:43:05,239 INFO L87 Difference]: Start difference. First operand 573 states and 727 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 23:43:06,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:06,558 INFO L93 Difference]: Finished difference Result 608 states and 766 transitions. [2022-01-31 23:43:06,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 23:43:06,558 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 55 [2022-01-31 23:43:06,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:06,560 INFO L225 Difference]: With dead ends: 608 [2022-01-31 23:43:06,560 INFO L226 Difference]: Without dead ends: 580 [2022-01-31 23:43:06,561 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:43:06,561 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 363 mSDsluCounter, 1278 mSDsCounter, 0 mSdLazyCounter, 2473 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 2589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:06,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 1679 Invalid, 2589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2473 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 23:43:06,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2022-01-31 23:43:06,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 561. [2022-01-31 23:43:06,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 445 states have (on average 1.2719101123595506) internal successors, (566), 455 states have internal predecessors, (566), 66 states have call successors, (66), 43 states have call predecessors, (66), 49 states have return successors, (79), 63 states have call predecessors, (79), 58 states have call successors, (79) [2022-01-31 23:43:06,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 711 transitions. [2022-01-31 23:43:06,690 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 711 transitions. Word has length 55 [2022-01-31 23:43:06,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:06,691 INFO L470 AbstractCegarLoop]: Abstraction has 561 states and 711 transitions. [2022-01-31 23:43:06,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 6 states have internal predecessors, (41), 2 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 23:43:06,691 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 711 transitions. [2022-01-31 23:43:06,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 23:43:06,692 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:06,692 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:43:06,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-31 23:43:06,692 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:06,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:06,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1340373320, now seen corresponding path program 1 times [2022-01-31 23:43:06,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:06,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1565676962] [2022-01-31 23:43:06,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:06,693 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:06,695 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 23:43:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 23:43:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:06,845 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,845 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:06,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1565676962] [2022-01-31 23:43:06,845 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1565676962] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:06,845 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:06,845 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 23:43:06,845 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424403169] [2022-01-31 23:43:06,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:06,846 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 23:43:06,846 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:06,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 23:43:06,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 23:43:06,847 INFO L87 Difference]: Start difference. First operand 561 states and 711 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 23:43:07,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:07,671 INFO L93 Difference]: Finished difference Result 898 states and 1149 transitions. [2022-01-31 23:43:07,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 23:43:07,672 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-01-31 23:43:07,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:07,674 INFO L225 Difference]: With dead ends: 898 [2022-01-31 23:43:07,674 INFO L226 Difference]: Without dead ends: 589 [2022-01-31 23:43:07,675 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:43:07,675 INFO L933 BasicCegarLoop]: 385 mSDtfsCounter, 393 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:07,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 817 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 23:43:07,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-01-31 23:43:07,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 566. [2022-01-31 23:43:07,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 449 states have (on average 1.265033407572383) internal successors, (568), 460 states have internal predecessors, (568), 66 states have call successors, (66), 43 states have call predecessors, (66), 50 states have return successors, (83), 63 states have call predecessors, (83), 58 states have call successors, (83) [2022-01-31 23:43:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 717 transitions. [2022-01-31 23:43:07,812 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 717 transitions. Word has length 58 [2022-01-31 23:43:07,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:07,812 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 717 transitions. [2022-01-31 23:43:07,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 23:43:07,812 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 717 transitions. [2022-01-31 23:43:07,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-31 23:43:07,813 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:07,813 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:07,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-31 23:43:07,813 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:07,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:07,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1752890422, now seen corresponding path program 1 times [2022-01-31 23:43:07,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:07,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [653271089] [2022-01-31 23:43:07,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:07,814 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:07,816 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:07,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 23:43:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:08,047 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,047 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:08,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [653271089] [2022-01-31 23:43:08,047 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [653271089] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:08,048 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:08,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:43:08,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777402152] [2022-01-31 23:43:08,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:08,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:43:08,048 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:08,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:43:08,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:43:08,049 INFO L87 Difference]: Start difference. First operand 566 states and 717 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 23:43:09,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:09,308 INFO L93 Difference]: Finished difference Result 852 states and 1088 transitions. [2022-01-31 23:43:09,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:43:09,308 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 64 [2022-01-31 23:43:09,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:09,310 INFO L225 Difference]: With dead ends: 852 [2022-01-31 23:43:09,310 INFO L226 Difference]: Without dead ends: 538 [2022-01-31 23:43:09,311 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:43:09,312 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 302 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:09,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 1212 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 23:43:09,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-01-31 23:43:09,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 511. [2022-01-31 23:43:09,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 511 states, 402 states have (on average 1.2537313432835822) internal successors, (504), 410 states have internal predecessors, (504), 63 states have call successors, (63), 42 states have call predecessors, (63), 45 states have return successors, (72), 59 states have call predecessors, (72), 56 states have call successors, (72) [2022-01-31 23:43:09,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 639 transitions. [2022-01-31 23:43:09,444 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 639 transitions. Word has length 64 [2022-01-31 23:43:09,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:09,444 INFO L470 AbstractCegarLoop]: Abstraction has 511 states and 639 transitions. [2022-01-31 23:43:09,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 23:43:09,444 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 639 transitions. [2022-01-31 23:43:09,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-31 23:43:09,445 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:09,445 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:09,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-31 23:43:09,446 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:09,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:09,446 INFO L85 PathProgramCache]: Analyzing trace with hash -557797138, now seen corresponding path program 1 times [2022-01-31 23:43:09,446 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:09,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1409381915] [2022-01-31 23:43:09,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:09,446 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:09,448 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:09,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:09,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:43:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:43:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 23:43:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:09,691 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,691 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:09,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1409381915] [2022-01-31 23:43:09,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1409381915] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:09,691 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:09,692 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:43:09,692 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276121292] [2022-01-31 23:43:09,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:09,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:43:09,692 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:09,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:43:09,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:43:09,693 INFO L87 Difference]: Start difference. First operand 511 states and 639 transitions. Second operand has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 23:43:11,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:11,027 INFO L93 Difference]: Finished difference Result 545 states and 678 transitions. [2022-01-31 23:43:11,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 23:43:11,028 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2022-01-31 23:43:11,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:11,029 INFO L225 Difference]: With dead ends: 545 [2022-01-31 23:43:11,029 INFO L226 Difference]: Without dead ends: 524 [2022-01-31 23:43:11,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2022-01-31 23:43:11,030 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 507 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 2591 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 2736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 2591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:11,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [520 Valid, 1186 Invalid, 2736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 2591 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 23:43:11,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-01-31 23:43:11,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 508. [2022-01-31 23:43:11,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 399 states have (on average 1.255639097744361) internal successors, (501), 408 states have internal predecessors, (501), 63 states have call successors, (63), 42 states have call predecessors, (63), 45 states have return successors, (71), 58 states have call predecessors, (71), 56 states have call successors, (71) [2022-01-31 23:43:11,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 635 transitions. [2022-01-31 23:43:11,133 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 635 transitions. Word has length 59 [2022-01-31 23:43:11,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:11,134 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 635 transitions. [2022-01-31 23:43:11,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2142857142857144) internal successors, (45), 6 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 23:43:11,134 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 635 transitions. [2022-01-31 23:43:11,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 23:43:11,134 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:11,134 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:43:11,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-31 23:43:11,135 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:11,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:11,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2048336817, now seen corresponding path program 1 times [2022-01-31 23:43:11,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:11,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1071270297] [2022-01-31 23:43:11,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:11,135 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:11,137 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:11,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:11,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 23:43:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:11,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:43:11,315 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:11,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1071270297] [2022-01-31 23:43:11,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1071270297] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:11,316 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:11,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 23:43:11,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352063778] [2022-01-31 23:43:11,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:11,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 23:43:11,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:11,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 23:43:11,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-01-31 23:43:11,317 INFO L87 Difference]: Start difference. First operand 508 states and 635 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:43:12,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:12,408 INFO L93 Difference]: Finished difference Result 538 states and 669 transitions. [2022-01-31 23:43:12,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 23:43:12,409 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 58 [2022-01-31 23:43:12,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:12,410 INFO L225 Difference]: With dead ends: 538 [2022-01-31 23:43:12,410 INFO L226 Difference]: Without dead ends: 520 [2022-01-31 23:43:12,411 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:43:12,411 INFO L933 BasicCegarLoop]: 391 mSDtfsCounter, 366 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 2009 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 2126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:12,411 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [370 Valid, 1556 Invalid, 2126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2009 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 23:43:12,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-01-31 23:43:12,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 504. [2022-01-31 23:43:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 396 states have (on average 1.255050505050505) internal successors, (497), 405 states have internal predecessors, (497), 62 states have call successors, (62), 42 states have call predecessors, (62), 45 states have return successors, (70), 57 states have call predecessors, (70), 55 states have call successors, (70) [2022-01-31 23:43:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 629 transitions. [2022-01-31 23:43:12,508 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 629 transitions. Word has length 58 [2022-01-31 23:43:12,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:12,508 INFO L470 AbstractCegarLoop]: Abstraction has 504 states and 629 transitions. [2022-01-31 23:43:12,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:43:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 629 transitions. [2022-01-31 23:43:12,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 23:43:12,509 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:12,509 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:43:12,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-31 23:43:12,509 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:12,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:12,510 INFO L85 PathProgramCache]: Analyzing trace with hash 853367933, now seen corresponding path program 1 times [2022-01-31 23:43:12,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:12,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2063411290] [2022-01-31 23:43:12,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:12,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:12,512 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:12,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 23:43:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 23:43:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:12,705 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,705 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:12,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2063411290] [2022-01-31 23:43:12,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2063411290] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:12,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:12,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:43:12,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130975469] [2022-01-31 23:43:12,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:12,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:43:12,706 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:12,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:43:12,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:43:12,707 INFO L87 Difference]: Start difference. First operand 504 states and 629 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 23:43:13,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:13,842 INFO L93 Difference]: Finished difference Result 539 states and 669 transitions. [2022-01-31 23:43:13,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:43:13,842 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2022-01-31 23:43:13,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:13,844 INFO L225 Difference]: With dead ends: 539 [2022-01-31 23:43:13,844 INFO L226 Difference]: Without dead ends: 515 [2022-01-31 23:43:13,845 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-01-31 23:43:13,845 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 399 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1990 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:13,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 844 Invalid, 2108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1990 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 23:43:13,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-01-31 23:43:13,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 499. [2022-01-31 23:43:13,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 393 states have (on average 1.251908396946565) internal successors, (492), 401 states have internal predecessors, (492), 61 states have call successors, (61), 42 states have call predecessors, (61), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2022-01-31 23:43:13,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 621 transitions. [2022-01-31 23:43:13,972 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 621 transitions. Word has length 60 [2022-01-31 23:43:13,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:13,972 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 621 transitions. [2022-01-31 23:43:13,972 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 23:43:13,972 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 621 transitions. [2022-01-31 23:43:13,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 23:43:13,973 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:13,973 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:13,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-31 23:43:13,973 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:13,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:13,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1746189105, now seen corresponding path program 1 times [2022-01-31 23:43:13,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:13,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [220429138] [2022-01-31 23:43:13,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:13,974 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:13,976 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:13,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:14,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:14,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:14,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:14,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 23:43:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:14,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:14,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:14,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:14,171 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:14,171 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:14,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [220429138] [2022-01-31 23:43:14,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [220429138] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:14,172 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:14,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:43:14,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998298866] [2022-01-31 23:43:14,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:14,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:43:14,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:14,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:43:14,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:43:14,173 INFO L87 Difference]: Start difference. First operand 499 states and 621 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 23:43:15,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:15,387 INFO L93 Difference]: Finished difference Result 780 states and 980 transitions. [2022-01-31 23:43:15,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 23:43:15,388 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2022-01-31 23:43:15,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:15,390 INFO L225 Difference]: With dead ends: 780 [2022-01-31 23:43:15,390 INFO L226 Difference]: Without dead ends: 521 [2022-01-31 23:43:15,391 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:43:15,391 INFO L933 BasicCegarLoop]: 357 mSDtfsCounter, 624 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:15,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [637 Valid, 1041 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 23:43:15,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2022-01-31 23:43:15,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 499. [2022-01-31 23:43:15,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 393 states have (on average 1.2468193384223918) internal successors, (490), 401 states have internal predecessors, (490), 61 states have call successors, (61), 42 states have call predecessors, (61), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2022-01-31 23:43:15,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 619 transitions. [2022-01-31 23:43:15,484 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 619 transitions. Word has length 68 [2022-01-31 23:43:15,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:15,485 INFO L470 AbstractCegarLoop]: Abstraction has 499 states and 619 transitions. [2022-01-31 23:43:15,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 23:43:15,485 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 619 transitions. [2022-01-31 23:43:15,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 23:43:15,486 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:15,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:15,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-31 23:43:15,486 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:15,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:15,487 INFO L85 PathProgramCache]: Analyzing trace with hash -662819238, now seen corresponding path program 1 times [2022-01-31 23:43:15,487 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:15,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [772850071] [2022-01-31 23:43:15,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:15,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:15,489 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:15,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:15,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:15,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:15,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:43:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:15,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:43:15,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:15,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:15,657 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:15,657 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:15,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [772850071] [2022-01-31 23:43:15,657 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [772850071] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:15,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:15,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 23:43:15,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881794560] [2022-01-31 23:43:15,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:15,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 23:43:15,659 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:15,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 23:43:15,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-31 23:43:15,660 INFO L87 Difference]: Start difference. First operand 499 states and 619 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 23:43:16,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:16,949 INFO L93 Difference]: Finished difference Result 611 states and 749 transitions. [2022-01-31 23:43:16,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 23:43:16,950 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2022-01-31 23:43:16,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:16,951 INFO L225 Difference]: With dead ends: 611 [2022-01-31 23:43:16,951 INFO L226 Difference]: Without dead ends: 519 [2022-01-31 23:43:16,952 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-01-31 23:43:16,952 INFO L933 BasicCegarLoop]: 359 mSDtfsCounter, 257 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 1928 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:16,952 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 814 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1928 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 23:43:16,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-01-31 23:43:17,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 503. [2022-01-31 23:43:17,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 396 states have (on average 1.244949494949495) internal successors, (493), 404 states have internal predecessors, (493), 61 states have call successors, (61), 42 states have call predecessors, (61), 45 states have return successors, (69), 57 states have call predecessors, (69), 54 states have call successors, (69) [2022-01-31 23:43:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 623 transitions. [2022-01-31 23:43:17,083 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 623 transitions. Word has length 63 [2022-01-31 23:43:17,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:17,083 INFO L470 AbstractCegarLoop]: Abstraction has 503 states and 623 transitions. [2022-01-31 23:43:17,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 23:43:17,084 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 623 transitions. [2022-01-31 23:43:17,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 23:43:17,084 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:17,085 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:17,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-31 23:43:17,085 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:17,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:17,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1616978329, now seen corresponding path program 1 times [2022-01-31 23:43:17,085 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:17,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1561609143] [2022-01-31 23:43:17,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:17,086 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:17,088 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:17,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:17,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:17,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:17,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:17,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:43:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:17,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:43:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:17,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:17,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:17,292 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:17,292 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:17,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1561609143] [2022-01-31 23:43:17,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1561609143] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:17,292 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:17,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:43:17,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484966298] [2022-01-31 23:43:17,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:17,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:43:17,294 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:17,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:43:17,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:43:17,294 INFO L87 Difference]: Start difference. First operand 503 states and 623 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 23:43:18,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:18,442 INFO L93 Difference]: Finished difference Result 529 states and 653 transitions. [2022-01-31 23:43:18,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:43:18,443 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 63 [2022-01-31 23:43:18,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:18,444 INFO L225 Difference]: With dead ends: 529 [2022-01-31 23:43:18,444 INFO L226 Difference]: Without dead ends: 505 [2022-01-31 23:43:18,445 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2022-01-31 23:43:18,445 INFO L933 BasicCegarLoop]: 352 mSDtfsCounter, 429 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 972 SdHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:18,445 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [443 Valid, 972 Invalid, 2231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2109 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 23:43:18,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-01-31 23:43:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 489. [2022-01-31 23:43:18,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 384 states have (on average 1.2395833333333333) internal successors, (476), 391 states have internal predecessors, (476), 60 states have call successors, (60), 42 states have call predecessors, (60), 44 states have return successors, (68), 56 states have call predecessors, (68), 54 states have call successors, (68) [2022-01-31 23:43:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 604 transitions. [2022-01-31 23:43:18,581 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 604 transitions. Word has length 63 [2022-01-31 23:43:18,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:18,581 INFO L470 AbstractCegarLoop]: Abstraction has 489 states and 604 transitions. [2022-01-31 23:43:18,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 23:43:18,581 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 604 transitions. [2022-01-31 23:43:18,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 23:43:18,582 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:18,582 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:18,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-31 23:43:18,582 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:18,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:18,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1834799191, now seen corresponding path program 1 times [2022-01-31 23:43:18,583 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:18,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1907816615] [2022-01-31 23:43:18,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:18,583 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:18,585 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:18,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:18,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:18,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:18,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:18,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:18,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:18,791 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:18,792 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:18,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1907816615] [2022-01-31 23:43:18,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1907816615] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:18,792 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:18,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:43:18,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181307473] [2022-01-31 23:43:18,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:18,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:43:18,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:18,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:43:18,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:43:18,793 INFO L87 Difference]: Start difference. First operand 489 states and 604 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:43:20,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:20,024 INFO L93 Difference]: Finished difference Result 522 states and 642 transitions. [2022-01-31 23:43:20,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:43:20,024 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 63 [2022-01-31 23:43:20,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:20,026 INFO L225 Difference]: With dead ends: 522 [2022-01-31 23:43:20,026 INFO L226 Difference]: Without dead ends: 501 [2022-01-31 23:43:20,026 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:43:20,026 INFO L933 BasicCegarLoop]: 369 mSDtfsCounter, 308 mSDsluCounter, 1298 mSDsCounter, 0 mSdLazyCounter, 2519 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 2620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:20,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [312 Valid, 1667 Invalid, 2620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2519 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 23:43:20,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-01-31 23:43:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 485. [2022-01-31 23:43:20,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 381 states have (on average 1.2388451443569555) internal successors, (472), 388 states have internal predecessors, (472), 59 states have call successors, (59), 42 states have call predecessors, (59), 44 states have return successors, (67), 55 states have call predecessors, (67), 53 states have call successors, (67) [2022-01-31 23:43:20,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 598 transitions. [2022-01-31 23:43:20,160 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 598 transitions. Word has length 63 [2022-01-31 23:43:20,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:20,162 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 598 transitions. [2022-01-31 23:43:20,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:43:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 598 transitions. [2022-01-31 23:43:20,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 23:43:20,163 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:20,163 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:20,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-31 23:43:20,163 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:20,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:20,163 INFO L85 PathProgramCache]: Analyzing trace with hash 2018781837, now seen corresponding path program 1 times [2022-01-31 23:43:20,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:20,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1399899182] [2022-01-31 23:43:20,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:20,164 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:20,166 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:20,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:20,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:20,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:20,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 23:43:20,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:20,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:20,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:20,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:20,393 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:20,393 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:20,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1399899182] [2022-01-31 23:43:20,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1399899182] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:20,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:20,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:43:20,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626093355] [2022-01-31 23:43:20,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:20,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:43:20,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:20,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:43:20,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:43:20,394 INFO L87 Difference]: Start difference. First operand 485 states and 598 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 23:43:21,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:21,441 INFO L93 Difference]: Finished difference Result 746 states and 929 transitions. [2022-01-31 23:43:21,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 23:43:21,441 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 71 [2022-01-31 23:43:21,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:21,443 INFO L225 Difference]: With dead ends: 746 [2022-01-31 23:43:21,443 INFO L226 Difference]: Without dead ends: 520 [2022-01-31 23:43:21,443 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:43:21,444 INFO L933 BasicCegarLoop]: 371 mSDtfsCounter, 552 mSDsluCounter, 981 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:21,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [561 Valid, 1352 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 23:43:21,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-01-31 23:43:21,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 485. [2022-01-31 23:43:21,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 381 states have (on average 1.2335958005249343) internal successors, (470), 388 states have internal predecessors, (470), 59 states have call successors, (59), 42 states have call predecessors, (59), 44 states have return successors, (67), 55 states have call predecessors, (67), 53 states have call successors, (67) [2022-01-31 23:43:21,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 596 transitions. [2022-01-31 23:43:21,567 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 596 transitions. Word has length 71 [2022-01-31 23:43:21,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:21,567 INFO L470 AbstractCegarLoop]: Abstraction has 485 states and 596 transitions. [2022-01-31 23:43:21,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 23:43:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 596 transitions. [2022-01-31 23:43:21,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-31 23:43:21,568 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:21,568 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:21,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-31 23:43:21,568 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:21,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:21,569 INFO L85 PathProgramCache]: Analyzing trace with hash -2107854790, now seen corresponding path program 1 times [2022-01-31 23:43:21,569 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:21,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [865252428] [2022-01-31 23:43:21,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:21,569 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:21,571 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:21,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:21,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:21,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:21,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:43:21,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:21,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 23:43:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:21,765 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:21,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [865252428] [2022-01-31 23:43:21,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [865252428] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:21,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:21,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 23:43:21,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258581159] [2022-01-31 23:43:21,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:21,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 23:43:21,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:21,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 23:43:21,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 23:43:21,768 INFO L87 Difference]: Start difference. First operand 485 states and 596 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:43:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:22,671 INFO L93 Difference]: Finished difference Result 512 states and 627 transitions. [2022-01-31 23:43:22,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:43:22,671 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2022-01-31 23:43:22,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:22,672 INFO L225 Difference]: With dead ends: 512 [2022-01-31 23:43:22,672 INFO L226 Difference]: Without dead ends: 490 [2022-01-31 23:43:22,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:43:22,673 INFO L933 BasicCegarLoop]: 375 mSDtfsCounter, 411 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 1919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:22,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [415 Valid, 1433 Invalid, 1919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1800 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 23:43:22,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-01-31 23:43:22,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 474. [2022-01-31 23:43:22,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 372 states have (on average 1.2311827956989247) internal successors, (458), 379 states have internal predecessors, (458), 58 states have call successors, (58), 42 states have call predecessors, (58), 43 states have return successors, (65), 53 states have call predecessors, (65), 52 states have call successors, (65) [2022-01-31 23:43:22,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 581 transitions. [2022-01-31 23:43:22,763 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 581 transitions. Word has length 64 [2022-01-31 23:43:22,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:22,763 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 581 transitions. [2022-01-31 23:43:22,763 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:43:22,763 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 581 transitions. [2022-01-31 23:43:22,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-31 23:43:22,764 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:22,764 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:22,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-31 23:43:22,765 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:22,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:22,765 INFO L85 PathProgramCache]: Analyzing trace with hash 245569005, now seen corresponding path program 1 times [2022-01-31 23:43:22,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:22,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1346518440] [2022-01-31 23:43:22,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:22,765 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:22,767 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:22,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:22,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:22,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:22,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:22,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:22,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:22,977 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:22,977 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:22,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1346518440] [2022-01-31 23:43:22,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1346518440] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:22,977 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:22,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:43:22,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721422951] [2022-01-31 23:43:22,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:22,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:43:22,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:22,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:43:22,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:43:22,979 INFO L87 Difference]: Start difference. First operand 474 states and 581 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:43:24,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:24,004 INFO L93 Difference]: Finished difference Result 507 states and 619 transitions. [2022-01-31 23:43:24,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:43:24,004 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2022-01-31 23:43:24,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:24,006 INFO L225 Difference]: With dead ends: 507 [2022-01-31 23:43:24,006 INFO L226 Difference]: Without dead ends: 485 [2022-01-31 23:43:24,006 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:43:24,006 INFO L933 BasicCegarLoop]: 367 mSDtfsCounter, 455 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 2090 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 2238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 2090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:24,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 1662 Invalid, 2238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 2090 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 23:43:24,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-01-31 23:43:24,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 469. [2022-01-31 23:43:24,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 368 states have (on average 1.2309782608695652) internal successors, (453), 375 states have internal predecessors, (453), 57 states have call successors, (57), 42 states have call predecessors, (57), 43 states have return successors, (64), 52 states have call predecessors, (64), 51 states have call successors, (64) [2022-01-31 23:43:24,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 574 transitions. [2022-01-31 23:43:24,095 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 574 transitions. Word has length 64 [2022-01-31 23:43:24,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:24,095 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 574 transitions. [2022-01-31 23:43:24,095 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:43:24,095 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 574 transitions. [2022-01-31 23:43:24,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-01-31 23:43:24,096 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:24,096 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:24,096 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-31 23:43:24,096 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:24,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:24,096 INFO L85 PathProgramCache]: Analyzing trace with hash -684542465, now seen corresponding path program 1 times [2022-01-31 23:43:24,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:24,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [719577050] [2022-01-31 23:43:24,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:24,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:24,098 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:24,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:24,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:24,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:24,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:24,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:24,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:24,304 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:24,305 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:24,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [719577050] [2022-01-31 23:43:24,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [719577050] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:24,306 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:24,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:43:24,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348096354] [2022-01-31 23:43:24,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:24,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:43:24,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:24,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:43:24,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:43:24,308 INFO L87 Difference]: Start difference. First operand 469 states and 574 transitions. Second operand has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:43:25,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:25,333 INFO L93 Difference]: Finished difference Result 502 states and 612 transitions. [2022-01-31 23:43:25,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:43:25,334 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 64 [2022-01-31 23:43:25,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:25,336 INFO L225 Difference]: With dead ends: 502 [2022-01-31 23:43:25,336 INFO L226 Difference]: Without dead ends: 481 [2022-01-31 23:43:25,336 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:43:25,337 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 337 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 2138 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 2241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 2138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:25,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [341 Valid, 1554 Invalid, 2241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 2138 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 23:43:25,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-01-31 23:43:25,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 465. [2022-01-31 23:43:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.2301369863013698) internal successors, (449), 372 states have internal predecessors, (449), 56 states have call successors, (56), 42 states have call predecessors, (56), 43 states have return successors, (63), 51 states have call predecessors, (63), 50 states have call successors, (63) [2022-01-31 23:43:25,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 568 transitions. [2022-01-31 23:43:25,427 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 568 transitions. Word has length 64 [2022-01-31 23:43:25,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:25,428 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 568 transitions. [2022-01-31 23:43:25,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7142857142857144) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:43:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 568 transitions. [2022-01-31 23:43:25,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-31 23:43:25,429 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:25,429 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] [2022-01-31 23:43:25,429 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-31 23:43:25,429 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:25,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:25,429 INFO L85 PathProgramCache]: Analyzing trace with hash 387945384, now seen corresponding path program 1 times [2022-01-31 23:43:25,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:25,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [548927734] [2022-01-31 23:43:25,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:25,430 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:25,432 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:25,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:25,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:25,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:25,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:25,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 23:43:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:25,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:25,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:25,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:25,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:25,605 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:25,605 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:25,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [548927734] [2022-01-31 23:43:25,606 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [548927734] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:25,606 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:25,606 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 23:43:25,606 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843880616] [2022-01-31 23:43:25,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:25,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 23:43:25,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:25,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 23:43:25,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-31 23:43:25,607 INFO L87 Difference]: Start difference. First operand 465 states and 568 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 23:43:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:26,418 INFO L93 Difference]: Finished difference Result 878 states and 1082 transitions. [2022-01-31 23:43:26,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 23:43:26,419 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2022-01-31 23:43:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:26,421 INFO L225 Difference]: With dead ends: 878 [2022-01-31 23:43:26,421 INFO L226 Difference]: Without dead ends: 625 [2022-01-31 23:43:26,422 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:43:26,422 INFO L933 BasicCegarLoop]: 408 mSDtfsCounter, 724 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:26,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [736 Valid, 884 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 23:43:26,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-01-31 23:43:26,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 586. [2022-01-31 23:43:26,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 458 states have (on average 1.220524017467249) internal successors, (559), 467 states have internal predecessors, (559), 69 states have call successors, (69), 52 states have call predecessors, (69), 58 states have return successors, (88), 67 states have call predecessors, (88), 64 states have call successors, (88) [2022-01-31 23:43:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 716 transitions. [2022-01-31 23:43:26,544 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 716 transitions. Word has length 73 [2022-01-31 23:43:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:26,545 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 716 transitions. [2022-01-31 23:43:26,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 3 states have internal predecessors, (55), 3 states have call successors, (11), 9 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 23:43:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 716 transitions. [2022-01-31 23:43:26,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 23:43:26,545 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:26,546 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:43:26,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-31 23:43:26,546 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:26,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:26,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1771054254, now seen corresponding path program 1 times [2022-01-31 23:43:26,546 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:26,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1775775727] [2022-01-31 23:43:26,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:26,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:26,548 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:26,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:26,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:26,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:26,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:26,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:26,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:26,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-31 23:43:26,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:26,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:26,745 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:26,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1775775727] [2022-01-31 23:43:26,745 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1775775727] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:26,745 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:26,745 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:43:26,745 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109209063] [2022-01-31 23:43:26,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:26,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:43:26,745 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:26,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:43:26,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:43:26,746 INFO L87 Difference]: Start difference. First operand 586 states and 716 transitions. Second operand has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:43:27,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:27,664 INFO L93 Difference]: Finished difference Result 619 states and 755 transitions. [2022-01-31 23:43:27,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:43:27,667 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 68 [2022-01-31 23:43:27,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:27,669 INFO L225 Difference]: With dead ends: 619 [2022-01-31 23:43:27,669 INFO L226 Difference]: Without dead ends: 576 [2022-01-31 23:43:27,669 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:43:27,670 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 559 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 1856 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 2034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:27,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 1423 Invalid, 2034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1856 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 23:43:27,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2022-01-31 23:43:27,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 560. [2022-01-31 23:43:27,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 437 states have (on average 1.2196796338672768) internal successors, (533), 446 states have internal predecessors, (533), 66 states have call successors, (66), 50 states have call predecessors, (66), 56 states have return successors, (85), 64 states have call predecessors, (85), 61 states have call successors, (85) [2022-01-31 23:43:27,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 684 transitions. [2022-01-31 23:43:27,771 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 684 transitions. Word has length 68 [2022-01-31 23:43:27,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:27,771 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 684 transitions. [2022-01-31 23:43:27,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.0) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 23:43:27,771 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 684 transitions. [2022-01-31 23:43:27,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 23:43:27,771 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:27,772 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:27,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-31 23:43:27,772 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:27,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:27,772 INFO L85 PathProgramCache]: Analyzing trace with hash -699513037, now seen corresponding path program 1 times [2022-01-31 23:43:27,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:27,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1004753465] [2022-01-31 23:43:27,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:27,772 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:27,774 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:27,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:27,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:27,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:27,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:27,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 23:43:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:27,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:43:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:28,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:28,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 23:43:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:28,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:28,019 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:28,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1004753465] [2022-01-31 23:43:28,019 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1004753465] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:28,019 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:28,019 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 23:43:28,019 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445272609] [2022-01-31 23:43:28,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:28,020 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 23:43:28,020 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:28,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 23:43:28,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-01-31 23:43:28,021 INFO L87 Difference]: Start difference. First operand 560 states and 684 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 23:43:29,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:29,297 INFO L93 Difference]: Finished difference Result 589 states and 718 transitions. [2022-01-31 23:43:29,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 23:43:29,297 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 71 [2022-01-31 23:43:29,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:29,299 INFO L225 Difference]: With dead ends: 589 [2022-01-31 23:43:29,299 INFO L226 Difference]: Without dead ends: 535 [2022-01-31 23:43:29,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-01-31 23:43:29,300 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 382 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 2665 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 2772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:29,300 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 902 Invalid, 2772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2665 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 23:43:29,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2022-01-31 23:43:29,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 519. [2022-01-31 23:43:29,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 403 states have (on average 1.2133995037220844) internal successors, (489), 412 states have internal predecessors, (489), 62 states have call successors, (62), 47 states have call predecessors, (62), 53 states have return successors, (81), 60 states have call predecessors, (81), 57 states have call successors, (81) [2022-01-31 23:43:29,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 632 transitions. [2022-01-31 23:43:29,392 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 632 transitions. Word has length 71 [2022-01-31 23:43:29,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:29,393 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 632 transitions. [2022-01-31 23:43:29,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 7 states have internal predecessors, (55), 3 states have call successors, (9), 8 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 23:43:29,393 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 632 transitions. [2022-01-31 23:43:29,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-01-31 23:43:29,393 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:29,394 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:29,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-31 23:43:29,394 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:29,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:29,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1796970753, now seen corresponding path program 1 times [2022-01-31 23:43:29,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:29,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1998124079] [2022-01-31 23:43:29,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:29,395 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:29,398 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:29,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:29,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:29,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:29,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:29,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:29,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 23:43:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:29,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:29,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:29,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:29,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:29,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 23:43:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:29,565 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:29,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1998124079] [2022-01-31 23:43:29,565 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1998124079] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:29,565 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:29,565 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 23:43:29,565 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556033954] [2022-01-31 23:43:29,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:29,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 23:43:29,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:29,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 23:43:29,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-01-31 23:43:29,566 INFO L87 Difference]: Start difference. First operand 519 states and 632 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 23:43:30,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:30,451 INFO L93 Difference]: Finished difference Result 840 states and 1028 transitions. [2022-01-31 23:43:30,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 23:43:30,452 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 82 [2022-01-31 23:43:30,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:30,453 INFO L225 Difference]: With dead ends: 840 [2022-01-31 23:43:30,453 INFO L226 Difference]: Without dead ends: 523 [2022-01-31 23:43:30,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2022-01-31 23:43:30,454 INFO L933 BasicCegarLoop]: 388 mSDtfsCounter, 389 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:30,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [396 Valid, 1142 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 23:43:30,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-01-31 23:43:30,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 501. [2022-01-31 23:43:30,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 389 states have (on average 1.2133676092544987) internal successors, (472), 397 states have internal predecessors, (472), 60 states have call successors, (60), 47 states have call predecessors, (60), 51 states have return successors, (70), 57 states have call predecessors, (70), 55 states have call successors, (70) [2022-01-31 23:43:30,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 602 transitions. [2022-01-31 23:43:30,560 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 602 transitions. Word has length 82 [2022-01-31 23:43:30,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:30,560 INFO L470 AbstractCegarLoop]: Abstraction has 501 states and 602 transitions. [2022-01-31 23:43:30,560 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 23:43:30,561 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 602 transitions. [2022-01-31 23:43:30,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-31 23:43:30,561 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:30,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, 1, 1, 1, 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:30,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-31 23:43:30,561 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:30,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:30,562 INFO L85 PathProgramCache]: Analyzing trace with hash -2026941125, now seen corresponding path program 1 times [2022-01-31 23:43:30,562 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:30,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [376710037] [2022-01-31 23:43:30,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:30,562 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:30,564 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:30,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:30,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:30,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:30,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 23:43:30,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:30,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:30,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:30,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:30,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:30,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-31 23:43:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:30,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:30,785 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:30,785 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:30,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [376710037] [2022-01-31 23:43:30,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [376710037] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:30,785 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:30,785 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:43:30,785 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508833999] [2022-01-31 23:43:30,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:30,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:43:30,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:30,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:43:30,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:43:30,786 INFO L87 Difference]: Start difference. First operand 501 states and 602 transitions. Second operand has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 23:43:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:31,668 INFO L93 Difference]: Finished difference Result 839 states and 1046 transitions. [2022-01-31 23:43:31,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 23:43:31,669 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2022-01-31 23:43:31,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:31,670 INFO L225 Difference]: With dead ends: 839 [2022-01-31 23:43:31,670 INFO L226 Difference]: Without dead ends: 585 [2022-01-31 23:43:31,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-01-31 23:43:31,671 INFO L933 BasicCegarLoop]: 339 mSDtfsCounter, 526 mSDsluCounter, 1087 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:31,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [537 Valid, 1426 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 23:43:31,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-01-31 23:43:31,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 465. [2022-01-31 23:43:31,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.2136986301369863) internal successors, (443), 371 states have internal predecessors, (443), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (60), 53 states have call predecessors, (60), 49 states have call successors, (60) [2022-01-31 23:43:31,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 556 transitions. [2022-01-31 23:43:31,766 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 556 transitions. Word has length 83 [2022-01-31 23:43:31,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:31,767 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 556 transitions. [2022-01-31 23:43:31,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.285714285714286) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 23:43:31,767 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 556 transitions. [2022-01-31 23:43:31,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-01-31 23:43:31,767 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:31,768 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:31,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-31 23:43:31,768 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:31,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:31,768 INFO L85 PathProgramCache]: Analyzing trace with hash -564339607, now seen corresponding path program 1 times [2022-01-31 23:43:31,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:31,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1352862069] [2022-01-31 23:43:31,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:31,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:31,770 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:31,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:31,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:31,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:31,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:31,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:31,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:31,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:31,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:32,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:32,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 23:43:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:32,008 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:32,009 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:32,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1352862069] [2022-01-31 23:43:32,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1352862069] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:32,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:32,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 23:43:32,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318053227] [2022-01-31 23:43:32,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:32,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 23:43:32,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:32,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 23:43:32,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:43:32,010 INFO L87 Difference]: Start difference. First operand 465 states and 556 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 23:43:33,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:33,012 INFO L93 Difference]: Finished difference Result 526 states and 629 transitions. [2022-01-31 23:43:33,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 23:43:33,013 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 88 [2022-01-31 23:43:33,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:33,014 INFO L225 Difference]: With dead ends: 526 [2022-01-31 23:43:33,014 INFO L226 Difference]: Without dead ends: 505 [2022-01-31 23:43:33,015 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2022-01-31 23:43:33,015 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 359 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1564 SdHoareTripleChecker+Invalid, 1722 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:33,015 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [367 Valid, 1564 Invalid, 1722 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 23:43:33,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-01-31 23:43:33,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 473. [2022-01-31 23:43:33,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 372 states have (on average 1.2096774193548387) internal successors, (450), 378 states have internal predecessors, (450), 53 states have call successors, (53), 41 states have call predecessors, (53), 47 states have return successors, (63), 54 states have call predecessors, (63), 49 states have call successors, (63) [2022-01-31 23:43:33,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 566 transitions. [2022-01-31 23:43:33,107 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 566 transitions. Word has length 88 [2022-01-31 23:43:33,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:33,107 INFO L470 AbstractCegarLoop]: Abstraction has 473 states and 566 transitions. [2022-01-31 23:43:33,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 23:43:33,107 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 566 transitions. [2022-01-31 23:43:33,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-01-31 23:43:33,108 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:33,108 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:33,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-31 23:43:33,109 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:33,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:33,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1551103562, now seen corresponding path program 1 times [2022-01-31 23:43:33,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:33,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2054138464] [2022-01-31 23:43:33,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:33,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:33,111 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:33,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:33,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:33,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:33,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:33,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:33,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:33,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:33,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:33,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:33,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-31 23:43:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:33,337 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:33,337 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:33,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2054138464] [2022-01-31 23:43:33,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2054138464] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:33,338 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:33,338 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 23:43:33,338 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392810980] [2022-01-31 23:43:33,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:33,338 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 23:43:33,338 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:33,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 23:43:33,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:43:33,339 INFO L87 Difference]: Start difference. First operand 473 states and 566 transitions. Second operand has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 23:43:34,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:34,230 INFO L93 Difference]: Finished difference Result 526 states and 628 transitions. [2022-01-31 23:43:34,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 23:43:34,231 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 89 [2022-01-31 23:43:34,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:34,233 INFO L225 Difference]: With dead ends: 526 [2022-01-31 23:43:34,233 INFO L226 Difference]: Without dead ends: 505 [2022-01-31 23:43:34,233 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:43:34,233 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 409 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1579 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 1731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:34,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [413 Valid, 1709 Invalid, 1731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1579 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 23:43:34,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-01-31 23:43:34,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 465. [2022-01-31 23:43:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 365 states have (on average 1.210958904109589) internal successors, (442), 371 states have internal predecessors, (442), 53 states have call successors, (53), 41 states have call predecessors, (53), 46 states have return successors, (60), 53 states have call predecessors, (60), 49 states have call successors, (60) [2022-01-31 23:43:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 555 transitions. [2022-01-31 23:43:34,331 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 555 transitions. Word has length 89 [2022-01-31 23:43:34,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:34,331 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 555 transitions. [2022-01-31 23:43:34,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.3125) internal successors, (69), 7 states have internal predecessors, (69), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 23:43:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 555 transitions. [2022-01-31 23:43:34,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-01-31 23:43:34,332 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:34,332 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:34,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-31 23:43:34,332 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:34,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:34,332 INFO L85 PathProgramCache]: Analyzing trace with hash 945867422, now seen corresponding path program 1 times [2022-01-31 23:43:34,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:34,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [911535638] [2022-01-31 23:43:34,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:34,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:34,334 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:34,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:34,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:34,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:34,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:34,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:34,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 23:43:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:34,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:34,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:34,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 23:43:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:34,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 23:43:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:34,521 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:34,521 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:34,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [911535638] [2022-01-31 23:43:34,521 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [911535638] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:34,521 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:34,521 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 23:43:34,521 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529259797] [2022-01-31 23:43:34,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:34,522 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 23:43:34,522 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:34,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 23:43:34,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-31 23:43:34,522 INFO L87 Difference]: Start difference. First operand 465 states and 555 transitions. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-31 23:43:35,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:35,572 INFO L93 Difference]: Finished difference Result 910 states and 1073 transitions. [2022-01-31 23:43:35,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 23:43:35,573 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 92 [2022-01-31 23:43:35,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:35,575 INFO L225 Difference]: With dead ends: 910 [2022-01-31 23:43:35,575 INFO L226 Difference]: Without dead ends: 611 [2022-01-31 23:43:35,576 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2022-01-31 23:43:35,576 INFO L933 BasicCegarLoop]: 318 mSDtfsCounter, 708 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:35,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [715 Valid, 542 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 23:43:35,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-01-31 23:43:35,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 586. [2022-01-31 23:43:35,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 462 states have (on average 1.2034632034632036) internal successors, (556), 470 states have internal predecessors, (556), 61 states have call successors, (61), 53 states have call predecessors, (61), 62 states have return successors, (72), 63 states have call predecessors, (72), 57 states have call successors, (72) [2022-01-31 23:43:35,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 689 transitions. [2022-01-31 23:43:35,704 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 689 transitions. Word has length 92 [2022-01-31 23:43:35,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:35,705 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 689 transitions. [2022-01-31 23:43:35,705 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 5 states have internal predecessors, (74), 5 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-31 23:43:35,705 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 689 transitions. [2022-01-31 23:43:35,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-01-31 23:43:35,706 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:35,706 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-31 23:43:35,706 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:35,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:35,706 INFO L85 PathProgramCache]: Analyzing trace with hash 680283571, now seen corresponding path program 1 times [2022-01-31 23:43:35,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:35,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [615338999] [2022-01-31 23:43:35,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:35,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:35,708 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:35,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:35,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:35,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:35,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:35,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:35,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:35,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:35,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 23:43:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:35,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:35,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 23:43:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:35,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 23:43:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:35,926 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:35,927 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:35,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [615338999] [2022-01-31 23:43:35,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [615338999] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:35,927 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:35,927 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 23:43:35,927 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307854194] [2022-01-31 23:43:35,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:35,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 23:43:35,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:35,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 23:43:35,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:43:35,928 INFO L87 Difference]: Start difference. First operand 586 states and 689 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-31 23:43:37,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:37,028 INFO L93 Difference]: Finished difference Result 590 states and 692 transitions. [2022-01-31 23:43:37,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 23:43:37,029 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) Word has length 93 [2022-01-31 23:43:37,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:37,030 INFO L225 Difference]: With dead ends: 590 [2022-01-31 23:43:37,030 INFO L226 Difference]: Without dead ends: 498 [2022-01-31 23:43:37,031 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:37,031 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 306 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 2287 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 2379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 2287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:37,031 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 644 Invalid, 2379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 2287 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 23:43:37,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2022-01-31 23:43:37,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 496. [2022-01-31 23:43:37,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.20671834625323) internal successors, (467), 394 states have internal predecessors, (467), 54 states have call successors, (54), 47 states have call predecessors, (54), 54 states have return successors, (64), 55 states have call predecessors, (64), 51 states have call successors, (64) [2022-01-31 23:43:37,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 585 transitions. [2022-01-31 23:43:37,128 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 585 transitions. Word has length 93 [2022-01-31 23:43:37,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:37,128 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 585 transitions. [2022-01-31 23:43:37,129 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 7 states have internal predecessors, (75), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-31 23:43:37,129 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 585 transitions. [2022-01-31 23:43:37,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-31 23:43:37,129 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:37,129 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:37,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-31 23:43:37,129 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:37,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:37,130 INFO L85 PathProgramCache]: Analyzing trace with hash 313967105, now seen corresponding path program 1 times [2022-01-31 23:43:37,130 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:37,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1371207464] [2022-01-31 23:43:37,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:37,130 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:37,132 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:37,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:37,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:37,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:37,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:37,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:37,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:37,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:37,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:37,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:37,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 23:43:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:37,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-31 23:43:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:37,345 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:37,345 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:37,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1371207464] [2022-01-31 23:43:37,345 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1371207464] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:37,345 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:37,345 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:43:37,345 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498966844] [2022-01-31 23:43:37,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:37,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:43:37,346 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:37,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:43:37,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:43:37,347 INFO L87 Difference]: Start difference. First operand 496 states and 585 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-31 23:43:38,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:38,011 INFO L93 Difference]: Finished difference Result 531 states and 619 transitions. [2022-01-31 23:43:38,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 23:43:38,011 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 99 [2022-01-31 23:43:38,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:38,012 INFO L225 Difference]: With dead ends: 531 [2022-01-31 23:43:38,012 INFO L226 Difference]: Without dead ends: 492 [2022-01-31 23:43:38,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-01-31 23:43:38,013 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 187 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:38,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 930 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 23:43:38,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-01-31 23:43:38,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 439. [2022-01-31 23:43:38,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 343 states have (on average 1.19533527696793) internal successors, (410), 349 states have internal predecessors, (410), 47 states have call successors, (47), 42 states have call predecessors, (47), 48 states have return successors, (55), 48 states have call predecessors, (55), 44 states have call successors, (55) [2022-01-31 23:43:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 512 transitions. [2022-01-31 23:43:38,099 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 512 transitions. Word has length 99 [2022-01-31 23:43:38,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:38,100 INFO L470 AbstractCegarLoop]: Abstraction has 439 states and 512 transitions. [2022-01-31 23:43:38,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 5 states have internal predecessors, (77), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-31 23:43:38,100 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 512 transitions. [2022-01-31 23:43:38,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-31 23:43:38,100 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:38,100 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:38,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-31 23:43:38,101 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:38,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:38,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1018925480, now seen corresponding path program 1 times [2022-01-31 23:43:38,101 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:38,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1497218395] [2022-01-31 23:43:38,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:38,101 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:38,102 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:38,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:38,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:38,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:38,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:38,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:38,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:38,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:38,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:38,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:38,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:38,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:38,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:38,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 23:43:38,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:38,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-31 23:43:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:38,372 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:38,372 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:38,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1497218395] [2022-01-31 23:43:38,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1497218395] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:38,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:38,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 23:43:38,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419186290] [2022-01-31 23:43:38,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:38,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 23:43:38,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:38,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 23:43:38,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-01-31 23:43:38,373 INFO L87 Difference]: Start difference. First operand 439 states and 512 transitions. Second operand has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-31 23:43:39,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:39,309 INFO L93 Difference]: Finished difference Result 842 states and 986 transitions. [2022-01-31 23:43:39,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 23:43:39,310 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 99 [2022-01-31 23:43:39,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:39,313 INFO L225 Difference]: With dead ends: 842 [2022-01-31 23:43:39,313 INFO L226 Difference]: Without dead ends: 797 [2022-01-31 23:43:39,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=589, Unknown=0, NotChecked=0, Total=756 [2022-01-31 23:43:39,314 INFO L933 BasicCegarLoop]: 348 mSDtfsCounter, 579 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:39,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [588 Valid, 1614 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 23:43:39,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2022-01-31 23:43:39,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 419. [2022-01-31 23:43:39,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 327 states have (on average 1.1957186544342508) internal successors, (391), 332 states have internal predecessors, (391), 44 states have call successors, (44), 41 states have call predecessors, (44), 47 states have return successors, (52), 45 states have call predecessors, (52), 41 states have call successors, (52) [2022-01-31 23:43:39,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 487 transitions. [2022-01-31 23:43:39,460 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 487 transitions. Word has length 99 [2022-01-31 23:43:39,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:39,460 INFO L470 AbstractCegarLoop]: Abstraction has 419 states and 487 transitions. [2022-01-31 23:43:39,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 6 states have internal predecessors, (77), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-31 23:43:39,460 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 487 transitions. [2022-01-31 23:43:39,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-01-31 23:43:39,461 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:39,461 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:39,461 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-01-31 23:43:39,461 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:39,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:39,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1434876468, now seen corresponding path program 1 times [2022-01-31 23:43:39,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:39,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1597756077] [2022-01-31 23:43:39,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:39,462 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:39,464 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:39,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:39,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:39,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:39,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:39,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:39,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:39,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:43:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:39,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:39,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:39,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:39,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:39,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 23:43:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:39,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:39,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 23:43:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:39,793 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:39,793 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:39,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1597756077] [2022-01-31 23:43:39,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1597756077] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:39,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:39,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 23:43:39,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769396513] [2022-01-31 23:43:39,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:39,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 23:43:39,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:39,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 23:43:39,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-01-31 23:43:39,795 INFO L87 Difference]: Start difference. First operand 419 states and 487 transitions. Second operand has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2022-01-31 23:43:40,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:40,758 INFO L93 Difference]: Finished difference Result 561 states and 656 transitions. [2022-01-31 23:43:40,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 23:43:40,758 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 104 [2022-01-31 23:43:40,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:40,760 INFO L225 Difference]: With dead ends: 561 [2022-01-31 23:43:40,760 INFO L226 Difference]: Without dead ends: 438 [2022-01-31 23:43:40,761 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:40,761 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 134 mSDsluCounter, 964 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1143 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:40,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 1143 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 23:43:40,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-01-31 23:43:40,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 428. [2022-01-31 23:43:40,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 335 states have (on average 1.182089552238806) internal successors, (396), 341 states have internal predecessors, (396), 45 states have call successors, (45), 41 states have call predecessors, (45), 47 states have return successors, (52), 45 states have call predecessors, (52), 41 states have call successors, (52) [2022-01-31 23:43:40,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 493 transitions. [2022-01-31 23:43:40,924 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 493 transitions. Word has length 104 [2022-01-31 23:43:40,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:40,925 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 493 transitions. [2022-01-31 23:43:40,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.105263157894737) internal successors, (78), 7 states have internal predecessors, (78), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2022-01-31 23:43:40,925 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 493 transitions. [2022-01-31 23:43:40,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-31 23:43:40,926 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:40,926 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:40,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-01-31 23:43:40,926 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:40,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:40,927 INFO L85 PathProgramCache]: Analyzing trace with hash -679170353, now seen corresponding path program 1 times [2022-01-31 23:43:40,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:40,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1267869227] [2022-01-31 23:43:40,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:40,928 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:40,929 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 23:43:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:41,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-31 23:43:41,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:43:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:41,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,122 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:41,122 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:41,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1267869227] [2022-01-31 23:43:41,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1267869227] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:41,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:41,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 23:43:41,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296719782] [2022-01-31 23:43:41,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:41,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 23:43:41,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:41,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 23:43:41,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-01-31 23:43:41,124 INFO L87 Difference]: Start difference. First operand 428 states and 493 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-31 23:43:41,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:41,611 INFO L93 Difference]: Finished difference Result 749 states and 870 transitions. [2022-01-31 23:43:41,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 23:43:41,615 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 113 [2022-01-31 23:43:41,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:41,617 INFO L225 Difference]: With dead ends: 749 [2022-01-31 23:43:41,617 INFO L226 Difference]: Without dead ends: 440 [2022-01-31 23:43:41,618 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2022-01-31 23:43:41,618 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 181 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:41,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 765 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 23:43:41,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2022-01-31 23:43:41,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 436. [2022-01-31 23:43:41,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 341 states have (on average 1.1788856304985338) internal successors, (402), 347 states have internal predecessors, (402), 45 states have call successors, (45), 41 states have call predecessors, (45), 49 states have return successors, (54), 47 states have call predecessors, (54), 41 states have call successors, (54) [2022-01-31 23:43:41,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 501 transitions. [2022-01-31 23:43:41,730 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 501 transitions. Word has length 113 [2022-01-31 23:43:41,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:41,730 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 501 transitions. [2022-01-31 23:43:41,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-31 23:43:41,730 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 501 transitions. [2022-01-31 23:43:41,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-01-31 23:43:41,731 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:41,731 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:41,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-01-31 23:43:41,731 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:41,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:41,732 INFO L85 PathProgramCache]: Analyzing trace with hash 857265326, now seen corresponding path program 1 times [2022-01-31 23:43:41,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:41,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2059634923] [2022-01-31 23:43:41,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:41,732 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:41,733 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:41,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:41,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 23:43:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-31 23:43:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:41,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:43:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:41,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:41,971 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:41,971 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:41,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2059634923] [2022-01-31 23:43:41,971 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2059634923] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:41,971 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:41,971 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 23:43:41,972 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922611253] [2022-01-31 23:43:41,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:41,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 23:43:41,972 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:41,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 23:43:41,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-01-31 23:43:41,972 INFO L87 Difference]: Start difference. First operand 436 states and 501 transitions. Second operand has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-31 23:43:42,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:42,557 INFO L93 Difference]: Finished difference Result 471 states and 535 transitions. [2022-01-31 23:43:42,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 23:43:42,557 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) Word has length 113 [2022-01-31 23:43:42,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:42,558 INFO L225 Difference]: With dead ends: 471 [2022-01-31 23:43:42,558 INFO L226 Difference]: Without dead ends: 387 [2022-01-31 23:43:42,558 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:42,559 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 156 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:42,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 892 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 23:43:42,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-01-31 23:43:42,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 249. [2022-01-31 23:43:42,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 195 states have (on average 1.1384615384615384) internal successors, (222), 197 states have internal predecessors, (222), 26 states have call successors, (26), 26 states have call predecessors, (26), 27 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2022-01-31 23:43:42,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 275 transitions. [2022-01-31 23:43:42,633 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 275 transitions. Word has length 113 [2022-01-31 23:43:42,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:42,633 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 275 transitions. [2022-01-31 23:43:42,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.0) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-31 23:43:42,634 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 275 transitions. [2022-01-31 23:43:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-31 23:43:42,634 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:42,634 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:42,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-01-31 23:43:42,634 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:42,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:42,635 INFO L85 PathProgramCache]: Analyzing trace with hash 2021247887, now seen corresponding path program 1 times [2022-01-31 23:43:42,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:42,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1196114259] [2022-01-31 23:43:42,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:42,635 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:42,636 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:42,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:42,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:42,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:42,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:42,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:43:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:42,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:42,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:42,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:42,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:42,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 23:43:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:42,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:42,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 23:43:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:42,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 23:43:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:42,868 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:42,868 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:42,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1196114259] [2022-01-31 23:43:42,868 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1196114259] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:42,868 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:42,868 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 23:43:42,868 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593289003] [2022-01-31 23:43:42,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:42,868 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 23:43:42,868 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:42,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 23:43:42,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-01-31 23:43:42,869 INFO L87 Difference]: Start difference. First operand 249 states and 275 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 23:43:43,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:43,396 INFO L93 Difference]: Finished difference Result 293 states and 322 transitions. [2022-01-31 23:43:43,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 23:43:43,396 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2022-01-31 23:43:43,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:43,397 INFO L225 Difference]: With dead ends: 293 [2022-01-31 23:43:43,397 INFO L226 Difference]: Without dead ends: 263 [2022-01-31 23:43:43,398 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:43,398 INFO L933 BasicCegarLoop]: 175 mSDtfsCounter, 250 mSDsluCounter, 583 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:43,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 758 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 23:43:43,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-01-31 23:43:43,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 253. [2022-01-31 23:43:43,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 198 states have (on average 1.1363636363636365) internal successors, (225), 200 states have internal predecessors, (225), 26 states have call successors, (26), 26 states have call predecessors, (26), 28 states have return successors, (28), 26 states have call predecessors, (28), 24 states have call successors, (28) [2022-01-31 23:43:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 279 transitions. [2022-01-31 23:43:43,488 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 279 transitions. Word has length 120 [2022-01-31 23:43:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:43,489 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 279 transitions. [2022-01-31 23:43:43,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 23:43:43,489 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 279 transitions. [2022-01-31 23:43:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-01-31 23:43:43,489 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:43,489 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:43,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-01-31 23:43:43,489 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:43,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:43,490 INFO L85 PathProgramCache]: Analyzing trace with hash -2092232912, now seen corresponding path program 1 times [2022-01-31 23:43:43,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:43,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [441675625] [2022-01-31 23:43:43,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:43,490 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:43,492 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:43,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:43,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:43,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:43,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:43,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:43,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:43,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:43:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:43,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:43,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:43,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:43,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:43,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:43,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:43,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 23:43:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:43,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:43,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 23:43:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:43,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 23:43:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:43,728 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:43,728 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:43,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [441675625] [2022-01-31 23:43:43,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [441675625] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:43,728 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:43,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 23:43:43,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615487990] [2022-01-31 23:43:43,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:43,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 23:43:43,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:43,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 23:43:43,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-01-31 23:43:43,729 INFO L87 Difference]: Start difference. First operand 253 states and 279 transitions. Second operand has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 23:43:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:44,221 INFO L93 Difference]: Finished difference Result 339 states and 377 transitions. [2022-01-31 23:43:44,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 23:43:44,221 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2022-01-31 23:43:44,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:44,222 INFO L225 Difference]: With dead ends: 339 [2022-01-31 23:43:44,222 INFO L226 Difference]: Without dead ends: 254 [2022-01-31 23:43:44,223 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:44,223 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 241 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:44,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 751 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 23:43:44,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-01-31 23:43:44,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2022-01-31 23:43:44,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 194 states have (on average 1.1288659793814433) internal successors, (219), 196 states have internal predecessors, (219), 26 states have call successors, (26), 26 states have call predecessors, (26), 27 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2022-01-31 23:43:44,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 272 transitions. [2022-01-31 23:43:44,297 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 272 transitions. Word has length 120 [2022-01-31 23:43:44,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:44,297 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 272 transitions. [2022-01-31 23:43:44,297 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.133333333333334) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 23:43:44,297 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 272 transitions. [2022-01-31 23:43:44,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-31 23:43:44,298 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:44,298 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:44,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-01-31 23:43:44,298 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:44,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:44,298 INFO L85 PathProgramCache]: Analyzing trace with hash 90302461, now seen corresponding path program 1 times [2022-01-31 23:43:44,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:44,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [438043202] [2022-01-31 23:43:44,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:44,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:44,300 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:44,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:44,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:44,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:44,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:44,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:44,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:44,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:43:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:44,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:44,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:44,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:44,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:44,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:44,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 23:43:44,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:44,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:44,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:43:44,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:44,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:44,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:44,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:44,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:44,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 23:43:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:44,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-31 23:43:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:44,729 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:44,729 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:44,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [438043202] [2022-01-31 23:43:44,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [438043202] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:44,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:44,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 23:43:44,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270922584] [2022-01-31 23:43:44,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:44,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 23:43:44,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:44,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 23:43:44,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2022-01-31 23:43:44,730 INFO L87 Difference]: Start difference. First operand 248 states and 272 transitions. Second operand has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 23:43:45,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:45,702 INFO L93 Difference]: Finished difference Result 320 states and 360 transitions. [2022-01-31 23:43:45,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 23:43:45,702 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 150 [2022-01-31 23:43:45,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:45,713 INFO L225 Difference]: With dead ends: 320 [2022-01-31 23:43:45,713 INFO L226 Difference]: Without dead ends: 285 [2022-01-31 23:43:45,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 23:43:45,714 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 194 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 1933 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1498 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:45,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 1498 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1933 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 23:43:45,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-01-31 23:43:45,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 265. [2022-01-31 23:43:45,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 209 states have (on average 1.138755980861244) internal successors, (238), 211 states have internal predecessors, (238), 26 states have call successors, (26), 26 states have call predecessors, (26), 29 states have return successors, (29), 27 states have call predecessors, (29), 24 states have call successors, (29) [2022-01-31 23:43:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 293 transitions. [2022-01-31 23:43:45,783 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 293 transitions. Word has length 150 [2022-01-31 23:43:45,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:45,783 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 293 transitions. [2022-01-31 23:43:45,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.04) internal successors, (101), 11 states have internal predecessors, (101), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 23:43:45,783 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 293 transitions. [2022-01-31 23:43:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-01-31 23:43:45,784 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:45,784 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:45,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-01-31 23:43:45,785 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:45,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:45,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1191115682, now seen corresponding path program 1 times [2022-01-31 23:43:45,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:45,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1322149507] [2022-01-31 23:43:45,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:45,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:45,788 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:45,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:45,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:45,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:45,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:45,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:45,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:43:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:45,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:45,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:45,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:46,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:46,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 23:43:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:46,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:46,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:43:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:46,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:46,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:46,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:46,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:46,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-31 23:43:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:46,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-31 23:43:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:46,090 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:46,090 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:46,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1322149507] [2022-01-31 23:43:46,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1322149507] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:46,090 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:46,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 23:43:46,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19558550] [2022-01-31 23:43:46,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:46,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 23:43:46,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:46,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 23:43:46,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-01-31 23:43:46,091 INFO L87 Difference]: Start difference. First operand 265 states and 293 transitions. Second operand has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 23:43:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:46,731 INFO L93 Difference]: Finished difference Result 360 states and 402 transitions. [2022-01-31 23:43:46,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 23:43:46,731 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) Word has length 151 [2022-01-31 23:43:46,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:46,732 INFO L225 Difference]: With dead ends: 360 [2022-01-31 23:43:46,732 INFO L226 Difference]: Without dead ends: 279 [2022-01-31 23:43:46,733 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2022-01-31 23:43:46,733 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 244 mSDsluCounter, 933 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:46,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 1117 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 23:43:46,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-01-31 23:43:46,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 265. [2022-01-31 23:43:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 209 states have (on average 1.1339712918660287) internal successors, (237), 211 states have internal predecessors, (237), 26 states have call successors, (26), 26 states have call predecessors, (26), 29 states have return successors, (29), 27 states have call predecessors, (29), 24 states have call successors, (29) [2022-01-31 23:43:46,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 292 transitions. [2022-01-31 23:43:46,829 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 292 transitions. Word has length 151 [2022-01-31 23:43:46,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:46,829 INFO L470 AbstractCegarLoop]: Abstraction has 265 states and 292 transitions. [2022-01-31 23:43:46,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.421052631578948) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (16), 12 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 23:43:46,829 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 292 transitions. [2022-01-31 23:43:46,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-01-31 23:43:46,830 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:46,830 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:46,830 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-01-31 23:43:46,830 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:46,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:46,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1843438784, now seen corresponding path program 1 times [2022-01-31 23:43:46,831 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:46,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [508743726] [2022-01-31 23:43:46,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:46,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:46,833 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:46,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:46,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:46,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:46,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:46,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:47,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:43:47,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:47,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:47,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:47,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:47,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:47,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 23:43:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:47,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:47,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:43:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:47,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:47,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:47,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:47,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:47,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-01-31 23:43:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:47,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-01-31 23:43:47,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:47,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-31 23:43:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:47,188 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:47,188 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:47,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [508743726] [2022-01-31 23:43:47,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [508743726] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:47,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:47,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 23:43:47,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952499057] [2022-01-31 23:43:47,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:47,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 23:43:47,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:47,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 23:43:47,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2022-01-31 23:43:47,189 INFO L87 Difference]: Start difference. First operand 265 states and 292 transitions. Second operand has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-31 23:43:48,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:48,002 INFO L93 Difference]: Finished difference Result 306 states and 340 transitions. [2022-01-31 23:43:48,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 23:43:48,002 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) Word has length 153 [2022-01-31 23:43:48,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:48,004 INFO L225 Difference]: With dead ends: 306 [2022-01-31 23:43:48,004 INFO L226 Difference]: Without dead ends: 265 [2022-01-31 23:43:48,004 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:48,004 INFO L933 BasicCegarLoop]: 165 mSDtfsCounter, 194 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:48,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 1121 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 23:43:48,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-01-31 23:43:48,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2022-01-31 23:43:48,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 205 states have (on average 1.1219512195121952) internal successors, (230), 207 states have internal predecessors, (230), 25 states have call successors, (25), 25 states have call predecessors, (25), 28 states have return successors, (28), 26 states have call predecessors, (28), 23 states have call successors, (28) [2022-01-31 23:43:48,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 283 transitions. [2022-01-31 23:43:48,075 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 283 transitions. Word has length 153 [2022-01-31 23:43:48,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:48,075 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 283 transitions. [2022-01-31 23:43:48,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.571428571428571) internal successors, (96), 8 states have internal predecessors, (96), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-31 23:43:48,075 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 283 transitions. [2022-01-31 23:43:48,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-31 23:43:48,076 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:48,076 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:48,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-01-31 23:43:48,077 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:48,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:48,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2010865059, now seen corresponding path program 1 times [2022-01-31 23:43:48,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:48,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2002346685] [2022-01-31 23:43:48,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:48,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:48,079 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:48,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:48,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:48,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:48,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:48,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:43:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:48,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:48,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:48,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:48,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:48,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:48,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:48,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:48,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 23:43:48,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:48,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:48,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:43:48,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:48,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:48,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:48,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:48,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 23:43:48,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:48,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 23:43:48,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:48,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-01-31 23:43:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:48,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 23:43:48,356 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:48,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2002346685] [2022-01-31 23:43:48,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2002346685] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:48,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:48,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 23:43:48,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898954866] [2022-01-31 23:43:48,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:48,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 23:43:48,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:48,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 23:43:48,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-01-31 23:43:48,358 INFO L87 Difference]: Start difference. First operand 259 states and 283 transitions. Second operand has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-01-31 23:43:48,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:48,865 INFO L93 Difference]: Finished difference Result 320 states and 349 transitions. [2022-01-31 23:43:48,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 23:43:48,866 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 158 [2022-01-31 23:43:48,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:48,867 INFO L225 Difference]: With dead ends: 320 [2022-01-31 23:43:48,867 INFO L226 Difference]: Without dead ends: 245 [2022-01-31 23:43:48,867 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2022-01-31 23:43:48,867 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 349 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:48,867 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [351 Valid, 498 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 23:43:48,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-01-31 23:43:48,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 231. [2022-01-31 23:43:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 181 states have (on average 1.1049723756906078) internal successors, (200), 183 states have internal predecessors, (200), 24 states have call successors, (24), 24 states have call predecessors, (24), 25 states have return successors, (25), 23 states have call predecessors, (25), 22 states have call successors, (25) [2022-01-31 23:43:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 249 transitions. [2022-01-31 23:43:48,929 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 249 transitions. Word has length 158 [2022-01-31 23:43:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:48,929 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 249 transitions. [2022-01-31 23:43:48,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 5 states have internal predecessors, (101), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-01-31 23:43:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 249 transitions. [2022-01-31 23:43:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-01-31 23:43:48,930 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:48,930 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:48,930 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-01-31 23:43:48,930 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:48,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:48,930 INFO L85 PathProgramCache]: Analyzing trace with hash 473656636, now seen corresponding path program 1 times [2022-01-31 23:43:48,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:48,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [362782207] [2022-01-31 23:43:48,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:48,931 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:48,932 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:49,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:43:49,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:49,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 23:43:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:43:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:49,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 23:43:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-31 23:43:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-31 23:43:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,227 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:49,228 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:49,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [362782207] [2022-01-31 23:43:49,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [362782207] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:49,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:49,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 23:43:49,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303561693] [2022-01-31 23:43:49,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:49,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 23:43:49,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:49,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 23:43:49,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-01-31 23:43:49,232 INFO L87 Difference]: Start difference. First operand 231 states and 249 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-31 23:43:49,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:49,646 INFO L93 Difference]: Finished difference Result 296 states and 320 transitions. [2022-01-31 23:43:49,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 23:43:49,647 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 160 [2022-01-31 23:43:49,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:49,648 INFO L225 Difference]: With dead ends: 296 [2022-01-31 23:43:49,648 INFO L226 Difference]: Without dead ends: 210 [2022-01-31 23:43:49,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2022-01-31 23:43:49,648 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 150 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:49,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 683 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 23:43:49,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-01-31 23:43:49,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-01-31 23:43:49,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 163 states have (on average 1.0920245398773005) internal successors, (178), 164 states have internal predecessors, (178), 23 states have call successors, (23), 23 states have call predecessors, (23), 23 states have return successors, (23), 22 states have call predecessors, (23), 21 states have call successors, (23) [2022-01-31 23:43:49,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 224 transitions. [2022-01-31 23:43:49,712 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 224 transitions. Word has length 160 [2022-01-31 23:43:49,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:49,713 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 224 transitions. [2022-01-31 23:43:49,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-31 23:43:49,713 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 224 transitions. [2022-01-31 23:43:49,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-31 23:43:49,713 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:49,714 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:49,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-01-31 23:43:49,714 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:49,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:49,714 INFO L85 PathProgramCache]: Analyzing trace with hash -155521920, now seen corresponding path program 1 times [2022-01-31 23:43:49,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:49,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [938899181] [2022-01-31 23:43:49,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:49,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:49,716 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:43:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:49,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:50,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 23:43:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:50,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:50,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:50,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:43:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:50,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:50,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:50,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:50,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 23:43:50,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:50,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-31 23:43:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:50,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-31 23:43:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:50,081 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:50,081 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:50,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [938899181] [2022-01-31 23:43:50,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [938899181] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:50,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:50,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 23:43:50,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769788841] [2022-01-31 23:43:50,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:50,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 23:43:50,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:50,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 23:43:50,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-01-31 23:43:50,082 INFO L87 Difference]: Start difference. First operand 210 states and 224 transitions. Second operand has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-01-31 23:43:51,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:51,109 INFO L93 Difference]: Finished difference Result 414 states and 443 transitions. [2022-01-31 23:43:51,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-31 23:43:51,109 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 161 [2022-01-31 23:43:51,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:51,112 INFO L225 Difference]: With dead ends: 414 [2022-01-31 23:43:51,112 INFO L226 Difference]: Without dead ends: 213 [2022-01-31 23:43:51,113 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2022-01-31 23:43:51,115 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 487 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:51,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [488 Valid, 640 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 23:43:51,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-01-31 23:43:51,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2022-01-31 23:43:51,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 163 states have (on average 1.0858895705521472) internal successors, (177), 164 states have internal predecessors, (177), 23 states have call successors, (23), 23 states have call predecessors, (23), 23 states have return successors, (23), 22 states have call predecessors, (23), 21 states have call successors, (23) [2022-01-31 23:43:51,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 223 transitions. [2022-01-31 23:43:51,197 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 223 transitions. Word has length 161 [2022-01-31 23:43:51,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:51,197 INFO L470 AbstractCegarLoop]: Abstraction has 210 states and 223 transitions. [2022-01-31 23:43:51,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.35) internal successors, (107), 8 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-01-31 23:43:51,197 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 223 transitions. [2022-01-31 23:43:51,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-01-31 23:43:51,198 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 23:43:51,198 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 23:43:51,198 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-01-31 23:43:51,198 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 23:43:51,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 23:43:51,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1078689346, now seen corresponding path program 1 times [2022-01-31 23:43:51,199 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 23:43:51,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [387018406] [2022-01-31 23:43:51,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 23:43:51,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 23:43:51,201 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 23:43:51,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:51,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 23:43:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:51,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 23:43:51,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:51,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 23:43:51,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:51,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 23:43:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:51,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 23:43:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:51,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 23:43:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:51,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:51,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:51,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:51,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 23:43:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:51,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:51,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 23:43:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:51,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 23:43:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:51,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 23:43:51,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:51,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 23:43:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:51,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 23:43:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:51,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-31 23:43:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:51,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-31 23:43:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 23:43:51,588 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:51,588 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 23:43:51,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [387018406] [2022-01-31 23:43:51,588 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [387018406] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 23:43:51,589 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 23:43:51,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 23:43:51,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834502777] [2022-01-31 23:43:51,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 23:43:51,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 23:43:51,589 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 23:43:51,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 23:43:51,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-01-31 23:43:51,590 INFO L87 Difference]: Start difference. First operand 210 states and 223 transitions. Second operand has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2022-01-31 23:43:52,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 23:43:52,513 INFO L93 Difference]: Finished difference Result 213 states and 227 transitions. [2022-01-31 23:43:52,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 23:43:52,514 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 161 [2022-01-31 23:43:52,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 23:43:52,514 INFO L225 Difference]: With dead ends: 213 [2022-01-31 23:43:52,514 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 23:43:52,515 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 29 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:52,515 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 441 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 1555 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 23:43:52,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [441 Valid, 706 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1555 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 23:43:52,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 23:43:52,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 23:43:52,516 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:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 23:43:52,516 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 161 [2022-01-31 23:43:52,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 23:43:52,516 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 23:43:52,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.28) internal successors, (107), 11 states have internal predecessors, (107), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2022-01-31 23:43:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 23:43:52,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 23:43:52,519 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 23:43:52,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-01-31 23:43:52,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.