/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 21:55:44,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 21:55:44,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 21:55:44,837 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 21:55:44,837 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 21:55:44,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 21:55:44,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 21:55:44,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 21:55:44,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 21:55:44,844 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 21:55:44,844 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 21:55:44,846 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 21:55:44,846 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 21:55:44,847 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 21:55:44,848 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 21:55:44,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 21:55:44,850 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 21:55:44,851 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 21:55:44,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 21:55:44,874 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 21:55:44,875 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 21:55:44,879 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 21:55:44,880 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 21:55:44,881 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 21:55:44,883 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 21:55:44,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 21:55:44,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 21:55:44,885 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 21:55:44,885 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 21:55:44,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 21:55:44,886 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 21:55:44,887 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 21:55:44,887 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 21:55:44,888 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 21:55:44,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 21:55:44,904 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 21:55:44,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 21:55:44,905 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 21:55:44,905 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 21:55:44,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 21:55:44,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 21:55:44,908 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 21:55:44,916 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 21:55:44,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 21:55:44,917 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 21:55:44,917 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 21:55:44,917 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 21:55:44,917 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 21:55:44,917 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 21:55:44,917 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 21:55:44,918 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 21:55:44,918 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 21:55:44,918 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 21:55:44,918 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 21:55:44,918 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 21:55:44,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 21:55:44,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 21:55:44,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 21:55:44,919 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 21:55:44,919 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 21:55:44,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:55:44,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 21:55:44,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 21:55:44,919 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 21:55:44,919 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 21:55:44,919 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 21:55:45,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 21:55:45,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 21:55:45,140 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 21:55:45,141 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 21:55:45,141 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 21:55:45,142 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c [2022-01-31 21:55:45,196 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c87609365/2bd679dce9f24d138a3b0aaa343982ac/FLAG593e6558f [2022-01-31 21:55:45,688 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 21:55:45,689 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c [2022-01-31 21:55:45,702 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c87609365/2bd679dce9f24d138a3b0aaa343982ac/FLAG593e6558f [2022-01-31 21:55:46,014 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c87609365/2bd679dce9f24d138a3b0aaa343982ac [2022-01-31 21:55:46,017 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 21:55:46,018 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 21:55:46,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 21:55:46,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 21:55:46,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 21:55:46,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:55:46" (1/1) ... [2022-01-31 21:55:46,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7770e2d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:46, skipping insertion in model container [2022-01-31 21:55:46,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:55:46" (1/1) ... [2022-01-31 21:55:46,035 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 21:55:46,083 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 21:55:46,232 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726] [2022-01-31 21:55:46,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:55:46,326 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 21:55:46,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/floppy_simpl3.cil-2.c[2713,2726] [2022-01-31 21:55:46,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:55:46,425 INFO L208 MainTranslator]: Completed translation [2022-01-31 21:55:46,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:46 WrapperNode [2022-01-31 21:55:46,426 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 21:55:46,427 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 21:55:46,427 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 21:55:46,427 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 21:55:46,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:46" (1/1) ... [2022-01-31 21:55:46,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:46" (1/1) ... [2022-01-31 21:55:46,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:46" (1/1) ... [2022-01-31 21:55:46,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:46" (1/1) ... [2022-01-31 21:55:46,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:46" (1/1) ... [2022-01-31 21:55:46,496 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:46" (1/1) ... [2022-01-31 21:55:46,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:46" (1/1) ... [2022-01-31 21:55:46,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 21:55:46,506 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 21:55:46,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 21:55:46,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 21:55:46,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:46" (1/1) ... [2022-01-31 21:55:46,513 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:55:46,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 21:55:46,536 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 21:55:46,577 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 21:55:46,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 21:55:46,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 21:55:46,592 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 21:55:46,592 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-01-31 21:55:46,593 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-01-31 21:55:46,593 INFO L138 BoogieDeclarations]: Found implementation of procedure FlAcpiConfigureFloppy [2022-01-31 21:55:46,593 INFO L138 BoogieDeclarations]: Found implementation of procedure FlQueueIrpToThread [2022-01-31 21:55:46,593 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnp [2022-01-31 21:55:46,594 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyStartDevice [2022-01-31 21:55:46,594 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyPnpComplete [2022-01-31 21:55:46,594 INFO L138 BoogieDeclarations]: Found implementation of procedure FlFdcDeviceIo [2022-01-31 21:55:46,594 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyProcessQueuedRequests [2022-01-31 21:55:46,594 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-01-31 21:55:46,594 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 21:55:46,595 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-01-31 21:55:46,597 INFO L138 BoogieDeclarations]: Found implementation of procedure IoDeleteSymbolicLink [2022-01-31 21:55:46,597 INFO L138 BoogieDeclarations]: Found implementation of procedure IoQueryDeviceDescription [2022-01-31 21:55:46,597 INFO L138 BoogieDeclarations]: Found implementation of procedure IoRegisterDeviceInterface [2022-01-31 21:55:46,597 INFO L138 BoogieDeclarations]: Found implementation of procedure IoSetDeviceInterfaceState [2022-01-31 21:55:46,598 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-01-31 21:55:46,598 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-01-31 21:55:46,598 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-01-31 21:55:46,598 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-01-31 21:55:46,598 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-01-31 21:55:46,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ObReferenceObjectByHandle [2022-01-31 21:55:46,598 INFO L138 BoogieDeclarations]: Found implementation of procedure PsCreateSystemThread [2022-01-31 21:55:46,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-01-31 21:55:46,598 INFO L138 BoogieDeclarations]: Found implementation of procedure FloppyCreateClose [2022-01-31 21:55:46,598 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 21:55:46,598 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 21:55:46,598 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 21:55:46,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 21:55:46,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-01-31 21:55:46,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 21:55:46,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-01-31 21:55:46,599 INFO L130 BoogieDeclarations]: Found specification of procedure FlAcpiConfigureFloppy [2022-01-31 21:55:46,599 INFO L130 BoogieDeclarations]: Found specification of procedure FlQueueIrpToThread [2022-01-31 21:55:46,599 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnp [2022-01-31 21:55:46,599 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyStartDevice [2022-01-31 21:55:46,599 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyPnpComplete [2022-01-31 21:55:46,599 INFO L130 BoogieDeclarations]: Found specification of procedure FlFdcDeviceIo [2022-01-31 21:55:46,599 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-01-31 21:55:46,599 INFO L130 BoogieDeclarations]: Found specification of procedure IoDeleteSymbolicLink [2022-01-31 21:55:46,600 INFO L130 BoogieDeclarations]: Found specification of procedure IoQueryDeviceDescription [2022-01-31 21:55:46,600 INFO L130 BoogieDeclarations]: Found specification of procedure IoRegisterDeviceInterface [2022-01-31 21:55:46,600 INFO L130 BoogieDeclarations]: Found specification of procedure IoSetDeviceInterfaceState [2022-01-31 21:55:46,600 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-01-31 21:55:46,600 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-01-31 21:55:46,600 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-01-31 21:55:46,600 INFO L130 BoogieDeclarations]: Found specification of procedure ObReferenceObjectByHandle [2022-01-31 21:55:46,600 INFO L130 BoogieDeclarations]: Found specification of procedure PsCreateSystemThread [2022-01-31 21:55:46,600 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-01-31 21:55:46,600 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-01-31 21:55:46,600 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-01-31 21:55:46,600 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-01-31 21:55:46,600 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyProcessQueuedRequests [2022-01-31 21:55:46,601 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-01-31 21:55:46,601 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 21:55:46,601 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-01-31 21:55:46,601 INFO L130 BoogieDeclarations]: Found specification of procedure FloppyCreateClose [2022-01-31 21:55:46,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 21:55:46,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 21:55:46,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 21:55:46,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 21:55:46,601 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 21:55:46,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 21:55:46,780 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 21:55:46,782 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 21:55:46,812 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:46,855 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 21:55:46,855 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 21:55:46,868 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:46,877 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 21:55:46,877 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 21:55:46,883 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,028 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-01-31 21:55:47,028 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-01-31 21:55:47,033 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,082 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume false; [2022-01-31 21:55:47,082 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume !false; [2022-01-31 21:55:47,091 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,103 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-01-31 21:55:47,103 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-01-31 21:55:47,192 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,204 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 21:55:47,204 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 21:55:47,204 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,213 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 21:55:47,213 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 21:55:47,213 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,228 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 21:55:47,228 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 21:55:47,269 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,308 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##12: assume !false; [2022-01-31 21:55:47,308 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##11: assume false; [2022-01-31 21:55:47,344 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,356 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 21:55:47,357 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 21:55:47,357 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,369 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 21:55:47,369 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 21:55:47,370 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:47,379 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 21:55:47,379 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 21:55:47,391 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 21:55:47,400 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 21:55:47,400 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 21:55:47,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:55:47 BoogieIcfgContainer [2022-01-31 21:55:47,403 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 21:55:47,405 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 21:55:47,405 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 21:55:47,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 21:55:47,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:55:46" (1/3) ... [2022-01-31 21:55:47,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c35991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:55:47, skipping insertion in model container [2022-01-31 21:55:47,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:46" (2/3) ... [2022-01-31 21:55:47,413 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50c35991 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:55:47, skipping insertion in model container [2022-01-31 21:55:47,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:55:47" (3/3) ... [2022-01-31 21:55:47,414 INFO L111 eAbstractionObserver]: Analyzing ICFG floppy_simpl3.cil-2.c [2022-01-31 21:55:47,419 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 21:55:47,419 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 21:55:47,456 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 21:55:47,463 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=JORDAN [2022-01-31 21:55:47,463 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 21:55:47,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 304 states, 221 states have (on average 1.420814479638009) internal successors, (314), 243 states have internal predecessors, (314), 56 states have call successors, (56), 24 states have call predecessors, (56), 24 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) [2022-01-31 21:55:47,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 21:55:47,501 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:47,501 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 21:55:47,502 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:47,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:47,507 INFO L85 PathProgramCache]: Analyzing trace with hash 678159399, now seen corresponding path program 1 times [2022-01-31 21:55:47,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:47,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [265368413] [2022-01-31 21:55:47,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:47,523 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:47,572 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:47,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:47,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:47,965 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 21:55:47,966 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:47,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [265368413] [2022-01-31 21:55:47,968 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [265368413] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:47,968 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:47,968 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 21:55:47,969 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148530352] [2022-01-31 21:55:47,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:47,973 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 21:55:47,973 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:48,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 21:55:48,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 21:55:48,011 INFO L87 Difference]: Start difference. First operand has 304 states, 221 states have (on average 1.420814479638009) internal successors, (314), 243 states have internal predecessors, (314), 56 states have call successors, (56), 24 states have call predecessors, (56), 24 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 21:55:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:49,112 INFO L93 Difference]: Finished difference Result 538 states and 779 transitions. [2022-01-31 21:55:49,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 21:55:49,115 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 21:55:49,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:49,135 INFO L225 Difference]: With dead ends: 538 [2022-01-31 21:55:49,135 INFO L226 Difference]: Without dead ends: 322 [2022-01-31 21:55:49,144 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 21:55:49,147 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 240 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:49,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [245 Valid, 571 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:55:49,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-01-31 21:55:49,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 292. [2022-01-31 21:55:49,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 213 states have (on average 1.3708920187793427) internal successors, (292), 233 states have internal predecessors, (292), 56 states have call successors, (56), 24 states have call predecessors, (56), 22 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2022-01-31 21:55:49,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 385 transitions. [2022-01-31 21:55:49,270 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 385 transitions. Word has length 20 [2022-01-31 21:55:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:49,271 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 385 transitions. [2022-01-31 21:55:49,271 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 21:55:49,271 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 385 transitions. [2022-01-31 21:55:49,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-31 21:55:49,273 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:49,273 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:49,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 21:55:49,274 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:49,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:49,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1368814580, now seen corresponding path program 1 times [2022-01-31 21:55:49,275 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:49,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [300295175] [2022-01-31 21:55:49,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:49,276 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:49,285 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,495 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 21:55:49,496 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:49,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [300295175] [2022-01-31 21:55:49,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [300295175] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:49,496 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:49,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:55:49,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628674629] [2022-01-31 21:55:49,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:49,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:55:49,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:49,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:55:49,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:55:49,499 INFO L87 Difference]: Start difference. First operand 292 states and 385 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:51,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:51,132 INFO L93 Difference]: Finished difference Result 637 states and 856 transitions. [2022-01-31 21:55:51,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:55:51,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-01-31 21:55:51,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:51,137 INFO L225 Difference]: With dead ends: 637 [2022-01-31 21:55:51,137 INFO L226 Difference]: Without dead ends: 476 [2022-01-31 21:55:51,138 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 21:55:51,167 INFO L933 BasicCegarLoop]: 504 mSDtfsCounter, 449 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:51,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [455 Valid, 741 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-31 21:55:51,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2022-01-31 21:55:51,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 429. [2022-01-31 21:55:51,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 328 states have (on average 1.3140243902439024) internal successors, (431), 334 states have internal predecessors, (431), 65 states have call successors, (65), 37 states have call predecessors, (65), 35 states have return successors, (74), 59 states have call predecessors, (74), 54 states have call successors, (74) [2022-01-31 21:55:51,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 570 transitions. [2022-01-31 21:55:51,235 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 570 transitions. Word has length 28 [2022-01-31 21:55:51,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:51,236 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 570 transitions. [2022-01-31 21:55:51,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 3 states have internal predecessors, (18), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:51,237 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 570 transitions. [2022-01-31 21:55:51,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 21:55:51,238 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:51,238 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:51,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 21:55:51,238 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:51,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:51,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1511850433, now seen corresponding path program 1 times [2022-01-31 21:55:51,239 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:51,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1172356207] [2022-01-31 21:55:51,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:51,240 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:51,243 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:51,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:51,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:51,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:51,431 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 21:55:51,431 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:51,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1172356207] [2022-01-31 21:55:51,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1172356207] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:51,432 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:51,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:55:51,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096328812] [2022-01-31 21:55:51,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:51,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:55:51,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:51,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:55:51,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:55:51,434 INFO L87 Difference]: Start difference. First operand 429 states and 570 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:52,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:52,199 INFO L93 Difference]: Finished difference Result 943 states and 1257 transitions. [2022-01-31 21:55:52,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:55:52,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2022-01-31 21:55:52,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:52,204 INFO L225 Difference]: With dead ends: 943 [2022-01-31 21:55:52,204 INFO L226 Difference]: Without dead ends: 675 [2022-01-31 21:55:52,206 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 21:55:52,207 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 647 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 654 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:52,207 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [654 Valid, 550 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:55:52,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2022-01-31 21:55:52,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 632. [2022-01-31 21:55:52,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 493 states have (on average 1.3144016227180528) internal successors, (648), 497 states have internal predecessors, (648), 85 states have call successors, (85), 55 states have call predecessors, (85), 53 states have return successors, (112), 81 states have call predecessors, (112), 76 states have call successors, (112) [2022-01-31 21:55:52,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 845 transitions. [2022-01-31 21:55:52,298 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 845 transitions. Word has length 30 [2022-01-31 21:55:52,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:52,299 INFO L470 AbstractCegarLoop]: Abstraction has 632 states and 845 transitions. [2022-01-31 21:55:52,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:52,299 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 845 transitions. [2022-01-31 21:55:52,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-31 21:55:52,300 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:52,300 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:52,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 21:55:52,301 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:52,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:52,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1740442034, now seen corresponding path program 1 times [2022-01-31 21:55:52,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:52,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2110324428] [2022-01-31 21:55:52,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:52,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:52,304 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:52,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:52,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:52,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:52,441 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 21:55:52,441 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:52,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2110324428] [2022-01-31 21:55:52,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2110324428] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:52,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:52,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:55:52,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603663949] [2022-01-31 21:55:52,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:52,442 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:55:52,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:52,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:55:52,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:55:52,443 INFO L87 Difference]: Start difference. First operand 632 states and 845 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:53,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:53,467 INFO L93 Difference]: Finished difference Result 739 states and 979 transitions. [2022-01-31 21:55:53,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:55:53,469 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 34 [2022-01-31 21:55:53,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:53,473 INFO L225 Difference]: With dead ends: 739 [2022-01-31 21:55:53,473 INFO L226 Difference]: Without dead ends: 721 [2022-01-31 21:55:53,474 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 21:55:53,475 INFO L933 BasicCegarLoop]: 325 mSDtfsCounter, 474 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:53,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [481 Valid, 444 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:55:53,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2022-01-31 21:55:53,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 670. [2022-01-31 21:55:53,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 525 states have (on average 1.3161904761904761) internal successors, (691), 535 states have internal predecessors, (691), 86 states have call successors, (86), 57 states have call predecessors, (86), 58 states have return successors, (117), 80 states have call predecessors, (117), 78 states have call successors, (117) [2022-01-31 21:55:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 894 transitions. [2022-01-31 21:55:53,546 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 894 transitions. Word has length 34 [2022-01-31 21:55:53,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:53,546 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 894 transitions. [2022-01-31 21:55:53,546 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 3 states have internal predecessors, (24), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:53,546 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 894 transitions. [2022-01-31 21:55:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 21:55:53,549 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:53,549 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:53,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 21:55:53,549 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:53,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:53,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1127947077, now seen corresponding path program 1 times [2022-01-31 21:55:53,550 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:53,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1005464586] [2022-01-31 21:55:53,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:53,551 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:53,552 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 21:55:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:53,756 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 21:55:53,757 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:53,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1005464586] [2022-01-31 21:55:53,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1005464586] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:53,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:53,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:55:53,757 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459620857] [2022-01-31 21:55:53,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:53,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:55:53,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:53,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:55:53,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:55:53,759 INFO L87 Difference]: Start difference. First operand 670 states and 894 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 21:55:54,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:54,794 INFO L93 Difference]: Finished difference Result 763 states and 1009 transitions. [2022-01-31 21:55:54,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:55:54,794 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-01-31 21:55:54,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:54,798 INFO L225 Difference]: With dead ends: 763 [2022-01-31 21:55:54,798 INFO L226 Difference]: Without dead ends: 696 [2022-01-31 21:55:54,798 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 21:55:54,799 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 520 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:54,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 722 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:55:54,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-01-31 21:55:54,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 674. [2022-01-31 21:55:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 528 states have (on average 1.3143939393939394) internal successors, (694), 538 states have internal predecessors, (694), 86 states have call successors, (86), 57 states have call predecessors, (86), 59 states have return successors, (118), 81 states have call predecessors, (118), 78 states have call successors, (118) [2022-01-31 21:55:54,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 898 transitions. [2022-01-31 21:55:54,865 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 898 transitions. Word has length 41 [2022-01-31 21:55:54,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:54,865 INFO L470 AbstractCegarLoop]: Abstraction has 674 states and 898 transitions. [2022-01-31 21:55:54,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 21:55:54,865 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 898 transitions. [2022-01-31 21:55:54,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 21:55:54,867 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:54,867 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 21:55:54,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 21:55:54,868 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:54,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:54,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1437203420, now seen corresponding path program 1 times [2022-01-31 21:55:54,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:54,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2077393901] [2022-01-31 21:55:54,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:54,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:54,871 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,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 21:55:55,020 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:55,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2077393901] [2022-01-31 21:55:55,020 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2077393901] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:55,020 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:55,020 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:55:55,020 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005959816] [2022-01-31 21:55:55,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:55,021 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:55:55,021 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:55,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:55:55,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:55:55,022 INFO L87 Difference]: Start difference. First operand 674 states and 898 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:55,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:55,716 INFO L93 Difference]: Finished difference Result 701 states and 932 transitions. [2022-01-31 21:55:55,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:55:55,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-01-31 21:55:55,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:55,720 INFO L225 Difference]: With dead ends: 701 [2022-01-31 21:55:55,720 INFO L226 Difference]: Without dead ends: 698 [2022-01-31 21:55:55,721 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 21:55:55,722 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 314 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:55,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 558 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:55:55,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2022-01-31 21:55:55,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 685. [2022-01-31 21:55:55,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 539 states have (on average 1.313543599257885) internal successors, (708), 548 states have internal predecessors, (708), 86 states have call successors, (86), 58 states have call predecessors, (86), 59 states have return successors, (118), 81 states have call predecessors, (118), 78 states have call successors, (118) [2022-01-31 21:55:55,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 912 transitions. [2022-01-31 21:55:55,811 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 912 transitions. Word has length 40 [2022-01-31 21:55:55,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:55,811 INFO L470 AbstractCegarLoop]: Abstraction has 685 states and 912 transitions. [2022-01-31 21:55:55,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:55,812 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 912 transitions. [2022-01-31 21:55:55,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 21:55:55,814 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:55,814 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 21:55:55,814 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 21:55:55,814 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:55,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:55,815 INFO L85 PathProgramCache]: Analyzing trace with hash 875613287, now seen corresponding path program 1 times [2022-01-31 21:55:55,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:55,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [586831795] [2022-01-31 21:55:55,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:55,815 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:55,817 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:55,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:55:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:56,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:55:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:56,015 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 21:55:56,015 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:56,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [586831795] [2022-01-31 21:55:56,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [586831795] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:56,016 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:56,016 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:55:56,016 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038870258] [2022-01-31 21:55:56,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:56,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:55:56,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:56,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:55:56,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:55:56,017 INFO L87 Difference]: Start difference. First operand 685 states and 912 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:55:56,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:56,817 INFO L93 Difference]: Finished difference Result 752 states and 994 transitions. [2022-01-31 21:55:56,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 21:55:56,818 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2022-01-31 21:55:56,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:56,822 INFO L225 Difference]: With dead ends: 752 [2022-01-31 21:55:56,822 INFO L226 Difference]: Without dead ends: 747 [2022-01-31 21:55:56,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:55:56,823 INFO L933 BasicCegarLoop]: 330 mSDtfsCounter, 422 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:56,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [425 Valid, 713 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:55:56,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-01-31 21:55:56,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 718. [2022-01-31 21:55:56,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 566 states have (on average 1.3091872791519434) internal successors, (741), 578 states have internal predecessors, (741), 86 states have call successors, (86), 58 states have call predecessors, (86), 65 states have return successors, (124), 83 states have call predecessors, (124), 78 states have call successors, (124) [2022-01-31 21:55:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 951 transitions. [2022-01-31 21:55:56,894 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 951 transitions. Word has length 41 [2022-01-31 21:55:56,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:56,895 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 951 transitions. [2022-01-31 21:55:56,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:55:56,895 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 951 transitions. [2022-01-31 21:55:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-31 21:55:56,896 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:56,896 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 21:55:56,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 21:55:56,897 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:56,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:56,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1826085718, now seen corresponding path program 1 times [2022-01-31 21:55:56,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:56,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1273296757] [2022-01-31 21:55:56,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:56,898 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:56,899 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:56,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:55:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:55:57,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:55:57,144 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:57,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1273296757] [2022-01-31 21:55:57,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1273296757] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:57,144 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:57,144 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:55:57,144 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927555700] [2022-01-31 21:55:57,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:57,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:55:57,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:57,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:55:57,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:55:57,147 INFO L87 Difference]: Start difference. First operand 718 states and 951 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:55:58,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:58,209 INFO L93 Difference]: Finished difference Result 753 states and 993 transitions. [2022-01-31 21:55:58,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:55:58,209 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-01-31 21:55:58,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:58,215 INFO L225 Difference]: With dead ends: 753 [2022-01-31 21:55:58,215 INFO L226 Difference]: Without dead ends: 747 [2022-01-31 21:55:58,218 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:55:58,220 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 1226 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 393 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 393 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:58,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1236 Valid, 666 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [393 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:55:58,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-01-31 21:55:58,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 718. [2022-01-31 21:55:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 566 states have (on average 1.3074204946996466) internal successors, (740), 578 states have internal predecessors, (740), 86 states have call successors, (86), 58 states have call predecessors, (86), 65 states have return successors, (124), 83 states have call predecessors, (124), 78 states have call successors, (124) [2022-01-31 21:55:58,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 950 transitions. [2022-01-31 21:55:58,312 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 950 transitions. Word has length 42 [2022-01-31 21:55:58,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:58,315 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 950 transitions. [2022-01-31 21:55:58,315 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:55:58,315 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 950 transitions. [2022-01-31 21:55:58,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-31 21:55:58,316 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:58,316 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 21:55:58,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 21:55:58,317 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:58,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:58,323 INFO L85 PathProgramCache]: Analyzing trace with hash -86309196, now seen corresponding path program 1 times [2022-01-31 21:55:58,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:58,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1971025137] [2022-01-31 21:55:58,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:58,323 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:58,325 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:58,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:58,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:55:58,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:55:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:58,581 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 21:55:58,582 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:58,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1971025137] [2022-01-31 21:55:58,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1971025137] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:58,582 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:58,582 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:55:58,582 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573009689] [2022-01-31 21:55:58,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:58,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:55:58,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:58,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:55:58,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:55:58,583 INFO L87 Difference]: Start difference. First operand 718 states and 950 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:55:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:59,926 INFO L93 Difference]: Finished difference Result 753 states and 992 transitions. [2022-01-31 21:55:59,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:55:59,927 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2022-01-31 21:55:59,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:59,931 INFO L225 Difference]: With dead ends: 753 [2022-01-31 21:55:59,932 INFO L226 Difference]: Without dead ends: 747 [2022-01-31 21:55:59,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:55:59,934 INFO L933 BasicCegarLoop]: 314 mSDtfsCounter, 662 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:59,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [672 Valid, 732 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:55:59,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-01-31 21:56:00,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 718. [2022-01-31 21:56:00,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 566 states have (on average 1.3056537102473498) internal successors, (739), 578 states have internal predecessors, (739), 86 states have call successors, (86), 58 states have call predecessors, (86), 65 states have return successors, (124), 83 states have call predecessors, (124), 78 states have call successors, (124) [2022-01-31 21:56:00,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 949 transitions. [2022-01-31 21:56:00,029 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 949 transitions. Word has length 43 [2022-01-31 21:56:00,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:00,029 INFO L470 AbstractCegarLoop]: Abstraction has 718 states and 949 transitions. [2022-01-31 21:56:00,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 7 states have internal predecessors, (31), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:56:00,030 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 949 transitions. [2022-01-31 21:56:00,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 21:56:00,031 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:00,031 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 21:56:00,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 21:56:00,031 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:00,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:00,032 INFO L85 PathProgramCache]: Analyzing trace with hash -730291913, now seen corresponding path program 1 times [2022-01-31 21:56:00,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:00,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2065880324] [2022-01-31 21:56:00,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:00,035 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:00,037 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:00,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:00,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 21:56:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:00,194 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 21:56:00,194 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:00,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2065880324] [2022-01-31 21:56:00,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2065880324] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:00,195 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:00,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 21:56:00,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379680425] [2022-01-31 21:56:00,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:00,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 21:56:00,195 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:00,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 21:56:00,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 21:56:00,196 INFO L87 Difference]: Start difference. First operand 718 states and 949 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 21:56:01,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:01,231 INFO L93 Difference]: Finished difference Result 1093 states and 1463 transitions. [2022-01-31 21:56:01,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:56:01,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 44 [2022-01-31 21:56:01,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:01,239 INFO L225 Difference]: With dead ends: 1093 [2022-01-31 21:56:01,239 INFO L226 Difference]: Without dead ends: 1090 [2022-01-31 21:56:01,239 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 21:56:01,240 INFO L933 BasicCegarLoop]: 434 mSDtfsCounter, 653 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:01,241 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [666 Valid, 634 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:56:01,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2022-01-31 21:56:01,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 831. [2022-01-31 21:56:01,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 657 states have (on average 1.3135464231354643) internal successors, (863), 671 states have internal predecessors, (863), 96 states have call successors, (96), 68 states have call predecessors, (96), 77 states have return successors, (144), 93 states have call predecessors, (144), 88 states have call successors, (144) [2022-01-31 21:56:01,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1103 transitions. [2022-01-31 21:56:01,361 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1103 transitions. Word has length 44 [2022-01-31 21:56:01,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:01,361 INFO L470 AbstractCegarLoop]: Abstraction has 831 states and 1103 transitions. [2022-01-31 21:56:01,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-01-31 21:56:01,362 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1103 transitions. [2022-01-31 21:56:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-31 21:56:01,364 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:01,364 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 21:56:01,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 21:56:01,365 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:01,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:01,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1703157951, now seen corresponding path program 1 times [2022-01-31 21:56:01,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:01,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1197976493] [2022-01-31 21:56:01,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:01,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:01,368 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:01,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,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 21:56:01,566 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:01,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1197976493] [2022-01-31 21:56:01,566 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1197976493] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:01,566 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:01,566 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:56:01,566 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357704352] [2022-01-31 21:56:01,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:01,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:56:01,567 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:01,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:56:01,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:01,568 INFO L87 Difference]: Start difference. First operand 831 states and 1103 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:02,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:02,522 INFO L93 Difference]: Finished difference Result 874 states and 1154 transitions. [2022-01-31 21:56:02,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:56:02,523 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 44 [2022-01-31 21:56:02,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:02,527 INFO L225 Difference]: With dead ends: 874 [2022-01-31 21:56:02,527 INFO L226 Difference]: Without dead ends: 856 [2022-01-31 21:56:02,528 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 21:56:02,528 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 257 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:02,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [260 Valid, 1080 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:56:02,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2022-01-31 21:56:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 829. [2022-01-31 21:56:02,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 656 states have (on average 1.3125) internal successors, (861), 670 states have internal predecessors, (861), 95 states have call successors, (95), 68 states have call predecessors, (95), 77 states have return successors, (143), 92 states have call predecessors, (143), 87 states have call successors, (143) [2022-01-31 21:56:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1099 transitions. [2022-01-31 21:56:02,641 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1099 transitions. Word has length 44 [2022-01-31 21:56:02,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:02,642 INFO L470 AbstractCegarLoop]: Abstraction has 829 states and 1099 transitions. [2022-01-31 21:56:02,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1099 transitions. [2022-01-31 21:56:02,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-01-31 21:56:02,643 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:02,643 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 21:56:02,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 21:56:02,643 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:02,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:02,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1402041733, now seen corresponding path program 1 times [2022-01-31 21:56:02,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:02,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1464124041] [2022-01-31 21:56:02,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:02,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:02,646 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:02,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:02,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:02,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:02,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 21:56:02,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:02,860 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 21:56:02,860 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:02,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1464124041] [2022-01-31 21:56:02,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1464124041] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:02,861 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:02,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:56:02,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504444025] [2022-01-31 21:56:02,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:02,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:56:02,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:02,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:56:02,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:02,862 INFO L87 Difference]: Start difference. First operand 829 states and 1099 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 6 states have internal predecessors, (33), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 21:56:04,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:04,579 INFO L93 Difference]: Finished difference Result 1427 states and 1864 transitions. [2022-01-31 21:56:04,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:04,580 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 6 states have internal predecessors, (33), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 45 [2022-01-31 21:56:04,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:04,587 INFO L225 Difference]: With dead ends: 1427 [2022-01-31 21:56:04,587 INFO L226 Difference]: Without dead ends: 874 [2022-01-31 21:56:04,589 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:56:04,589 INFO L933 BasicCegarLoop]: 450 mSDtfsCounter, 1298 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:04,590 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1310 Valid, 698 Invalid, 1767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 21:56:04,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2022-01-31 21:56:04,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 820. [2022-01-31 21:56:04,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 647 states have (on average 1.2982998454404946) internal successors, (840), 661 states have internal predecessors, (840), 95 states have call successors, (95), 68 states have call predecessors, (95), 77 states have return successors, (143), 92 states have call predecessors, (143), 87 states have call successors, (143) [2022-01-31 21:56:04,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1078 transitions. [2022-01-31 21:56:04,718 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1078 transitions. Word has length 45 [2022-01-31 21:56:04,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:04,719 INFO L470 AbstractCegarLoop]: Abstraction has 820 states and 1078 transitions. [2022-01-31 21:56:04,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 6 states have internal predecessors, (33), 4 states have call successors, (8), 7 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-31 21:56:04,720 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1078 transitions. [2022-01-31 21:56:04,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-31 21:56:04,721 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:04,721 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:04,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 21:56:04,721 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:04,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:04,721 INFO L85 PathProgramCache]: Analyzing trace with hash -81440673, now seen corresponding path program 1 times [2022-01-31 21:56:04,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:04,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [825508005] [2022-01-31 21:56:04,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:04,722 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:04,723 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:04,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:04,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:04,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:04,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 21:56:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:04,873 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 21:56:04,873 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:04,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [825508005] [2022-01-31 21:56:04,873 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [825508005] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:04,874 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:04,874 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:56:04,874 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439848803] [2022-01-31 21:56:04,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:04,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:56:04,874 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:04,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:56:04,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:56:04,875 INFO L87 Difference]: Start difference. First operand 820 states and 1078 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 21:56:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:05,702 INFO L93 Difference]: Finished difference Result 919 states and 1179 transitions. [2022-01-31 21:56:05,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:56:05,703 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2022-01-31 21:56:05,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:05,706 INFO L225 Difference]: With dead ends: 919 [2022-01-31 21:56:05,706 INFO L226 Difference]: Without dead ends: 580 [2022-01-31 21:56:05,707 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 21:56:05,708 INFO L933 BasicCegarLoop]: 380 mSDtfsCounter, 685 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:05,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [692 Valid, 747 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:56:05,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2022-01-31 21:56:05,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 528. [2022-01-31 21:56:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 416 states have (on average 1.2740384615384615) internal successors, (530), 427 states have internal predecessors, (530), 62 states have call successors, (62), 43 states have call predecessors, (62), 49 states have return successors, (75), 59 states have call predecessors, (75), 54 states have call successors, (75) [2022-01-31 21:56:05,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 667 transitions. [2022-01-31 21:56:05,796 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 667 transitions. Word has length 49 [2022-01-31 21:56:05,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:05,797 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 667 transitions. [2022-01-31 21:56:05,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 4 states have internal predecessors, (36), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 21:56:05,797 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 667 transitions. [2022-01-31 21:56:05,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 21:56:05,798 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:05,798 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 21:56:05,798 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 21:56:05,798 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:05,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:05,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1263125299, now seen corresponding path program 1 times [2022-01-31 21:56:05,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:05,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1836392990] [2022-01-31 21:56:05,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:05,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:05,801 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:05,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:05,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:05,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:05,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:05,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-01-31 21:56:05,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:05,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:05,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-31 21:56:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:05,990 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:05,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1836392990] [2022-01-31 21:56:05,990 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1836392990] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:05,990 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:05,991 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:56:05,991 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528882957] [2022-01-31 21:56:05,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:05,992 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:56:05,992 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:05,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:56:05,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:56:05,993 INFO L87 Difference]: Start difference. First operand 528 states and 667 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:07,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:07,084 INFO L93 Difference]: Finished difference Result 834 states and 1062 transitions. [2022-01-31 21:56:07,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:56:07,084 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-01-31 21:56:07,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:07,087 INFO L225 Difference]: With dead ends: 834 [2022-01-31 21:56:07,087 INFO L226 Difference]: Without dead ends: 569 [2022-01-31 21:56:07,088 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 21:56:07,089 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 288 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:07,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [293 Valid, 761 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:56:07,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-01-31 21:56:07,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 542. [2022-01-31 21:56:07,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 429 states have (on average 1.275058275058275) internal successors, (547), 440 states have internal predecessors, (547), 62 states have call successors, (62), 43 states have call predecessors, (62), 50 states have return successors, (78), 59 states have call predecessors, (78), 54 states have call successors, (78) [2022-01-31 21:56:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 687 transitions. [2022-01-31 21:56:07,183 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 687 transitions. Word has length 58 [2022-01-31 21:56:07,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:07,183 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 687 transitions. [2022-01-31 21:56:07,183 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:07,183 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 687 transitions. [2022-01-31 21:56:07,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 21:56:07,184 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:07,185 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 21:56:07,185 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 21:56:07,185 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:07,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:07,185 INFO L85 PathProgramCache]: Analyzing trace with hash 445989130, now seen corresponding path program 1 times [2022-01-31 21:56:07,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:07,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1604479805] [2022-01-31 21:56:07,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:07,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:07,187 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 21:56:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,387 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 21:56:07,387 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:07,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1604479805] [2022-01-31 21:56:07,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1604479805] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:07,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:07,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:56:07,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506999373] [2022-01-31 21:56:07,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:07,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:56:07,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:07,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:56:07,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:07,389 INFO L87 Difference]: Start difference. First operand 542 states and 687 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 21:56:08,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:08,886 INFO L93 Difference]: Finished difference Result 780 states and 989 transitions. [2022-01-31 21:56:08,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 21:56:08,886 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 52 [2022-01-31 21:56:08,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:08,889 INFO L225 Difference]: With dead ends: 780 [2022-01-31 21:56:08,889 INFO L226 Difference]: Without dead ends: 714 [2022-01-31 21:56:08,891 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2022-01-31 21:56:08,893 INFO L933 BasicCegarLoop]: 433 mSDtfsCounter, 1020 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:08,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1022 Valid, 1068 Invalid, 1805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 1405 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 21:56:08,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-01-31 21:56:08,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 571. [2022-01-31 21:56:08,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 452 states have (on average 1.2676991150442478) internal successors, (573), 464 states have internal predecessors, (573), 64 states have call successors, (64), 44 states have call predecessors, (64), 54 states have return successors, (83), 63 states have call predecessors, (83), 56 states have call successors, (83) [2022-01-31 21:56:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 720 transitions. [2022-01-31 21:56:08,999 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 720 transitions. Word has length 52 [2022-01-31 21:56:08,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:08,999 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 720 transitions. [2022-01-31 21:56:08,999 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 7 states have internal predecessors, (40), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 21:56:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 720 transitions. [2022-01-31 21:56:09,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 21:56:09,001 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:09,001 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 21:56:09,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 21:56:09,001 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:09,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:09,001 INFO L85 PathProgramCache]: Analyzing trace with hash -119997841, now seen corresponding path program 1 times [2022-01-31 21:56:09,001 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:09,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1429612789] [2022-01-31 21:56:09,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:09,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:09,004 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:09,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:09,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:09,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:09,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:09,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 21:56:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:09,209 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 21:56:09,209 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:09,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1429612789] [2022-01-31 21:56:09,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1429612789] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:09,209 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:09,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:56:09,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036055327] [2022-01-31 21:56:09,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:09,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:56:09,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:09,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:56:09,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:09,211 INFO L87 Difference]: Start difference. First operand 571 states and 720 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:56:10,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:10,397 INFO L93 Difference]: Finished difference Result 1006 states and 1293 transitions. [2022-01-31 21:56:10,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:56:10,398 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 54 [2022-01-31 21:56:10,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:10,401 INFO L225 Difference]: With dead ends: 1006 [2022-01-31 21:56:10,401 INFO L226 Difference]: Without dead ends: 638 [2022-01-31 21:56:10,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:56:10,402 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 502 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:10,403 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [516 Valid, 750 Invalid, 1292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:56:10,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2022-01-31 21:56:10,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 583. [2022-01-31 21:56:10,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 464 states have (on average 1.271551724137931) internal successors, (590), 476 states have internal predecessors, (590), 64 states have call successors, (64), 44 states have call predecessors, (64), 54 states have return successors, (83), 63 states have call predecessors, (83), 56 states have call successors, (83) [2022-01-31 21:56:10,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 737 transitions. [2022-01-31 21:56:10,526 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 737 transitions. Word has length 54 [2022-01-31 21:56:10,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:10,526 INFO L470 AbstractCegarLoop]: Abstraction has 583 states and 737 transitions. [2022-01-31 21:56:10,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:56:10,526 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 737 transitions. [2022-01-31 21:56:10,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 21:56:10,528 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:10,528 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 21:56:10,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 21:56:10,528 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:10,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:10,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1708345743, now seen corresponding path program 1 times [2022-01-31 21:56:10,528 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:10,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [404920561] [2022-01-31 21:56:10,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:10,529 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:10,530 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:10,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:10,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:10,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:10,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:10,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:10,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:10,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 21:56:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:10,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 21:56:10,735 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:10,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [404920561] [2022-01-31 21:56:10,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [404920561] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:10,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:10,736 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:56:10,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246267675] [2022-01-31 21:56:10,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:10,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:56:10,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:10,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:56:10,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:10,737 INFO L87 Difference]: Start difference. First operand 583 states and 737 transitions. Second operand has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 8 states have internal predecessors, (42), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 21:56:12,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:12,305 INFO L93 Difference]: Finished difference Result 692 states and 873 transitions. [2022-01-31 21:56:12,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:56:12,305 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 8 states have internal predecessors, (42), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 54 [2022-01-31 21:56:12,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:12,308 INFO L225 Difference]: With dead ends: 692 [2022-01-31 21:56:12,308 INFO L226 Difference]: Without dead ends: 611 [2022-01-31 21:56:12,309 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:56:12,309 INFO L933 BasicCegarLoop]: 320 mSDtfsCounter, 545 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:12,309 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [553 Valid, 906 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 21:56:12,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2022-01-31 21:56:12,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 564. [2022-01-31 21:56:12,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 447 states have (on average 1.2662192393736018) internal successors, (566), 459 states have internal predecessors, (566), 64 states have call successors, (64), 44 states have call predecessors, (64), 52 states have return successors, (81), 61 states have call predecessors, (81), 56 states have call successors, (81) [2022-01-31 21:56:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 711 transitions. [2022-01-31 21:56:12,421 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 711 transitions. Word has length 54 [2022-01-31 21:56:12,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:12,422 INFO L470 AbstractCegarLoop]: Abstraction has 564 states and 711 transitions. [2022-01-31 21:56:12,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 8 states have internal predecessors, (42), 4 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-31 21:56:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 711 transitions. [2022-01-31 21:56:12,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 21:56:12,440 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:12,440 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 21:56:12,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 21:56:12,440 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:12,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:12,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1565066385, now seen corresponding path program 1 times [2022-01-31 21:56:12,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:12,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1546059884] [2022-01-31 21:56:12,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:12,441 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:12,443 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:12,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:12,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:12,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:12,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:12,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 21:56:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:12,598 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 21:56:12,598 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:12,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1546059884] [2022-01-31 21:56:12,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1546059884] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:12,599 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:12,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:56:12,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845611031] [2022-01-31 21:56:12,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:12,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:56:12,599 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:12,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:56:12,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:56:12,600 INFO L87 Difference]: Start difference. First operand 564 states and 711 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:13,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:13,630 INFO L93 Difference]: Finished difference Result 679 states and 856 transitions. [2022-01-31 21:56:13,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 21:56:13,631 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 54 [2022-01-31 21:56:13,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:13,633 INFO L225 Difference]: With dead ends: 679 [2022-01-31 21:56:13,633 INFO L226 Difference]: Without dead ends: 666 [2022-01-31 21:56:13,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:56:13,634 INFO L933 BasicCegarLoop]: 421 mSDtfsCounter, 441 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 914 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:13,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [450 Valid, 788 Invalid, 1062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 914 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:56:13,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-01-31 21:56:13,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 580. [2022-01-31 21:56:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 461 states have (on average 1.2668112798264641) internal successors, (584), 473 states have internal predecessors, (584), 64 states have call successors, (64), 45 states have call predecessors, (64), 54 states have return successors, (85), 62 states have call predecessors, (85), 57 states have call successors, (85) [2022-01-31 21:56:13,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 733 transitions. [2022-01-31 21:56:13,759 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 733 transitions. Word has length 54 [2022-01-31 21:56:13,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:13,759 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 733 transitions. [2022-01-31 21:56:13,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:13,760 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 733 transitions. [2022-01-31 21:56:13,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 21:56:13,761 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:13,761 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:56:13,761 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 21:56:13,761 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:13,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:13,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1595293189, now seen corresponding path program 1 times [2022-01-31 21:56:13,761 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:13,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1246511216] [2022-01-31 21:56:13,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:13,762 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:13,763 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 21:56:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,988 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 21:56:13,988 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:13,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1246511216] [2022-01-31 21:56:13,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1246511216] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:13,989 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:13,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:56:13,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199516157] [2022-01-31 21:56:13,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:13,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:56:13,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:13,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:56:13,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:13,990 INFO L87 Difference]: Start difference. First operand 580 states and 733 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:14,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:14,824 INFO L93 Difference]: Finished difference Result 877 states and 1118 transitions. [2022-01-31 21:56:14,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:56:14,825 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2022-01-31 21:56:14,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:14,828 INFO L225 Difference]: With dead ends: 877 [2022-01-31 21:56:14,828 INFO L226 Difference]: Without dead ends: 544 [2022-01-31 21:56:14,829 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 21:56:14,831 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 464 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:14,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [470 Valid, 1080 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:14,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-01-31 21:56:14,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 506. [2022-01-31 21:56:14,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 398 states have (on average 1.2487437185929648) internal successors, (497), 406 states have internal predecessors, (497), 60 states have call successors, (60), 43 states have call predecessors, (60), 47 states have return successors, (70), 57 states have call predecessors, (70), 54 states have call successors, (70) [2022-01-31 21:56:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 627 transitions. [2022-01-31 21:56:14,950 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 627 transitions. Word has length 61 [2022-01-31 21:56:14,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:14,950 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 627 transitions. [2022-01-31 21:56:14,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (10), 7 states have call predecessors, (10), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:14,950 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 627 transitions. [2022-01-31 21:56:14,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 21:56:14,951 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:14,951 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 21:56:14,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 21:56:14,952 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:14,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:14,952 INFO L85 PathProgramCache]: Analyzing trace with hash -820540082, now seen corresponding path program 1 times [2022-01-31 21:56:14,952 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:14,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2046558177] [2022-01-31 21:56:14,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:14,953 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:14,954 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:14,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:15,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 21:56:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:15,154 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 21:56:15,154 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:15,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2046558177] [2022-01-31 21:56:15,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2046558177] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:15,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:15,155 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:56:15,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748744304] [2022-01-31 21:56:15,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:15,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:56:15,155 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:15,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:56:15,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:15,156 INFO L87 Difference]: Start difference. First operand 506 states and 627 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:16,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:16,086 INFO L93 Difference]: Finished difference Result 571 states and 711 transitions. [2022-01-31 21:56:16,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:16,087 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2022-01-31 21:56:16,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:16,089 INFO L225 Difference]: With dead ends: 571 [2022-01-31 21:56:16,089 INFO L226 Difference]: Without dead ends: 567 [2022-01-31 21:56:16,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:16,090 INFO L933 BasicCegarLoop]: 336 mSDtfsCounter, 344 mSDsluCounter, 1208 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:16,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 1544 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1488 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:16,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-01-31 21:56:16,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 523. [2022-01-31 21:56:16,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 413 states have (on average 1.2397094430992737) internal successors, (512), 421 states have internal predecessors, (512), 60 states have call successors, (60), 43 states have call predecessors, (60), 49 states have return successors, (77), 59 states have call predecessors, (77), 54 states have call successors, (77) [2022-01-31 21:56:16,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 649 transitions. [2022-01-31 21:56:16,196 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 649 transitions. Word has length 55 [2022-01-31 21:56:16,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:16,196 INFO L470 AbstractCegarLoop]: Abstraction has 523 states and 649 transitions. [2022-01-31 21:56:16,196 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:16,196 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 649 transitions. [2022-01-31 21:56:16,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 21:56:16,197 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:16,197 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 21:56:16,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 21:56:16,198 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:16,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:16,198 INFO L85 PathProgramCache]: Analyzing trace with hash -820263252, now seen corresponding path program 1 times [2022-01-31 21:56:16,198 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:16,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1097354635] [2022-01-31 21:56:16,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:16,199 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:16,200 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:16,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 21:56:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,417 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 21:56:16,417 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:16,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1097354635] [2022-01-31 21:56:16,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1097354635] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:16,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:16,418 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:56:16,418 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389408699] [2022-01-31 21:56:16,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:16,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:56:16,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:16,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:56:16,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:16,419 INFO L87 Difference]: Start difference. First operand 523 states and 649 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:17,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:17,797 INFO L93 Difference]: Finished difference Result 566 states and 699 transitions. [2022-01-31 21:56:17,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:56:17,797 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 55 [2022-01-31 21:56:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:17,799 INFO L225 Difference]: With dead ends: 566 [2022-01-31 21:56:17,799 INFO L226 Difference]: Without dead ends: 551 [2022-01-31 21:56:17,800 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:17,800 INFO L933 BasicCegarLoop]: 340 mSDtfsCounter, 156 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 2145 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1484 SdHoareTripleChecker+Invalid, 2205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:17,801 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 1484 Invalid, 2205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2145 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 21:56:17,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-01-31 21:56:17,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 520. [2022-01-31 21:56:17,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 410 states have (on average 1.2414634146341463) internal successors, (509), 419 states have internal predecessors, (509), 60 states have call successors, (60), 43 states have call predecessors, (60), 49 states have return successors, (76), 58 states have call predecessors, (76), 54 states have call successors, (76) [2022-01-31 21:56:17,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 645 transitions. [2022-01-31 21:56:17,929 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 645 transitions. Word has length 55 [2022-01-31 21:56:17,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:17,929 INFO L470 AbstractCegarLoop]: Abstraction has 520 states and 645 transitions. [2022-01-31 21:56:17,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:17,929 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 645 transitions. [2022-01-31 21:56:17,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-01-31 21:56:17,930 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:17,930 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:17,931 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 21:56:17,931 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:17,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:17,931 INFO L85 PathProgramCache]: Analyzing trace with hash 329966136, now seen corresponding path program 1 times [2022-01-31 21:56:17,931 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:17,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1403939221] [2022-01-31 21:56:17,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:17,932 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:17,933 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:17,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:56:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:56:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,112 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 21:56:18,113 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:18,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1403939221] [2022-01-31 21:56:18,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1403939221] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:18,113 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:18,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:56:18,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17644342] [2022-01-31 21:56:18,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:18,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:56:18,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:18,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:56:18,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:18,114 INFO L87 Difference]: Start difference. First operand 520 states and 645 transitions. Second operand has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 21:56:19,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:19,090 INFO L93 Difference]: Finished difference Result 566 states and 698 transitions. [2022-01-31 21:56:19,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:19,092 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 57 [2022-01-31 21:56:19,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:19,094 INFO L225 Difference]: With dead ends: 566 [2022-01-31 21:56:19,094 INFO L226 Difference]: Without dead ends: 523 [2022-01-31 21:56:19,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:19,095 INFO L933 BasicCegarLoop]: 319 mSDtfsCounter, 420 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:19,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [431 Valid, 793 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:56:19,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-01-31 21:56:19,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 496. [2022-01-31 21:56:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 392 states have (on average 1.2372448979591837) internal successors, (485), 400 states have internal predecessors, (485), 58 states have call successors, (58), 41 states have call predecessors, (58), 45 states have return successors, (72), 55 states have call predecessors, (72), 52 states have call successors, (72) [2022-01-31 21:56:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 615 transitions. [2022-01-31 21:56:19,200 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 615 transitions. Word has length 57 [2022-01-31 21:56:19,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:19,200 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 615 transitions. [2022-01-31 21:56:19,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 21:56:19,200 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 615 transitions. [2022-01-31 21:56:19,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 21:56:19,202 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:19,202 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:19,202 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 21:56:19,202 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:19,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:19,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1260835731, now seen corresponding path program 1 times [2022-01-31 21:56:19,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:19,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1846532355] [2022-01-31 21:56:19,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:19,203 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:19,204 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:19,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:19,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:19,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:19,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:19,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:19,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 21:56:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:19,396 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 21:56:19,397 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:19,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1846532355] [2022-01-31 21:56:19,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1846532355] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:19,397 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:19,397 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:56:19,397 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087300491] [2022-01-31 21:56:19,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:19,397 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:56:19,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:19,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:56:19,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:19,398 INFO L87 Difference]: Start difference. First operand 496 states and 615 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:56:20,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:20,545 INFO L93 Difference]: Finished difference Result 531 states and 655 transitions. [2022-01-31 21:56:20,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:20,545 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 56 [2022-01-31 21:56:20,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:20,547 INFO L225 Difference]: With dead ends: 531 [2022-01-31 21:56:20,547 INFO L226 Difference]: Without dead ends: 513 [2022-01-31 21:56:20,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:56:20,548 INFO L933 BasicCegarLoop]: 317 mSDtfsCounter, 590 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 602 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:20,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [602 Valid, 688 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:56:20,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-01-31 21:56:20,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 478. [2022-01-31 21:56:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 377 states have (on average 1.2413793103448276) internal successors, (468), 384 states have internal predecessors, (468), 57 states have call successors, (57), 41 states have call predecessors, (57), 43 states have return successors, (65), 53 states have call predecessors, (65), 51 states have call successors, (65) [2022-01-31 21:56:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 590 transitions. [2022-01-31 21:56:20,665 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 590 transitions. Word has length 56 [2022-01-31 21:56:20,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:20,665 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 590 transitions. [2022-01-31 21:56:20,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-01-31 21:56:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 590 transitions. [2022-01-31 21:56:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-31 21:56:20,666 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:20,666 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:56:20,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 21:56:20,667 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:20,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:20,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1413489118, now seen corresponding path program 1 times [2022-01-31 21:56:20,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:20,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [931856023] [2022-01-31 21:56:20,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:20,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:20,669 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 21:56:20,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,856 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 21:56:20,856 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:20,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [931856023] [2022-01-31 21:56:20,857 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [931856023] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:20,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:20,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:56:20,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266832375] [2022-01-31 21:56:20,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:20,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:56:20,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:20,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:56:20,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:20,860 INFO L87 Difference]: Start difference. First operand 478 states and 590 transitions. Second operand has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:56:21,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:21,870 INFO L93 Difference]: Finished difference Result 770 states and 962 transitions. [2022-01-31 21:56:21,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:21,871 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2022-01-31 21:56:21,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:21,873 INFO L225 Difference]: With dead ends: 770 [2022-01-31 21:56:21,873 INFO L226 Difference]: Without dead ends: 511 [2022-01-31 21:56:21,873 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 21:56:21,874 INFO L933 BasicCegarLoop]: 309 mSDtfsCounter, 586 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 597 SdHoareTripleChecker+Valid, 831 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:21,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [597 Valid, 831 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-01-31 21:56:21,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 478. [2022-01-31 21:56:21,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 377 states have (on average 1.2360742705570291) internal successors, (466), 384 states have internal predecessors, (466), 57 states have call successors, (57), 41 states have call predecessors, (57), 43 states have return successors, (65), 53 states have call predecessors, (65), 51 states have call successors, (65) [2022-01-31 21:56:21,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 588 transitions. [2022-01-31 21:56:21,967 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 588 transitions. Word has length 65 [2022-01-31 21:56:21,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:21,967 INFO L470 AbstractCegarLoop]: Abstraction has 478 states and 588 transitions. [2022-01-31 21:56:21,967 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (11), 9 states have call predecessors, (11), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:56:21,967 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 588 transitions. [2022-01-31 21:56:21,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 21:56:21,968 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:21,968 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 21:56:21,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 21:56:21,969 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:21,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:21,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1686744212, now seen corresponding path program 1 times [2022-01-31 21:56:21,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:21,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1354443966] [2022-01-31 21:56:21,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:21,969 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:21,971 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:22,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:22,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:22,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:22,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:22,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:22,161 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 21:56:22,161 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:22,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1354443966] [2022-01-31 21:56:22,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1354443966] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:22,162 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:22,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:56:22,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848616983] [2022-01-31 21:56:22,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:22,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:56:22,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:22,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:56:22,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:22,163 INFO L87 Difference]: Start difference. First operand 478 states and 588 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:23,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:23,136 INFO L93 Difference]: Finished difference Result 522 states and 639 transitions. [2022-01-31 21:56:23,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:23,137 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 60 [2022-01-31 21:56:23,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:23,139 INFO L225 Difference]: With dead ends: 522 [2022-01-31 21:56:23,139 INFO L226 Difference]: Without dead ends: 501 [2022-01-31 21:56:23,139 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 21:56:23,140 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 355 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 1887 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:23,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [358 Valid, 1540 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1887 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:56:23,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2022-01-31 21:56:23,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 474. [2022-01-31 21:56:23,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 374 states have (on average 1.2352941176470589) internal successors, (462), 381 states have internal predecessors, (462), 56 states have call successors, (56), 41 states have call predecessors, (56), 43 states have return successors, (64), 52 states have call predecessors, (64), 50 states have call successors, (64) [2022-01-31 21:56:23,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 582 transitions. [2022-01-31 21:56:23,253 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 582 transitions. Word has length 60 [2022-01-31 21:56:23,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:23,253 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 582 transitions. [2022-01-31 21:56:23,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:23,254 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 582 transitions. [2022-01-31 21:56:23,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 21:56:23,255 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:23,255 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 21:56:23,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 21:56:23,255 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:23,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:23,255 INFO L85 PathProgramCache]: Analyzing trace with hash -748372448, now seen corresponding path program 1 times [2022-01-31 21:56:23,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:23,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [292502692] [2022-01-31 21:56:23,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:23,256 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:23,257 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:23,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 21:56:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,452 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 21:56:23,452 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:23,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [292502692] [2022-01-31 21:56:23,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [292502692] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:23,453 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:23,453 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:56:23,453 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638834932] [2022-01-31 21:56:23,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:23,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:56:23,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:23,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:56:23,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:23,454 INFO L87 Difference]: Start difference. First operand 474 states and 582 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 21:56:24,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:24,352 INFO L93 Difference]: Finished difference Result 752 states and 931 transitions. [2022-01-31 21:56:24,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:56:24,353 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2022-01-31 21:56:24,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:24,355 INFO L225 Difference]: With dead ends: 752 [2022-01-31 21:56:24,355 INFO L226 Difference]: Without dead ends: 526 [2022-01-31 21:56:24,355 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 21:56:24,356 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 347 mSDsluCounter, 971 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1298 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:24,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [355 Valid, 1298 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:24,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2022-01-31 21:56:24,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 474. [2022-01-31 21:56:24,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 374 states have (on average 1.2299465240641712) internal successors, (460), 381 states have internal predecessors, (460), 56 states have call successors, (56), 41 states have call predecessors, (56), 43 states have return successors, (64), 52 states have call predecessors, (64), 50 states have call successors, (64) [2022-01-31 21:56:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 580 transitions. [2022-01-31 21:56:24,487 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 580 transitions. Word has length 68 [2022-01-31 21:56:24,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:24,488 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 580 transitions. [2022-01-31 21:56:24,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (11), 8 states have call predecessors, (11), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 21:56:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 580 transitions. [2022-01-31 21:56:24,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 21:56:24,489 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:24,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] [2022-01-31 21:56:24,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 21:56:24,489 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:24,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:24,490 INFO L85 PathProgramCache]: Analyzing trace with hash 923167144, now seen corresponding path program 1 times [2022-01-31 21:56:24,490 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:24,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [716614706] [2022-01-31 21:56:24,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:24,491 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:24,495 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,722 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 21:56:24,722 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:24,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [716614706] [2022-01-31 21:56:24,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [716614706] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:24,722 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:24,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:56:24,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511576584] [2022-01-31 21:56:24,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:24,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:56:24,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:24,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:56:24,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:24,724 INFO L87 Difference]: Start difference. First operand 474 states and 580 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:25,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:25,614 INFO L93 Difference]: Finished difference Result 518 states and 631 transitions. [2022-01-31 21:56:25,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:25,614 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 61 [2022-01-31 21:56:25,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:25,616 INFO L225 Difference]: With dead ends: 518 [2022-01-31 21:56:25,616 INFO L226 Difference]: Without dead ends: 496 [2022-01-31 21:56:25,617 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 21:56:25,618 INFO L933 BasicCegarLoop]: 333 mSDtfsCounter, 399 mSDsluCounter, 1247 mSDsCounter, 0 mSdLazyCounter, 1729 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 1872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 1729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:25,618 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 1580 Invalid, 1872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 1729 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:25,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-01-31 21:56:25,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 469. [2022-01-31 21:56:25,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 370 states have (on average 1.2297297297297298) internal successors, (455), 377 states have internal predecessors, (455), 55 states have call successors, (55), 41 states have call predecessors, (55), 43 states have return successors, (63), 51 states have call predecessors, (63), 49 states have call successors, (63) [2022-01-31 21:56:25,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 573 transitions. [2022-01-31 21:56:25,703 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 573 transitions. Word has length 61 [2022-01-31 21:56:25,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:25,703 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 573 transitions. [2022-01-31 21:56:25,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 573 transitions. [2022-01-31 21:56:25,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 21:56:25,704 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:25,704 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:25,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 21:56:25,704 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:25,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:25,705 INFO L85 PathProgramCache]: Analyzing trace with hash -6944326, now seen corresponding path program 1 times [2022-01-31 21:56:25,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:25,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1419551579] [2022-01-31 21:56:25,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:25,705 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:25,707 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:25,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:25,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:25,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:25,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:25,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:25,918 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:25,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1419551579] [2022-01-31 21:56:25,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1419551579] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:25,919 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:25,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:56:25,920 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179662232] [2022-01-31 21:56:25,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:25,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:56:25,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:25,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:56:25,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:25,921 INFO L87 Difference]: Start difference. First operand 469 states and 573 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:26,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:26,773 INFO L93 Difference]: Finished difference Result 513 states and 624 transitions. [2022-01-31 21:56:26,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:26,774 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 61 [2022-01-31 21:56:26,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:26,776 INFO L225 Difference]: With dead ends: 513 [2022-01-31 21:56:26,776 INFO L226 Difference]: Without dead ends: 492 [2022-01-31 21:56:26,776 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 21:56:26,776 INFO L933 BasicCegarLoop]: 313 mSDtfsCounter, 312 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 1735 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:26,777 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 1452 Invalid, 1838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1735 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:26,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2022-01-31 21:56:26,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 465. [2022-01-31 21:56:26,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 367 states have (on average 1.228882833787466) internal successors, (451), 374 states have internal predecessors, (451), 54 states have call successors, (54), 41 states have call predecessors, (54), 43 states have return successors, (62), 50 states have call predecessors, (62), 48 states have call successors, (62) [2022-01-31 21:56:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 567 transitions. [2022-01-31 21:56:26,893 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 567 transitions. Word has length 61 [2022-01-31 21:56:26,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:26,893 INFO L470 AbstractCegarLoop]: Abstraction has 465 states and 567 transitions. [2022-01-31 21:56:26,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 567 transitions. [2022-01-31 21:56:26,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 21:56:26,894 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:26,894 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:26,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-31 21:56:26,894 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:26,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:26,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1018894417, now seen corresponding path program 1 times [2022-01-31 21:56:26,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:26,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1467166755] [2022-01-31 21:56:26,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:26,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:26,897 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:26,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 21:56:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:27,048 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 21:56:27,048 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:27,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1467166755] [2022-01-31 21:56:27,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1467166755] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:27,049 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:27,049 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:56:27,049 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797743469] [2022-01-31 21:56:27,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:27,049 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:56:27,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:27,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:56:27,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:56:27,050 INFO L87 Difference]: Start difference. First operand 465 states and 567 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:56:27,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:27,921 INFO L93 Difference]: Finished difference Result 889 states and 1094 transitions. [2022-01-31 21:56:27,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:56:27,922 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2022-01-31 21:56:27,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:27,924 INFO L225 Difference]: With dead ends: 889 [2022-01-31 21:56:27,925 INFO L226 Difference]: Without dead ends: 636 [2022-01-31 21:56:27,925 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 21:56:27,926 INFO L933 BasicCegarLoop]: 366 mSDtfsCounter, 466 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:27,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [477 Valid, 879 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:27,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2022-01-31 21:56:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 586. [2022-01-31 21:56:28,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 460 states have (on average 1.2195652173913043) internal successors, (561), 469 states have internal predecessors, (561), 67 states have call successors, (67), 51 states have call predecessors, (67), 58 states have return successors, (87), 66 states have call predecessors, (87), 62 states have call successors, (87) [2022-01-31 21:56:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 715 transitions. [2022-01-31 21:56:28,074 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 715 transitions. Word has length 67 [2022-01-31 21:56:28,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:28,075 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 715 transitions. [2022-01-31 21:56:28,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 3 states have internal predecessors, (48), 3 states have call successors, (12), 9 states have call predecessors, (12), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:56:28,075 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 715 transitions. [2022-01-31 21:56:28,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-31 21:56:28,076 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:28,076 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:28,076 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-31 21:56:28,076 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:28,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:28,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1715322647, now seen corresponding path program 1 times [2022-01-31 21:56:28,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:28,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1087312173] [2022-01-31 21:56:28,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:28,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:28,078 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-01-31 21:56:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:28,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 21:56:28,293 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:28,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1087312173] [2022-01-31 21:56:28,293 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1087312173] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:28,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:28,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:56:28,293 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600660869] [2022-01-31 21:56:28,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:28,293 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:56:28,293 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:28,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:56:28,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:28,294 INFO L87 Difference]: Start difference. First operand 586 states and 715 transitions. Second operand has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:29,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:29,225 INFO L93 Difference]: Finished difference Result 630 states and 767 transitions. [2022-01-31 21:56:29,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:29,225 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 65 [2022-01-31 21:56:29,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:29,227 INFO L225 Difference]: With dead ends: 630 [2022-01-31 21:56:29,227 INFO L226 Difference]: Without dead ends: 587 [2022-01-31 21:56:29,228 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 21:56:29,228 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 273 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1432 SdHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:29,229 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 1432 Invalid, 1873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:56:29,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-01-31 21:56:29,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 560. [2022-01-31 21:56:29,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 439 states have (on average 1.2186788154897494) internal successors, (535), 448 states have internal predecessors, (535), 64 states have call successors, (64), 49 states have call predecessors, (64), 56 states have return successors, (84), 63 states have call predecessors, (84), 59 states have call successors, (84) [2022-01-31 21:56:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 683 transitions. [2022-01-31 21:56:29,340 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 683 transitions. Word has length 65 [2022-01-31 21:56:29,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:29,340 INFO L470 AbstractCegarLoop]: Abstraction has 560 states and 683 transitions. [2022-01-31 21:56:29,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.7857142857142856) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:29,340 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 683 transitions. [2022-01-31 21:56:29,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-31 21:56:29,341 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:29,341 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:29,341 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-31 21:56:29,342 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:29,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:29,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1497395800, now seen corresponding path program 1 times [2022-01-31 21:56:29,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:29,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2042447065] [2022-01-31 21:56:29,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:29,342 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:29,345 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:29,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 21:56:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:29,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:29,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-01-31 21:56:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:29,542 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:29,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2042447065] [2022-01-31 21:56:29,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2042447065] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:29,542 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:29,542 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:56:29,542 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793167456] [2022-01-31 21:56:29,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:29,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:56:29,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:29,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:56:29,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:56:29,544 INFO L87 Difference]: Start difference. First operand 560 states and 683 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 21:56:30,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:30,439 INFO L93 Difference]: Finished difference Result 892 states and 1092 transitions. [2022-01-31 21:56:30,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:56:30,439 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 79 [2022-01-31 21:56:30,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:30,441 INFO L225 Difference]: With dead ends: 892 [2022-01-31 21:56:30,441 INFO L226 Difference]: Without dead ends: 575 [2022-01-31 21:56:30,442 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:56:30,443 INFO L933 BasicCegarLoop]: 406 mSDtfsCounter, 511 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:30,443 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [518 Valid, 1041 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 913 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:56:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-01-31 21:56:30,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 542. [2022-01-31 21:56:30,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 425 states have (on average 1.2188235294117646) internal successors, (518), 433 states have internal predecessors, (518), 62 states have call successors, (62), 49 states have call predecessors, (62), 54 states have return successors, (73), 60 states have call predecessors, (73), 57 states have call successors, (73) [2022-01-31 21:56:30,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 653 transitions. [2022-01-31 21:56:30,541 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 653 transitions. Word has length 79 [2022-01-31 21:56:30,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:30,541 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 653 transitions. [2022-01-31 21:56:30,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 21:56:30,541 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 653 transitions. [2022-01-31 21:56:30,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-31 21:56:30,542 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:30,542 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:30,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-31 21:56:30,543 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:30,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:30,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1454956329, now seen corresponding path program 1 times [2022-01-31 21:56:30,543 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:30,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [613346987] [2022-01-31 21:56:30,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:30,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:30,545 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:30,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:30,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:30,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:30,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:30,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 21:56:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:30,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:30,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:30,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:30,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:30,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-01-31 21:56:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:30,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:30,780 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 21:56:30,780 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:30,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [613346987] [2022-01-31 21:56:30,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [613346987] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:30,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:30,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:56:30,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22469579] [2022-01-31 21:56:30,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:30,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:56:30,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:30,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:56:30,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:30,782 INFO L87 Difference]: Start difference. First operand 542 states and 653 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 21:56:31,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:31,759 INFO L93 Difference]: Finished difference Result 905 states and 1127 transitions. [2022-01-31 21:56:31,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 21:56:31,760 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 80 [2022-01-31 21:56:31,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:31,762 INFO L225 Difference]: With dead ends: 905 [2022-01-31 21:56:31,762 INFO L226 Difference]: Without dead ends: 651 [2022-01-31 21:56:31,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:56:31,763 INFO L933 BasicCegarLoop]: 351 mSDtfsCounter, 464 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:31,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [475 Valid, 1579 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:31,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2022-01-31 21:56:31,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 506. [2022-01-31 21:56:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 401 states have (on average 1.2194513715710724) internal successors, (489), 407 states have internal predecessors, (489), 55 states have call successors, (55), 43 states have call predecessors, (55), 49 states have return successors, (63), 56 states have call predecessors, (63), 51 states have call successors, (63) [2022-01-31 21:56:31,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 607 transitions. [2022-01-31 21:56:31,871 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 607 transitions. Word has length 80 [2022-01-31 21:56:31,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:31,871 INFO L470 AbstractCegarLoop]: Abstraction has 506 states and 607 transitions. [2022-01-31 21:56:31,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (14), 10 states have call predecessors, (14), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 21:56:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 607 transitions. [2022-01-31 21:56:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-01-31 21:56:31,873 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:31,873 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:31,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-31 21:56:31,873 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:31,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:31,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1018185184, now seen corresponding path program 1 times [2022-01-31 21:56:31,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:31,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [652240179] [2022-01-31 21:56:31,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:31,874 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:31,875 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:31,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:31,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:32,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:32,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:32,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:32,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:32,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:32,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:32,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:32,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 21:56:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:32,138 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 21:56:32,138 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:32,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [652240179] [2022-01-31 21:56:32,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [652240179] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:32,139 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:32,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:56:32,139 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931012117] [2022-01-31 21:56:32,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:32,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:56:32,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:32,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:56:32,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:32,140 INFO L87 Difference]: Start difference. First operand 506 states and 607 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 21:56:33,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:33,363 INFO L93 Difference]: Finished difference Result 584 states and 699 transitions. [2022-01-31 21:56:33,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 21:56:33,363 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2022-01-31 21:56:33,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:33,366 INFO L225 Difference]: With dead ends: 584 [2022-01-31 21:56:33,366 INFO L226 Difference]: Without dead ends: 563 [2022-01-31 21:56:33,366 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 15 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 21:56:33,367 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 270 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 1948 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1763 SdHoareTripleChecker+Invalid, 2046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:33,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 1763 Invalid, 2046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1948 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:56:33,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-01-31 21:56:33,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 514. [2022-01-31 21:56:33,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 408 states have (on average 1.2156862745098038) internal successors, (496), 414 states have internal predecessors, (496), 55 states have call successors, (55), 43 states have call predecessors, (55), 50 states have return successors, (66), 57 states have call predecessors, (66), 51 states have call successors, (66) [2022-01-31 21:56:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 617 transitions. [2022-01-31 21:56:33,477 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 617 transitions. Word has length 85 [2022-01-31 21:56:33,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:33,477 INFO L470 AbstractCegarLoop]: Abstraction has 514 states and 617 transitions. [2022-01-31 21:56:33,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 7 states have internal predecessors, (65), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 21:56:33,477 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 617 transitions. [2022-01-31 21:56:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-01-31 21:56:33,478 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:33,478 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:33,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-31 21:56:33,480 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:33,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:33,480 INFO L85 PathProgramCache]: Analyzing trace with hash 20545018, now seen corresponding path program 1 times [2022-01-31 21:56:33,480 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:33,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1268548419] [2022-01-31 21:56:33,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:33,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:33,482 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:33,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:33,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:33,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:33,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:33,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:56:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:33,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:33,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 21:56:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:33,693 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 21:56:33,694 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:33,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1268548419] [2022-01-31 21:56:33,694 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1268548419] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:33,694 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:33,694 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:56:33,694 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839936360] [2022-01-31 21:56:33,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:33,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:56:33,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:33,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:56:33,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:33,695 INFO L87 Difference]: Start difference. First operand 514 states and 617 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 5 states have internal predecessors, (64), 5 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-31 21:56:34,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:34,853 INFO L93 Difference]: Finished difference Result 1003 states and 1185 transitions. [2022-01-31 21:56:34,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:56:34,853 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 5 states have internal predecessors, (64), 5 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 80 [2022-01-31 21:56:34,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:34,855 INFO L225 Difference]: With dead ends: 1003 [2022-01-31 21:56:34,855 INFO L226 Difference]: Without dead ends: 667 [2022-01-31 21:56:34,856 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 15 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 21:56:34,856 INFO L933 BasicCegarLoop]: 331 mSDtfsCounter, 797 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:34,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [804 Valid, 572 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:56:34,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-01-31 21:56:34,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 635. [2022-01-31 21:56:34,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 505 states have (on average 1.205940594059406) internal successors, (609), 513 states have internal predecessors, (609), 63 states have call successors, (63), 55 states have call predecessors, (63), 66 states have return successors, (77), 67 states have call predecessors, (77), 59 states have call successors, (77) [2022-01-31 21:56:34,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 749 transitions. [2022-01-31 21:56:34,988 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 749 transitions. Word has length 80 [2022-01-31 21:56:34,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:34,989 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 749 transitions. [2022-01-31 21:56:34,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 5 states have internal predecessors, (64), 5 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-31 21:56:34,989 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 749 transitions. [2022-01-31 21:56:34,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-01-31 21:56:34,990 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:34,990 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:34,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-31 21:56:34,990 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:34,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:34,991 INFO L85 PathProgramCache]: Analyzing trace with hash -609741853, now seen corresponding path program 1 times [2022-01-31 21:56:34,991 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:34,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [353199372] [2022-01-31 21:56:34,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:34,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:34,993 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:35,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:35,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:35,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:35,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:35,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:35,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:35,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:35,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:35,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:35,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:35,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:35,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-31 21:56:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:35,255 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 21:56:35,256 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:35,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [353199372] [2022-01-31 21:56:35,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [353199372] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:35,256 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:35,256 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:56:35,256 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722479428] [2022-01-31 21:56:35,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:35,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:56:35,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:35,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:56:35,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:35,258 INFO L87 Difference]: Start difference. First operand 635 states and 749 transitions. Second operand has 16 states, 16 states have (on average 4.125) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 21:56:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:36,242 INFO L93 Difference]: Finished difference Result 685 states and 801 transitions. [2022-01-31 21:56:36,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 21:56:36,242 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) Word has length 86 [2022-01-31 21:56:36,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:36,244 INFO L225 Difference]: With dead ends: 685 [2022-01-31 21:56:36,244 INFO L226 Difference]: Without dead ends: 664 [2022-01-31 21:56:36,244 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 21:56:36,245 INFO L933 BasicCegarLoop]: 303 mSDtfsCounter, 429 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 1666 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 1826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:36,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [433 Valid, 1675 Invalid, 1826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1666 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:36,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2022-01-31 21:56:36,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 627. [2022-01-31 21:56:36,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 498 states have (on average 1.2068273092369477) internal successors, (601), 506 states have internal predecessors, (601), 63 states have call successors, (63), 55 states have call predecessors, (63), 65 states have return successors, (75), 66 states have call predecessors, (75), 59 states have call successors, (75) [2022-01-31 21:56:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 739 transitions. [2022-01-31 21:56:36,371 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 739 transitions. Word has length 86 [2022-01-31 21:56:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:36,371 INFO L470 AbstractCegarLoop]: Abstraction has 627 states and 739 transitions. [2022-01-31 21:56:36,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.125) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (11), 9 states have call predecessors, (11), 3 states have return successors, (9), 4 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 21:56:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 739 transitions. [2022-01-31 21:56:36,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-31 21:56:36,372 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:36,372 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:36,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-31 21:56:36,372 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:36,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:36,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1602369481, now seen corresponding path program 1 times [2022-01-31 21:56:36,373 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:36,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [948430699] [2022-01-31 21:56:36,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:36,373 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:36,374 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:36,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:36,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:36,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:36,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:36,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:36,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:36,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:36,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:56:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:36,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:36,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-31 21:56:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:36,542 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:36,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [948430699] [2022-01-31 21:56:36,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [948430699] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:36,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:36,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:56:36,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071450575] [2022-01-31 21:56:36,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:36,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:56:36,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:36,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:56:36,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:36,544 INFO L87 Difference]: Start difference. First operand 627 states and 739 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:56:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:37,438 INFO L93 Difference]: Finished difference Result 645 states and 757 transitions. [2022-01-31 21:56:37,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:37,439 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 81 [2022-01-31 21:56:37,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:37,440 INFO L225 Difference]: With dead ends: 645 [2022-01-31 21:56:37,440 INFO L226 Difference]: Without dead ends: 581 [2022-01-31 21:56:37,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:37,441 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 313 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:37,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [326 Valid, 444 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:56:37,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-01-31 21:56:37,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2022-01-31 21:56:37,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 456 states have (on average 1.206140350877193) internal successors, (550), 464 states have internal predecessors, (550), 61 states have call successors, (61), 53 states have call predecessors, (61), 61 states have return successors, (71), 62 states have call predecessors, (71), 57 states have call successors, (71) [2022-01-31 21:56:37,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 682 transitions. [2022-01-31 21:56:37,553 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 682 transitions. Word has length 81 [2022-01-31 21:56:37,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:37,553 INFO L470 AbstractCegarLoop]: Abstraction has 579 states and 682 transitions. [2022-01-31 21:56:37,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 3 states have internal predecessors, (65), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:56:37,553 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 682 transitions. [2022-01-31 21:56:37,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-01-31 21:56:37,554 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:37,554 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:37,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-31 21:56:37,555 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:37,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:37,555 INFO L85 PathProgramCache]: Analyzing trace with hash 577455992, now seen corresponding path program 1 times [2022-01-31 21:56:37,555 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:37,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1533604458] [2022-01-31 21:56:37,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:37,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:37,557 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:37,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:56:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 21:56:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 21:56:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,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 21:56:37,793 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:37,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1533604458] [2022-01-31 21:56:37,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1533604458] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:37,794 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:37,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:56:37,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533240711] [2022-01-31 21:56:37,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:37,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:56:37,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:37,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:56:37,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:37,797 INFO L87 Difference]: Start difference. First operand 579 states and 682 transitions. Second operand has 16 states, 16 states have (on average 4.5) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-31 21:56:38,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:38,835 INFO L93 Difference]: Finished difference Result 583 states and 685 transitions. [2022-01-31 21:56:38,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:56:38,835 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) Word has length 90 [2022-01-31 21:56:38,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:38,837 INFO L225 Difference]: With dead ends: 583 [2022-01-31 21:56:38,837 INFO L226 Difference]: Without dead ends: 495 [2022-01-31 21:56:38,837 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 21:56:38,837 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 628 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 2095 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 2312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 2095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:38,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [641 Valid, 611 Invalid, 2312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 2095 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:56:38,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-01-31 21:56:38,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 493. [2022-01-31 21:56:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 384 states have (on average 1.2083333333333333) internal successors, (464), 391 states have internal predecessors, (464), 54 states have call successors, (54), 47 states have call predecessors, (54), 54 states have return successors, (64), 55 states have call predecessors, (64), 51 states have call successors, (64) [2022-01-31 21:56:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 582 transitions. [2022-01-31 21:56:38,945 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 582 transitions. Word has length 90 [2022-01-31 21:56:38,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:38,946 INFO L470 AbstractCegarLoop]: Abstraction has 493 states and 582 transitions. [2022-01-31 21:56:38,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.5) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-31 21:56:38,946 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 582 transitions. [2022-01-31 21:56:38,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-31 21:56:38,946 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:38,947 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:38,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-31 21:56:38,947 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:38,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:38,947 INFO L85 PathProgramCache]: Analyzing trace with hash -950683054, now seen corresponding path program 1 times [2022-01-31 21:56:38,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:38,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1364508750] [2022-01-31 21:56:38,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:38,947 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:38,948 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:39,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:39,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-01-31 21:56:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-31 21:56:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,148 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 21:56:39,148 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:39,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1364508750] [2022-01-31 21:56:39,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1364508750] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:39,148 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:39,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:56:39,148 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610074506] [2022-01-31 21:56:39,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:39,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:56:39,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:39,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:56:39,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:39,150 INFO L87 Difference]: Start difference. First operand 493 states and 582 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-31 21:56:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:39,572 INFO L93 Difference]: Finished difference Result 528 states and 616 transitions. [2022-01-31 21:56:39,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:39,572 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 96 [2022-01-31 21:56:39,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:39,574 INFO L225 Difference]: With dead ends: 528 [2022-01-31 21:56:39,574 INFO L226 Difference]: Without dead ends: 489 [2022-01-31 21:56:39,575 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:39,575 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 194 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:39,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 861 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:56:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2022-01-31 21:56:39,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 436. [2022-01-31 21:56:39,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 340 states have (on average 1.1970588235294117) internal successors, (407), 346 states have internal predecessors, (407), 47 states have call successors, (47), 42 states have call predecessors, (47), 48 states have return successors, (55), 48 states have call predecessors, (55), 44 states have call successors, (55) [2022-01-31 21:56:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 509 transitions. [2022-01-31 21:56:39,703 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 509 transitions. Word has length 96 [2022-01-31 21:56:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:39,704 INFO L470 AbstractCegarLoop]: Abstraction has 436 states and 509 transitions. [2022-01-31 21:56:39,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (12), 10 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-31 21:56:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 509 transitions. [2022-01-31 21:56:39,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-01-31 21:56:39,705 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:39,705 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:39,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-31 21:56:39,705 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:39,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:39,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1418124295, now seen corresponding path program 1 times [2022-01-31 21:56:39,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:39,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1739129460] [2022-01-31 21:56:39,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:39,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:39,707 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:39,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-31 21:56:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-01-31 21:56:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:39,955 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 21:56:39,955 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:39,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1739129460] [2022-01-31 21:56:39,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1739129460] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:39,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:39,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:56:39,955 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29918695] [2022-01-31 21:56:39,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:39,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:56:39,956 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:39,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:56:39,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:56:39,957 INFO L87 Difference]: Start difference. First operand 436 states and 509 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-31 21:56:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:41,004 INFO L93 Difference]: Finished difference Result 836 states and 980 transitions. [2022-01-31 21:56:41,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 21:56:41,004 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 96 [2022-01-31 21:56:41,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:41,007 INFO L225 Difference]: With dead ends: 836 [2022-01-31 21:56:41,007 INFO L226 Difference]: Without dead ends: 791 [2022-01-31 21:56:41,007 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 21:56:41,008 INFO L933 BasicCegarLoop]: 342 mSDtfsCounter, 353 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 1604 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:41,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [362 Valid, 1604 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:41,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2022-01-31 21:56:41,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 416. [2022-01-31 21:56:41,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 324 states have (on average 1.1975308641975309) internal successors, (388), 329 states have internal predecessors, (388), 44 states have call successors, (44), 41 states have call predecessors, (44), 47 states have return successors, (52), 45 states have call predecessors, (52), 41 states have call successors, (52) [2022-01-31 21:56:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 484 transitions. [2022-01-31 21:56:41,098 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 484 transitions. Word has length 96 [2022-01-31 21:56:41,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:41,098 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 484 transitions. [2022-01-31 21:56:41,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (12), 10 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-31 21:56:41,098 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 484 transitions. [2022-01-31 21:56:41,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-31 21:56:41,099 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:41,099 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:41,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-31 21:56:41,099 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:41,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:41,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2046322684, now seen corresponding path program 1 times [2022-01-31 21:56:41,100 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:41,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1637819649] [2022-01-31 21:56:41,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:41,100 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:41,102 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:41,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:41,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:41,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:41,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:41,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:56:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:41,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:41,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:41,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:41,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:41,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:41,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:56:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:41,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:41,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-31 21:56:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:41,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:41,426 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:41,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1637819649] [2022-01-31 21:56:41,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1637819649] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:41,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:41,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:56:41,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378556266] [2022-01-31 21:56:41,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:41,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:56:41,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:41,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:56:41,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:56:41,428 INFO L87 Difference]: Start difference. First operand 416 states and 484 transitions. Second operand has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2022-01-31 21:56:42,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:42,220 INFO L93 Difference]: Finished difference Result 558 states and 653 transitions. [2022-01-31 21:56:42,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 21:56:42,221 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2022-01-31 21:56:42,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:42,222 INFO L225 Difference]: With dead ends: 558 [2022-01-31 21:56:42,222 INFO L226 Difference]: Without dead ends: 435 [2022-01-31 21:56:42,222 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 21:56:42,223 INFO L933 BasicCegarLoop]: 176 mSDtfsCounter, 131 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 1335 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:42,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 1111 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1335 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:56:42,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2022-01-31 21:56:42,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 425. [2022-01-31 21:56:42,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 332 states have (on average 1.1837349397590362) internal successors, (393), 338 states have internal predecessors, (393), 45 states have call successors, (45), 41 states have call predecessors, (45), 47 states have return successors, (52), 45 states have call predecessors, (52), 41 states have call successors, (52) [2022-01-31 21:56:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 490 transitions. [2022-01-31 21:56:42,334 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 490 transitions. Word has length 101 [2022-01-31 21:56:42,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:42,334 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 490 transitions. [2022-01-31 21:56:42,334 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 7 states have internal predecessors, (75), 3 states have call successors, (14), 12 states have call predecessors, (14), 3 states have return successors, (12), 4 states have call predecessors, (12), 2 states have call successors, (12) [2022-01-31 21:56:42,334 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 490 transitions. [2022-01-31 21:56:42,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-01-31 21:56:42,335 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:42,335 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:42,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-31 21:56:42,335 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:42,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:42,335 INFO L85 PathProgramCache]: Analyzing trace with hash 499266527, now seen corresponding path program 1 times [2022-01-31 21:56:42,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:42,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1412610668] [2022-01-31 21:56:42,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:42,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:42,337 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:42,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:42,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:42,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:42,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:42,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 21:56:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:42,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:42,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:42,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:42,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 21:56:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:42,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:42,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:42,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:56:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:42,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:42,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:42,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:42,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:42,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:42,567 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 21:56:42,567 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:42,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1412610668] [2022-01-31 21:56:42,567 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1412610668] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:42,567 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:42,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:56:42,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079432190] [2022-01-31 21:56:42,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:42,568 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:56:42,568 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:42,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:56:42,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:42,569 INFO L87 Difference]: Start difference. First operand 425 states and 490 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-31 21:56:43,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:43,068 INFO L93 Difference]: Finished difference Result 460 states and 524 transitions. [2022-01-31 21:56:43,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:56:43,068 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) Word has length 110 [2022-01-31 21:56:43,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:43,069 INFO L225 Difference]: With dead ends: 460 [2022-01-31 21:56:43,069 INFO L226 Difference]: Without dead ends: 376 [2022-01-31 21:56:43,070 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 21:56:43,070 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 161 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:43,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 869 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:56:43,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-01-31 21:56:43,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 242. [2022-01-31 21:56:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 189 states have (on average 1.1428571428571428) internal successors, (216), 191 states have internal predecessors, (216), 26 states have call successors, (26), 26 states have call predecessors, (26), 26 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2022-01-31 21:56:43,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 268 transitions. [2022-01-31 21:56:43,138 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 268 transitions. Word has length 110 [2022-01-31 21:56:43,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:43,138 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 268 transitions. [2022-01-31 21:56:43,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (15), 10 states have call predecessors, (15), 3 states have return successors, (10), 3 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-31 21:56:43,138 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 268 transitions. [2022-01-31 21:56:43,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-31 21:56:43,139 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:43,139 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:43,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-31 21:56:43,139 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:43,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:43,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1316472481, now seen corresponding path program 1 times [2022-01-31 21:56:43,140 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:43,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1712377921] [2022-01-31 21:56:43,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:43,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:43,141 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:56:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:43,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:56:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 21:56:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 21:56:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,397 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 21:56:43,398 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:43,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1712377921] [2022-01-31 21:56:43,398 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1712377921] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:43,398 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:43,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:56:43,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895589119] [2022-01-31 21:56:43,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:43,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:56:43,399 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:43,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:56:43,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:56:43,400 INFO L87 Difference]: Start difference. First operand 242 states and 268 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 21:56:43,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:43,973 INFO L93 Difference]: Finished difference Result 286 states and 315 transitions. [2022-01-31 21:56:43,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:43,974 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2022-01-31 21:56:43,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:43,975 INFO L225 Difference]: With dead ends: 286 [2022-01-31 21:56:43,975 INFO L226 Difference]: Without dead ends: 256 [2022-01-31 21:56:43,975 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 21:56:43,975 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 250 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:43,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 724 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:56:43,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-01-31 21:56:44,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 246. [2022-01-31 21:56:44,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 192 states have (on average 1.140625) internal successors, (219), 194 states have internal predecessors, (219), 26 states have call successors, (26), 26 states have call predecessors, (26), 27 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2022-01-31 21:56:44,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 272 transitions. [2022-01-31 21:56:44,046 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 272 transitions. Word has length 117 [2022-01-31 21:56:44,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:44,046 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 272 transitions. [2022-01-31 21:56:44,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 21:56:44,046 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 272 transitions. [2022-01-31 21:56:44,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-01-31 21:56:44,047 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:44,047 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:44,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-31 21:56:44,047 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:44,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:44,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1497958978, now seen corresponding path program 1 times [2022-01-31 21:56:44,047 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:44,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1681314693] [2022-01-31 21:56:44,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:44,048 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:44,049 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:44,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:44,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:56:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:44,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:44,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:56:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-31 21:56:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-01-31 21:56:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,302 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 21:56:44,302 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:44,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1681314693] [2022-01-31 21:56:44,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1681314693] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:44,303 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:44,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:56:44,304 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717303098] [2022-01-31 21:56:44,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:44,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:56:44,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:44,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:56:44,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:56:44,305 INFO L87 Difference]: Start difference. First operand 246 states and 272 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 21:56:44,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:44,721 INFO L93 Difference]: Finished difference Result 332 states and 370 transitions. [2022-01-31 21:56:44,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:44,721 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2022-01-31 21:56:44,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:44,722 INFO L225 Difference]: With dead ends: 332 [2022-01-31 21:56:44,722 INFO L226 Difference]: Without dead ends: 252 [2022-01-31 21:56:44,723 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 21:56:44,732 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 323 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:44,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [323 Valid, 658 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:56:44,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-01-31 21:56:44,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 246. [2022-01-31 21:56:44,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 192 states have (on average 1.1354166666666667) internal successors, (218), 194 states have internal predecessors, (218), 26 states have call successors, (26), 26 states have call predecessors, (26), 27 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2022-01-31 21:56:44,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 271 transitions. [2022-01-31 21:56:44,797 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 271 transitions. Word has length 117 [2022-01-31 21:56:44,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:44,797 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 271 transitions. [2022-01-31 21:56:44,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (15), 12 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2022-01-31 21:56:44,797 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 271 transitions. [2022-01-31 21:56:44,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-01-31 21:56:44,798 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:44,799 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:44,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-31 21:56:44,799 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:44,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:44,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1606855094, now seen corresponding path program 1 times [2022-01-31 21:56:44,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:44,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [172532429] [2022-01-31 21:56:44,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:44,800 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:44,800 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:44,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:44,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:44,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:45,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:56:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:45,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:45,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:45,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:45,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:45,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:45,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:56:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:45,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:45,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:56:45,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:45,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:45,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:45,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:45,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:45,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-01-31 21:56:45,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:45,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-31 21:56:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:45,264 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 21:56:45,264 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:45,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [172532429] [2022-01-31 21:56:45,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [172532429] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:45,264 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:45,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 21:56:45,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936866276] [2022-01-31 21:56:45,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:45,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 21:56:45,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:45,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 21:56:45,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=515, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:56:45,266 INFO L87 Difference]: Start difference. First operand 246 states and 271 transitions. Second operand has 25 states, 25 states have (on average 3.92) internal successors, (98), 11 states have internal predecessors, (98), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 21:56:46,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:46,208 INFO L93 Difference]: Finished difference Result 318 states and 359 transitions. [2022-01-31 21:56:46,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-01-31 21:56:46,208 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 11 states have internal predecessors, (98), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 147 [2022-01-31 21:56:46,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:46,210 INFO L225 Difference]: With dead ends: 318 [2022-01-31 21:56:46,210 INFO L226 Difference]: Without dead ends: 283 [2022-01-31 21:56:46,210 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=1042, Unknown=0, NotChecked=0, Total=1190 [2022-01-31 21:56:46,211 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 290 mSDsluCounter, 1218 mSDsCounter, 0 mSdLazyCounter, 1765 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:46,211 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 1382 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1765 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:46,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-01-31 21:56:46,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 263. [2022-01-31 21:56:46,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 207 states have (on average 1.144927536231884) internal successors, (237), 209 states have internal predecessors, (237), 26 states have call successors, (26), 26 states have call predecessors, (26), 29 states have return successors, (29), 27 states have call predecessors, (29), 24 states have call successors, (29) [2022-01-31 21:56:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 292 transitions. [2022-01-31 21:56:46,286 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 292 transitions. Word has length 147 [2022-01-31 21:56:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:46,286 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 292 transitions. [2022-01-31 21:56:46,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.92) internal successors, (98), 11 states have internal predecessors, (98), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 21:56:46,286 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 292 transitions. [2022-01-31 21:56:46,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-01-31 21:56:46,287 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:46,287 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:46,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-31 21:56:46,287 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:46,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:46,288 INFO L85 PathProgramCache]: Analyzing trace with hash 470260381, now seen corresponding path program 1 times [2022-01-31 21:56:46,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:46,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [306719690] [2022-01-31 21:56:46,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:46,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:46,289 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:46,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:56:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:56:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:56:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-01-31 21:56:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-31 21:56:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,683 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 21:56:46,683 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:46,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [306719690] [2022-01-31 21:56:46,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [306719690] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:46,683 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:46,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-01-31 21:56:46,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132120035] [2022-01-31 21:56:46,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:46,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-31 21:56:46,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:46,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-31 21:56:46,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-01-31 21:56:46,685 INFO L87 Difference]: Start difference. First operand 263 states and 292 transitions. Second operand has 24 states, 24 states have (on average 4.166666666666667) internal successors, (100), 10 states have internal predecessors, (100), 2 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 21:56:47,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:47,552 INFO L93 Difference]: Finished difference Result 358 states and 401 transitions. [2022-01-31 21:56:47,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 21:56:47,553 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.166666666666667) internal successors, (100), 10 states have internal predecessors, (100), 2 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 148 [2022-01-31 21:56:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:47,554 INFO L225 Difference]: With dead ends: 358 [2022-01-31 21:56:47,554 INFO L226 Difference]: Without dead ends: 277 [2022-01-31 21:56:47,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2022-01-31 21:56:47,565 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 208 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 1773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:47,565 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 1552 Invalid, 1773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1689 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:47,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-01-31 21:56:47,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 263. [2022-01-31 21:56:47,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 207 states have (on average 1.1400966183574879) internal successors, (236), 209 states have internal predecessors, (236), 26 states have call successors, (26), 26 states have call predecessors, (26), 29 states have return successors, (29), 27 states have call predecessors, (29), 24 states have call successors, (29) [2022-01-31 21:56:47,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 291 transitions. [2022-01-31 21:56:47,664 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 291 transitions. Word has length 148 [2022-01-31 21:56:47,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:47,664 INFO L470 AbstractCegarLoop]: Abstraction has 263 states and 291 transitions. [2022-01-31 21:56:47,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.166666666666667) internal successors, (100), 10 states have internal predecessors, (100), 2 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-01-31 21:56:47,665 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 291 transitions. [2022-01-31 21:56:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-01-31 21:56:47,665 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:47,666 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 21:56:47,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-31 21:56:47,666 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:47,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:47,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1786465971, now seen corresponding path program 1 times [2022-01-31 21:56:47,666 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:47,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2011434557] [2022-01-31 21:56:47,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:47,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:47,668 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:47,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:47,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:47,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:47,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:47,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:56:47,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:47,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:47,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:47,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:47,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:47,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:56:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:47,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:47,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:56:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:48,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:48,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:48,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:48,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:48,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-01-31 21:56:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:48,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-01-31 21:56:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:48,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-01-31 21:56:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:48,032 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 21:56:48,032 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:48,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2011434557] [2022-01-31 21:56:48,032 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2011434557] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:48,032 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:48,032 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 21:56:48,032 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774635161] [2022-01-31 21:56:48,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:48,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 21:56:48,033 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:48,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 21:56:48,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=343, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:56:48,033 INFO L87 Difference]: Start difference. First operand 263 states and 291 transitions. Second operand has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 8 states have internal predecessors, (93), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-31 21:56:48,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:48,901 INFO L93 Difference]: Finished difference Result 304 states and 339 transitions. [2022-01-31 21:56:48,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 21:56:48,901 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 8 states have internal predecessors, (93), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) Word has length 150 [2022-01-31 21:56:48,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:48,902 INFO L225 Difference]: With dead ends: 304 [2022-01-31 21:56:48,902 INFO L226 Difference]: Without dead ends: 263 [2022-01-31 21:56:48,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:56:48,903 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 252 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 1132 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:48,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [257 Valid, 1132 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:56:48,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-01-31 21:56:48,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 257. [2022-01-31 21:56:48,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 203 states have (on average 1.1280788177339902) internal successors, (229), 205 states have internal predecessors, (229), 25 states have call successors, (25), 25 states have call predecessors, (25), 28 states have return successors, (28), 26 states have call predecessors, (28), 23 states have call successors, (28) [2022-01-31 21:56:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 282 transitions. [2022-01-31 21:56:48,979 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 282 transitions. Word has length 150 [2022-01-31 21:56:48,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:48,980 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 282 transitions. [2022-01-31 21:56:48,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.428571428571429) internal successors, (93), 8 states have internal predecessors, (93), 3 states have call successors, (17), 12 states have call predecessors, (17), 4 states have return successors, (15), 5 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-31 21:56:48,980 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 282 transitions. [2022-01-31 21:56:48,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-01-31 21:56:48,981 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:48,981 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:48,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-31 21:56:48,981 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:48,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:48,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1782392170, now seen corresponding path program 1 times [2022-01-31 21:56:48,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:48,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1869562806] [2022-01-31 21:56:48,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:48,982 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:48,983 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:49,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:56:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:49,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:56:49,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:56:49,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-01-31 21:56:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-01-31 21:56:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-01-31 21:56:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,274 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 21:56:49,275 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:49,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1869562806] [2022-01-31 21:56:49,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1869562806] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:49,275 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:49,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:56:49,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562146253] [2022-01-31 21:56:49,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:49,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:56:49,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:49,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:56:49,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:56:49,276 INFO L87 Difference]: Start difference. First operand 257 states and 282 transitions. Second operand has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 5 states have internal predecessors, (98), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-01-31 21:56:49,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:49,805 INFO L93 Difference]: Finished difference Result 318 states and 348 transitions. [2022-01-31 21:56:49,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:49,805 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 5 states have internal predecessors, (98), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 155 [2022-01-31 21:56:49,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:49,806 INFO L225 Difference]: With dead ends: 318 [2022-01-31 21:56:49,806 INFO L226 Difference]: Without dead ends: 243 [2022-01-31 21:56:49,807 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2022-01-31 21:56:49,807 INFO L933 BasicCegarLoop]: 143 mSDtfsCounter, 330 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:49,807 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [332 Valid, 501 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:56:49,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-01-31 21:56:49,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 229. [2022-01-31 21:56:49,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 179 states have (on average 1.111731843575419) internal successors, (199), 181 states have internal predecessors, (199), 24 states have call successors, (24), 24 states have call predecessors, (24), 25 states have return successors, (25), 23 states have call predecessors, (25), 22 states have call successors, (25) [2022-01-31 21:56:49,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 248 transitions. [2022-01-31 21:56:49,867 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 248 transitions. Word has length 155 [2022-01-31 21:56:49,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:49,868 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 248 transitions. [2022-01-31 21:56:49,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.533333333333333) internal successors, (98), 5 states have internal predecessors, (98), 4 states have call successors, (17), 12 states have call predecessors, (17), 2 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-01-31 21:56:49,868 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 248 transitions. [2022-01-31 21:56:49,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-01-31 21:56:49,868 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:49,868 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:49,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-31 21:56:49,869 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:49,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:49,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1939794977, now seen corresponding path program 1 times [2022-01-31 21:56:49,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:49,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [50443097] [2022-01-31 21:56:49,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:49,869 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:49,870 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:56:50,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:50,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:56:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:56:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:50,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-01-31 21:56:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-01-31 21:56:50,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-01-31 21:56:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,186 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 21:56:50,187 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:50,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [50443097] [2022-01-31 21:56:50,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [50443097] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:50,187 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:50,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 21:56:50,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927754114] [2022-01-31 21:56:50,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:50,187 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 21:56:50,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:50,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 21:56:50,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:56:50,188 INFO L87 Difference]: Start difference. First operand 229 states and 248 transitions. Second operand has 17 states, 17 states have (on average 6.235294117647059) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-31 21:56:50,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:50,706 INFO L93 Difference]: Finished difference Result 294 states and 319 transitions. [2022-01-31 21:56:50,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:50,706 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.235294117647059) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 157 [2022-01-31 21:56:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:50,707 INFO L225 Difference]: With dead ends: 294 [2022-01-31 21:56:50,707 INFO L226 Difference]: Without dead ends: 208 [2022-01-31 21:56:50,707 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:56:50,708 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 192 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:50,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 773 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:56:50,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-01-31 21:56:50,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-01-31 21:56:50,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 161 states have (on average 1.0993788819875776) internal successors, (177), 162 states have internal predecessors, (177), 23 states have call successors, (23), 23 states have call predecessors, (23), 23 states have return successors, (23), 22 states have call predecessors, (23), 21 states have call successors, (23) [2022-01-31 21:56:50,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 223 transitions. [2022-01-31 21:56:50,756 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 223 transitions. Word has length 157 [2022-01-31 21:56:50,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:50,756 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 223 transitions. [2022-01-31 21:56:50,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.235294117647059) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-01-31 21:56:50,756 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 223 transitions. [2022-01-31 21:56:50,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-31 21:56:50,757 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:50,757 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:50,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-31 21:56:50,757 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:50,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:50,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1409620627, now seen corresponding path program 1 times [2022-01-31 21:56:50,757 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:50,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1655824285] [2022-01-31 21:56:50,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:50,758 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:50,759 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:56:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:50,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:56:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:56:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:51,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 21:56:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-31 21:56:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-31 21:56:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:51,111 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 21:56:51,111 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:51,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1655824285] [2022-01-31 21:56:51,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1655824285] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:51,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:51,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:56:51,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566383495] [2022-01-31 21:56:51,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:51,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:56:51,112 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:51,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:56:51,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:56:51,113 INFO L87 Difference]: Start difference. First operand 208 states and 223 transitions. Second operand has 20 states, 20 states have (on average 5.2) internal successors, (104), 8 states have internal predecessors, (104), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-01-31 21:56:52,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:52,082 INFO L93 Difference]: Finished difference Result 410 states and 441 transitions. [2022-01-31 21:56:52,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-01-31 21:56:52,082 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 8 states have internal predecessors, (104), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 158 [2022-01-31 21:56:52,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:52,084 INFO L225 Difference]: With dead ends: 410 [2022-01-31 21:56:52,084 INFO L226 Difference]: Without dead ends: 211 [2022-01-31 21:56:52,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=387, Invalid=1965, Unknown=0, NotChecked=0, Total=2352 [2022-01-31 21:56:52,085 INFO L933 BasicCegarLoop]: 136 mSDtfsCounter, 591 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 1284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:52,085 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [592 Valid, 542 Invalid, 1284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:56:52,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-01-31 21:56:52,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2022-01-31 21:56:52,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 161 states have (on average 1.093167701863354) internal successors, (176), 162 states have internal predecessors, (176), 23 states have call successors, (23), 23 states have call predecessors, (23), 23 states have return successors, (23), 22 states have call predecessors, (23), 21 states have call successors, (23) [2022-01-31 21:56:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 222 transitions. [2022-01-31 21:56:52,135 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 222 transitions. Word has length 158 [2022-01-31 21:56:52,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:52,135 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 222 transitions. [2022-01-31 21:56:52,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.2) internal successors, (104), 8 states have internal predecessors, (104), 5 states have call successors, (17), 13 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-01-31 21:56:52,135 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 222 transitions. [2022-01-31 21:56:52,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-01-31 21:56:52,135 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:52,136 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:52,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-31 21:56:52,136 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:52,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:52,136 INFO L85 PathProgramCache]: Analyzing trace with hash -954221035, now seen corresponding path program 1 times [2022-01-31 21:56:52,136 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:52,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1343225844] [2022-01-31 21:56:52,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:52,137 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:52,138 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:56:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:52,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:56:52,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:52,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:56:52,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:56:52,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-31 21:56:52,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-01-31 21:56:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-01-31 21:56:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,578 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 21:56:52,578 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:52,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1343225844] [2022-01-31 21:56:52,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1343225844] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:52,579 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:52,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-01-31 21:56:52,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209287724] [2022-01-31 21:56:52,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:52,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-31 21:56:52,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:52,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-31 21:56:52,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-01-31 21:56:52,580 INFO L87 Difference]: Start difference. First operand 208 states and 222 transitions. Second operand has 25 states, 25 states have (on average 4.16) internal successors, (104), 11 states have internal predecessors, (104), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2022-01-31 21:56:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:53,559 INFO L93 Difference]: Finished difference Result 211 states and 226 transitions. [2022-01-31 21:56:53,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-31 21:56:53,559 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.16) internal successors, (104), 11 states have internal predecessors, (104), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) Word has length 158 [2022-01-31 21:56:53,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:53,559 INFO L225 Difference]: With dead ends: 211 [2022-01-31 21:56:53,560 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 21:56:53,560 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=265, Invalid=1715, Unknown=0, NotChecked=0, Total=1980 [2022-01-31 21:56:53,561 INFO L933 BasicCegarLoop]: 123 mSDtfsCounter, 412 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:53,561 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [412 Valid, 698 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:56:53,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 21:56:53,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 21:56:53,561 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 21:56:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 21:56:53,561 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 158 [2022-01-31 21:56:53,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:53,562 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 21:56:53,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.16) internal successors, (104), 11 states have internal predecessors, (104), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 7 states have call predecessors, (15), 4 states have call successors, (15) [2022-01-31 21:56:53,562 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 21:56:53,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 21:56:53,563 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 21:56:53,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-31 21:56:53,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 22:08:39,049 WARN L228 SmtUtils]: Spent 11.75m on a formula simplification that was a NOOP. DAG size: 174 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)