/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/cdaudio_simpl1.cil-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 21:55:43,609 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 21:55:43,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 21:55:43,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 21:55:43,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 21:55:43,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 21:55:43,677 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 21:55:43,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 21:55:43,680 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 21:55:43,681 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 21:55:43,682 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 21:55:43,683 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 21:55:43,683 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 21:55:43,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 21:55:43,685 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 21:55:43,686 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 21:55:43,686 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 21:55:43,687 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 21:55:43,688 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 21:55:43,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 21:55:43,691 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 21:55:43,692 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 21:55:43,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 21:55:43,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 21:55:43,696 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 21:55:43,696 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 21:55:43,696 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 21:55:43,697 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 21:55:43,697 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 21:55:43,698 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 21:55:43,698 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 21:55:43,699 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 21:55:43,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 21:55:43,700 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 21:55:43,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 21:55:43,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 21:55:43,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 21:55:43,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 21:55:43,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 21:55:43,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 21:55:43,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 21:55:43,704 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:43,712 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 21:55:43,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 21:55:43,713 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 21:55:43,713 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 21:55:43,713 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 21:55:43,714 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 21:55:43,714 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 21:55:43,714 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 21:55:43,714 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 21:55:43,714 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 21:55:43,714 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 21:55:43,715 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 21:55:43,715 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 21:55:43,715 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 21:55:43,715 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 21:55:43,715 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 21:55:43,716 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 21:55:43,716 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 21:55:43,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:55:43,716 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 21:55:43,716 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 21:55:43,717 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 21:55:43,717 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 21:55:43,717 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:43,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 21:55:43,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 21:55:43,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 21:55:43,954 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 21:55:43,955 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 21:55:43,959 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2022-01-31 21:55:44,015 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee78d06c/d45a4fccfc1d4f47be5acfd77c0edf69/FLAG35afae665 [2022-01-31 21:55:44,478 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 21:55:44,478 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/cdaudio_simpl1.cil-2.c [2022-01-31 21:55:44,492 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee78d06c/d45a4fccfc1d4f47be5acfd77c0edf69/FLAG35afae665 [2022-01-31 21:55:44,786 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee78d06c/d45a4fccfc1d4f47be5acfd77c0edf69 [2022-01-31 21:55:44,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 21:55:44,790 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 21:55:44,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 21:55:44,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 21:55:44,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 21:55:44,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:55:44" (1/1) ... [2022-01-31 21:55:44,797 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8ec9cf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:44, skipping insertion in model container [2022-01-31 21:55:44,797 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:55:44" (1/1) ... [2022-01-31 21:55:44,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 21:55:44,865 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 21:55:45,052 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/cdaudio_simpl1.cil-2.c[2073,2086] [2022-01-31 21:55:45,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:55:45,237 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 21:55:45,248 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/cdaudio_simpl1.cil-2.c[2073,2086] [2022-01-31 21:55:45,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 21:55:45,344 INFO L208 MainTranslator]: Completed translation [2022-01-31 21:55:45,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:45 WrapperNode [2022-01-31 21:55:45,344 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 21:55:45,345 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 21:55:45,345 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 21:55:45,346 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 21:55:45,355 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:45" (1/1) ... [2022-01-31 21:55:45,356 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:45" (1/1) ... [2022-01-31 21:55:45,378 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:45" (1/1) ... [2022-01-31 21:55:45,378 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:45" (1/1) ... [2022-01-31 21:55:45,422 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:45" (1/1) ... [2022-01-31 21:55:45,449 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:45" (1/1) ... [2022-01-31 21:55:45,454 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:45" (1/1) ... [2022-01-31 21:55:45,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 21:55:45,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 21:55:45,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 21:55:45,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 21:55:45,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:45" (1/1) ... [2022-01-31 21:55:45,497 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 21:55:45,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 21:55:45,519 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:45,526 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:45,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 21:55:45,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 21:55:45,552 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 21:55:45,552 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-01-31 21:55:45,552 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-01-31 21:55:45,552 INFO L138 BoogieDeclarations]: Found implementation of procedure SendSrbSynchronous [2022-01-31 21:55:45,552 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSignalCompletion [2022-01-31 21:55:45,552 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioStartDevice [2022-01-31 21:55:45,552 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPnp [2022-01-31 21:55:45,552 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioDeviceControl [2022-01-31 21:55:45,553 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioSendToNextDriver [2022-01-31 21:55:45,553 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioIsPlayActive [2022-01-31 21:55:45,553 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio535DeviceControl [2022-01-31 21:55:45,553 INFO L138 BoogieDeclarations]: Found implementation of procedure AG_SetStatusAndReturn [2022-01-31 21:55:45,553 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudio435DeviceControl [2022-01-31 21:55:45,553 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioAtapiDeviceControl [2022-01-31 21:55:45,553 INFO L138 BoogieDeclarations]: Found implementation of procedure HpCdrProcessLastSession [2022-01-31 21:55:45,553 INFO L138 BoogieDeclarations]: Found implementation of procedure HPCdrCompletion [2022-01-31 21:55:45,554 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioHPCdrDeviceControl [2022-01-31 21:55:45,554 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioForwardIrpSynchronous [2022-01-31 21:55:45,554 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioUnload [2022-01-31 21:55:45,554 INFO L138 BoogieDeclarations]: Found implementation of procedure CdAudioPower [2022-01-31 21:55:45,554 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-01-31 21:55:45,554 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 21:55:45,554 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-01-31 21:55:45,554 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-01-31 21:55:45,555 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-01-31 21:55:45,555 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-01-31 21:55:45,555 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-01-31 21:55:45,555 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-01-31 21:55:45,555 INFO L138 BoogieDeclarations]: Found implementation of procedure ZwClose [2022-01-31 21:55:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 21:55:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 21:55:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 21:55:45,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 21:55:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-01-31 21:55:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 21:55:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-01-31 21:55:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure SendSrbSynchronous [2022-01-31 21:55:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSignalCompletion [2022-01-31 21:55:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioStartDevice [2022-01-31 21:55:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPnp [2022-01-31 21:55:45,556 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioDeviceControl [2022-01-31 21:55:45,557 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioSendToNextDriver [2022-01-31 21:55:45,557 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioIsPlayActive [2022-01-31 21:55:45,557 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio535DeviceControl [2022-01-31 21:55:45,557 INFO L130 BoogieDeclarations]: Found specification of procedure AG_SetStatusAndReturn [2022-01-31 21:55:45,559 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudio435DeviceControl [2022-01-31 21:55:45,559 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioAtapiDeviceControl [2022-01-31 21:55:45,560 INFO L130 BoogieDeclarations]: Found specification of procedure HPCdrCompletion [2022-01-31 21:55:45,560 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioHPCdrDeviceControl [2022-01-31 21:55:45,560 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioForwardIrpSynchronous [2022-01-31 21:55:45,560 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioPower [2022-01-31 21:55:45,560 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-01-31 21:55:45,560 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-01-31 21:55:45,560 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-01-31 21:55:45,561 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-01-31 21:55:45,561 INFO L130 BoogieDeclarations]: Found specification of procedure ZwClose [2022-01-31 21:55:45,561 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-01-31 21:55:45,561 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-01-31 21:55:45,561 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-01-31 21:55:45,561 INFO L130 BoogieDeclarations]: Found specification of procedure HpCdrProcessLastSession [2022-01-31 21:55:45,561 INFO L130 BoogieDeclarations]: Found specification of procedure CdAudioUnload [2022-01-31 21:55:45,561 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-01-31 21:55:45,561 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 21:55:45,562 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-01-31 21:55:45,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 21:55:45,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 21:55:45,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 21:55:45,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 21:55:45,562 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 21:55:45,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 21:55:45,759 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 21:55:45,761 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 21:55:45,915 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:46,000 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-01-31 21:55:46,000 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-01-31 21:55:46,005 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:46,033 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-01-31 21:55:46,033 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-01-31 21:55:46,060 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:46,085 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-01-31 21:55:46,086 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-01-31 21:55:46,135 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:46,193 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2022-01-31 21:55:46,194 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L305: #res := 0; [2022-01-31 21:55:46,194 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2022-01-31 21:55:46,198 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:46,374 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume false; [2022-01-31 21:55:46,375 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##22: assume !false; [2022-01-31 21:55:46,376 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:46,405 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##21: assume !false; [2022-01-31 21:55:46,406 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume false; [2022-01-31 21:55:46,434 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:46,454 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2022-01-31 21:55:46,454 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2022-01-31 21:55:46,459 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:46,597 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !false; [2022-01-31 21:55:46,597 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume false; [2022-01-31 21:55:46,608 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-01-31 21:55:46,611 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-01-31 21:55:46,611 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-01-31 21:55:46,629 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 21:55:46,637 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 21:55:46,638 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-31 21:55:46,640 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:55:46 BoogieIcfgContainer [2022-01-31 21:55:46,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 21:55:46,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 21:55:46,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 21:55:46,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 21:55:46,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:55:44" (1/3) ... [2022-01-31 21:55:46,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d1e8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:55:46, skipping insertion in model container [2022-01-31 21:55:46,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:55:45" (2/3) ... [2022-01-31 21:55:46,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d1e8ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:55:46, skipping insertion in model container [2022-01-31 21:55:46,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:55:46" (3/3) ... [2022-01-31 21:55:46,646 INFO L111 eAbstractionObserver]: Analyzing ICFG cdaudio_simpl1.cil-2.c [2022-01-31 21:55:46,652 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 21:55:46,652 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 21:55:46,701 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 21:55:46,706 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:46,706 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 21:55:46,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 515 states, 382 states have (on average 1.486910994764398) internal successors, (568), 402 states have internal predecessors, (568), 102 states have call successors, (102), 29 states have call predecessors, (102), 29 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) [2022-01-31 21:55:46,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-31 21:55:46,746 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:46,747 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:46,747 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:46,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:46,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1874379495, now seen corresponding path program 1 times [2022-01-31 21:55:46,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:46,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1598393674] [2022-01-31 21:55:46,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:46,769 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:46,806 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:47,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:47,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:47,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:47,190 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,191 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:47,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1598393674] [2022-01-31 21:55:47,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1598393674] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:47,193 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:47,193 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 21:55:47,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691116966] [2022-01-31 21:55:47,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:47,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 21:55:47,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:47,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 21:55:47,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 21:55:47,236 INFO L87 Difference]: Start difference. First operand has 515 states, 382 states have (on average 1.486910994764398) internal successors, (568), 402 states have internal predecessors, (568), 102 states have call successors, (102), 29 states have call predecessors, (102), 29 states have return successors, (102), 98 states have call predecessors, (102), 102 states have call successors, (102) Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 21:55:49,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:49,377 INFO L93 Difference]: Finished difference Result 1043 states and 1675 transitions. [2022-01-31 21:55:49,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:55:49,380 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), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-01-31 21:55:49,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:49,404 INFO L225 Difference]: With dead ends: 1043 [2022-01-31 21:55:49,405 INFO L226 Difference]: Without dead ends: 663 [2022-01-31 21:55:49,414 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:55:49,417 INFO L933 BasicCegarLoop]: 738 mSDtfsCounter, 770 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:49,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [771 Valid, 1003 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-31 21:55:49,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2022-01-31 21:55:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 507. [2022-01-31 21:55:49,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 377 states have (on average 1.4562334217506632) internal successors, (549), 395 states have internal predecessors, (549), 102 states have call successors, (102), 29 states have call predecessors, (102), 27 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2022-01-31 21:55:49,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 737 transitions. [2022-01-31 21:55:49,569 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 737 transitions. Word has length 20 [2022-01-31 21:55:49,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:49,570 INFO L470 AbstractCegarLoop]: Abstraction has 507 states and 737 transitions. [2022-01-31 21:55:49,571 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), 2 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-01-31 21:55:49,571 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 737 transitions. [2022-01-31 21:55:49,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-31 21:55:49,573 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:49,573 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:49,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 21:55:49,574 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:49,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:49,575 INFO L85 PathProgramCache]: Analyzing trace with hash 950460732, now seen corresponding path program 1 times [2022-01-31 21:55:49,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:49,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1971957880] [2022-01-31 21:55:49,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:49,577 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:49,580 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:49,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:55:49,729 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:49,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1971957880] [2022-01-31 21:55:49,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1971957880] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:49,729 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:49,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:55:49,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863389212] [2022-01-31 21:55:49,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:49,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:55:49,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:49,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:55:49,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:55:49,732 INFO L87 Difference]: Start difference. First operand 507 states and 737 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:51,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:51,739 INFO L93 Difference]: Finished difference Result 961 states and 1420 transitions. [2022-01-31 21:55:51,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:55:51,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-01-31 21:55:51,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:51,747 INFO L225 Difference]: With dead ends: 961 [2022-01-31 21:55:51,747 INFO L226 Difference]: Without dead ends: 842 [2022-01-31 21:55:51,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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:51,750 INFO L933 BasicCegarLoop]: 837 mSDtfsCounter, 1480 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 1468 mSolverCounterSat, 428 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 1896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 428 IncrementalHoareTripleChecker+Valid, 1468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:51,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1484 Valid, 1029 Invalid, 1896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [428 Valid, 1468 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-31 21:55:51,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-01-31 21:55:51,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 662. [2022-01-31 21:55:51,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 501 states have (on average 1.407185628742515) internal successors, (705), 508 states have internal predecessors, (705), 111 states have call successors, (111), 40 states have call predecessors, (111), 49 states have return successors, (145), 119 states have call predecessors, (145), 99 states have call successors, (145) [2022-01-31 21:55:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 961 transitions. [2022-01-31 21:55:51,859 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 961 transitions. Word has length 25 [2022-01-31 21:55:51,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:51,860 INFO L470 AbstractCegarLoop]: Abstraction has 662 states and 961 transitions. [2022-01-31 21:55:51,860 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 3 states have internal predecessors, (16), 3 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 961 transitions. [2022-01-31 21:55:51,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-31 21:55:51,867 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:51,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] [2022-01-31 21:55:51,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 21:55:51,868 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:51,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:51,869 INFO L85 PathProgramCache]: Analyzing trace with hash -356192423, now seen corresponding path program 1 times [2022-01-31 21:55:51,869 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:51,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [422028770] [2022-01-31 21:55:51,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:51,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:51,873 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:51,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:52,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:52,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:52,059 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,059 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:52,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [422028770] [2022-01-31 21:55:52,060 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [422028770] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:52,060 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:52,060 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:55:52,060 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699138053] [2022-01-31 21:55:52,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:52,060 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:55:52,061 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:52,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:55:52,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:55:52,061 INFO L87 Difference]: Start difference. First operand 662 states and 961 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:53,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:53,806 INFO L93 Difference]: Finished difference Result 1142 states and 1641 transitions. [2022-01-31 21:55:53,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:55:53,806 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (8), 6 states have call predecessors, (8), 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:53,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:53,812 INFO L225 Difference]: With dead ends: 1142 [2022-01-31 21:55:53,813 INFO L226 Difference]: Without dead ends: 966 [2022-01-31 21:55:53,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 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,814 INFO L933 BasicCegarLoop]: 722 mSDtfsCounter, 1133 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:53,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1143 Valid, 861 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-31 21:55:53,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-01-31 21:55:53,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 787. [2022-01-31 21:55:53,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 610 states have (on average 1.4032786885245903) internal successors, (856), 613 states have internal predecessors, (856), 113 states have call successors, (113), 46 states have call predecessors, (113), 63 states have return successors, (163), 130 states have call predecessors, (163), 104 states have call successors, (163) [2022-01-31 21:55:53,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1132 transitions. [2022-01-31 21:55:53,905 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1132 transitions. Word has length 30 [2022-01-31 21:55:53,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:53,906 INFO L470 AbstractCegarLoop]: Abstraction has 787 states and 1132 transitions. [2022-01-31 21:55:53,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:55:53,906 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1132 transitions. [2022-01-31 21:55:53,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-31 21:55:53,907 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:53,908 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:53,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 21:55:53,908 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:53,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:53,908 INFO L85 PathProgramCache]: Analyzing trace with hash -175937744, now seen corresponding path program 1 times [2022-01-31 21:55:53,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:53,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1594694917] [2022-01-31 21:55:53,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:53,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:53,912 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:54,054 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:54,055 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:54,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1594694917] [2022-01-31 21:55:54,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1594694917] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:54,055 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:54,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:55:54,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234654878] [2022-01-31 21:55:54,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:54,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:55:54,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:54,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:55:54,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:55:54,056 INFO L87 Difference]: Start difference. First operand 787 states and 1132 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (7), 5 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:56,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:56,648 INFO L93 Difference]: Finished difference Result 1624 states and 2440 transitions. [2022-01-31 21:55:56,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 21:55:56,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (7), 5 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 31 [2022-01-31 21:55:56,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:56,656 INFO L225 Difference]: With dead ends: 1624 [2022-01-31 21:55:56,656 INFO L226 Difference]: Without dead ends: 1340 [2022-01-31 21:55:56,657 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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:56,667 INFO L933 BasicCegarLoop]: 1003 mSDtfsCounter, 746 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 1256 SdHoareTripleChecker+Invalid, 2151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:56,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [749 Valid, 1256 Invalid, 2151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-01-31 21:55:56,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2022-01-31 21:55:56,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 905. [2022-01-31 21:55:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 707 states have (on average 1.413012729844413) internal successors, (999), 709 states have internal predecessors, (999), 126 states have call successors, (126), 54 states have call predecessors, (126), 71 states have return successors, (220), 144 states have call predecessors, (220), 117 states have call successors, (220) [2022-01-31 21:55:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1345 transitions. [2022-01-31 21:55:56,784 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1345 transitions. Word has length 31 [2022-01-31 21:55:56,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:56,784 INFO L470 AbstractCegarLoop]: Abstraction has 905 states and 1345 transitions. [2022-01-31 21:55:56,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (7), 5 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:56,784 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1345 transitions. [2022-01-31 21:55:56,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-31 21:55:56,785 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:56,785 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] [2022-01-31 21:55:56,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 21:55:56,786 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:56,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:56,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1397494507, now seen corresponding path program 1 times [2022-01-31 21:55:56,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:56,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1181081600] [2022-01-31 21:55:56,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:56,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:56,791 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:56,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:56,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:56,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:56,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:57,001 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,002 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:57,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1181081600] [2022-01-31 21:55:57,002 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1181081600] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:57,002 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:57,002 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:55:57,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654626349] [2022-01-31 21:55:57,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:57,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:55:57,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:57,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:55:57,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:55:57,003 INFO L87 Difference]: Start difference. First operand 905 states and 1345 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 21:55:59,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:55:59,056 INFO L93 Difference]: Finished difference Result 1626 states and 2474 transitions. [2022-01-31 21:55:59,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:55:59,056 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2022-01-31 21:55:59,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:55:59,062 INFO L225 Difference]: With dead ends: 1626 [2022-01-31 21:55:59,063 INFO L226 Difference]: Without dead ends: 1042 [2022-01-31 21:55:59,064 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:55:59,065 INFO L933 BasicCegarLoop]: 736 mSDtfsCounter, 2487 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 837 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2493 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 837 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:55:59,065 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2493 Valid, 995 Invalid, 1933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [837 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-31 21:55:59,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2022-01-31 21:55:59,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 833. [2022-01-31 21:55:59,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 648 states have (on average 1.3981481481481481) internal successors, (906), 651 states have internal predecessors, (906), 117 states have call successors, (117), 50 states have call predecessors, (117), 67 states have return successors, (177), 134 states have call predecessors, (177), 108 states have call successors, (177) [2022-01-31 21:55:59,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1200 transitions. [2022-01-31 21:55:59,187 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1200 transitions. Word has length 32 [2022-01-31 21:55:59,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:55:59,188 INFO L470 AbstractCegarLoop]: Abstraction has 833 states and 1200 transitions. [2022-01-31 21:55:59,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 6 states have internal predecessors, (22), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 21:55:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1200 transitions. [2022-01-31 21:55:59,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-31 21:55:59,191 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:55:59,191 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:55:59,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 21:55:59,191 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:55:59,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:55:59,192 INFO L85 PathProgramCache]: Analyzing trace with hash 913519719, now seen corresponding path program 1 times [2022-01-31 21:55:59,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:55:59,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [763266660] [2022-01-31 21:55:59,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:55:59,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:55:59,195 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:55:59,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:55:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:55:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:55:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:55:59,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:55:59,330 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:55:59,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [763266660] [2022-01-31 21:55:59,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [763266660] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:55:59,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:55:59,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:55:59,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40276169] [2022-01-31 21:55:59,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:55:59,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:55:59,336 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:55:59,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:55:59,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:55:59,337 INFO L87 Difference]: Start difference. First operand 833 states and 1200 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:56:00,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:00,957 INFO L93 Difference]: Finished difference Result 963 states and 1422 transitions. [2022-01-31 21:56:00,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:56:00,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-01-31 21:56:00,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:00,963 INFO L225 Difference]: With dead ends: 963 [2022-01-31 21:56:00,963 INFO L226 Difference]: Without dead ends: 959 [2022-01-31 21:56:00,964 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:56:00,964 INFO L933 BasicCegarLoop]: 710 mSDtfsCounter, 1150 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:00,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1151 Valid, 952 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-31 21:56:00,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-01-31 21:56:01,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 832. [2022-01-31 21:56:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 648 states have (on average 1.3950617283950617) internal successors, (904), 650 states have internal predecessors, (904), 116 states have call successors, (116), 50 states have call predecessors, (116), 67 states have return successors, (177), 134 states have call predecessors, (177), 108 states have call successors, (177) [2022-01-31 21:56:01,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1197 transitions. [2022-01-31 21:56:01,082 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1197 transitions. Word has length 36 [2022-01-31 21:56:01,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:01,082 INFO L470 AbstractCegarLoop]: Abstraction has 832 states and 1197 transitions. [2022-01-31 21:56:01,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 3 states have internal predecessors, (25), 3 states have call successors, (8), 6 states have call predecessors, (8), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:56:01,083 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1197 transitions. [2022-01-31 21:56:01,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 21:56:01,085 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:01,085 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:01,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 21:56:01,085 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:01,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:01,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1218065378, now seen corresponding path program 1 times [2022-01-31 21:56:01,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:01,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [551013981] [2022-01-31 21:56:01,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:01,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:01,090 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:01,246 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,246 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:01,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [551013981] [2022-01-31 21:56:01,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [551013981] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:01,247 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:01,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 21:56:01,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299972684] [2022-01-31 21:56:01,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:01,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 21:56:01,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:01,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 21:56:01,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-31 21:56:01,249 INFO L87 Difference]: Start difference. First operand 832 states and 1197 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:56:03,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:03,312 INFO L93 Difference]: Finished difference Result 1409 states and 2012 transitions. [2022-01-31 21:56:03,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:56:03,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2022-01-31 21:56:03,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:03,318 INFO L225 Difference]: With dead ends: 1409 [2022-01-31 21:56:03,318 INFO L226 Difference]: Without dead ends: 993 [2022-01-31 21:56:03,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:56:03,320 INFO L933 BasicCegarLoop]: 812 mSDtfsCounter, 1124 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 1641 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 1232 SdHoareTripleChecker+Invalid, 2020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 1641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:03,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1126 Valid, 1232 Invalid, 2020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 1641 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-31 21:56:03,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2022-01-31 21:56:03,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 734. [2022-01-31 21:56:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 570 states have (on average 1.3859649122807018) internal successors, (790), 573 states have internal predecessors, (790), 105 states have call successors, (105), 45 states have call predecessors, (105), 58 states have return successors, (131), 118 states have call predecessors, (131), 97 states have call successors, (131) [2022-01-31 21:56:03,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1026 transitions. [2022-01-31 21:56:03,457 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1026 transitions. Word has length 39 [2022-01-31 21:56:03,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:03,457 INFO L470 AbstractCegarLoop]: Abstraction has 734 states and 1026 transitions. [2022-01-31 21:56:03,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (10), 6 states have call predecessors, (10), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:56:03,457 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1026 transitions. [2022-01-31 21:56:03,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-31 21:56:03,460 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:03,460 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:56:03,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 21:56:03,460 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:03,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:03,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1427323864, now seen corresponding path program 1 times [2022-01-31 21:56:03,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:03,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [580659737] [2022-01-31 21:56:03,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:03,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:03,464 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:03,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:03,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:03,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:03,627 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:03,628 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:03,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [580659737] [2022-01-31 21:56:03,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [580659737] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:03,628 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:03,628 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 21:56:03,628 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679434119] [2022-01-31 21:56:03,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:03,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 21:56:03,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:03,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 21:56:03,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-31 21:56:03,629 INFO L87 Difference]: Start difference. First operand 734 states and 1026 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:56:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:05,050 INFO L93 Difference]: Finished difference Result 975 states and 1402 transitions. [2022-01-31 21:56:05,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 21:56:05,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-01-31 21:56:05,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:05,055 INFO L225 Difference]: With dead ends: 975 [2022-01-31 21:56:05,056 INFO L226 Difference]: Without dead ends: 957 [2022-01-31 21:56:05,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 1 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:56:05,057 INFO L933 BasicCegarLoop]: 669 mSDtfsCounter, 1139 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:05,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1147 Valid, 749 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 999 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 21:56:05,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2022-01-31 21:56:05,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 754. [2022-01-31 21:56:05,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 588 states have (on average 1.3962585034013606) internal successors, (821), 600 states have internal predecessors, (821), 107 states have call successors, (107), 48 states have call predecessors, (107), 58 states have return successors, (124), 110 states have call predecessors, (124), 100 states have call successors, (124) [2022-01-31 21:56:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1052 transitions. [2022-01-31 21:56:05,201 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1052 transitions. Word has length 40 [2022-01-31 21:56:05,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:05,204 INFO L470 AbstractCegarLoop]: Abstraction has 754 states and 1052 transitions. [2022-01-31 21:56:05,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 3 states have internal predecessors, (28), 3 states have call successors, (9), 6 states have call predecessors, (9), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-31 21:56:05,206 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1052 transitions. [2022-01-31 21:56:05,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-01-31 21:56:05,209 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:05,209 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:05,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-31 21:56:05,210 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:05,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:05,210 INFO L85 PathProgramCache]: Analyzing trace with hash -638398730, now seen corresponding path program 1 times [2022-01-31 21:56:05,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:05,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1589204487] [2022-01-31 21:56:05,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:05,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:05,213 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:05,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:05,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:05,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:05,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:05,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:05,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-01-31 21:56:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:05,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:05,372 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:05,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1589204487] [2022-01-31 21:56:05,372 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1589204487] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:05,372 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:05,373 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 21:56:05,373 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600331306] [2022-01-31 21:56:05,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:05,373 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 21:56:05,373 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:05,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 21:56:05,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 21:56:05,374 INFO L87 Difference]: Start difference. First operand 754 states and 1052 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 3 states have internal predecessors, (32), 3 states have call successors, (10), 7 states have call predecessors, (10), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 21:56:07,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:07,018 INFO L93 Difference]: Finished difference Result 1159 states and 1659 transitions. [2022-01-31 21:56:07,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:56:07,018 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), 3 states have call successors, (10), 7 states have call predecessors, (10), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 46 [2022-01-31 21:56:07,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:07,022 INFO L225 Difference]: With dead ends: 1159 [2022-01-31 21:56:07,023 INFO L226 Difference]: Without dead ends: 934 [2022-01-31 21:56:07,023 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:56:07,024 INFO L933 BasicCegarLoop]: 788 mSDtfsCounter, 921 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 1563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:07,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [927 Valid, 1341 Invalid, 1563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-31 21:56:07,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2022-01-31 21:56:07,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 754. [2022-01-31 21:56:07,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 588 states have (on average 1.3945578231292517) internal successors, (820), 600 states have internal predecessors, (820), 107 states have call successors, (107), 48 states have call predecessors, (107), 58 states have return successors, (124), 110 states have call predecessors, (124), 100 states have call successors, (124) [2022-01-31 21:56:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1051 transitions. [2022-01-31 21:56:07,153 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1051 transitions. Word has length 46 [2022-01-31 21:56:07,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:07,153 INFO L470 AbstractCegarLoop]: Abstraction has 754 states and 1051 transitions. [2022-01-31 21:56:07,154 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), 3 states have call successors, (10), 7 states have call predecessors, (10), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 21:56:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1051 transitions. [2022-01-31 21:56:07,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-01-31 21:56:07,155 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:07,156 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:07,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-31 21:56:07,156 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:07,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:07,156 INFO L85 PathProgramCache]: Analyzing trace with hash 904959916, now seen corresponding path program 1 times [2022-01-31 21:56:07,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:07,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1252624582] [2022-01-31 21:56:07,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:07,157 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:07,159 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:07,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-31 21:56:07,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:07,284 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,284 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:07,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1252624582] [2022-01-31 21:56:07,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1252624582] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:07,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:07,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 21:56:07,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468699634] [2022-01-31 21:56:07,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:07,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 21:56:07,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:07,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 21:56:07,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 21:56:07,286 INFO L87 Difference]: Start difference. First operand 754 states and 1051 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (9), 7 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 21:56:08,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:08,203 INFO L93 Difference]: Finished difference Result 956 states and 1371 transitions. [2022-01-31 21:56:08,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:56:08,204 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (9), 7 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2022-01-31 21:56:08,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:08,207 INFO L225 Difference]: With dead ends: 956 [2022-01-31 21:56:08,207 INFO L226 Difference]: Without dead ends: 889 [2022-01-31 21:56:08,208 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:08,209 INFO L933 BasicCegarLoop]: 664 mSDtfsCounter, 1894 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 545 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1900 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 545 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:08,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1900 Valid, 1086 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [545 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:56:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2022-01-31 21:56:08,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 743. [2022-01-31 21:56:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 581 states have (on average 1.395869191049914) internal successors, (811), 593 states have internal predecessors, (811), 105 states have call successors, (105), 46 states have call predecessors, (105), 56 states have return successors, (122), 108 states have call predecessors, (122), 98 states have call successors, (122) [2022-01-31 21:56:08,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1038 transitions. [2022-01-31 21:56:08,340 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1038 transitions. Word has length 47 [2022-01-31 21:56:08,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:08,340 INFO L470 AbstractCegarLoop]: Abstraction has 743 states and 1038 transitions. [2022-01-31 21:56:08,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 3 states have internal predecessors, (34), 3 states have call successors, (9), 7 states have call predecessors, (9), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-01-31 21:56:08,341 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1038 transitions. [2022-01-31 21:56:08,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-01-31 21:56:08,343 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:08,343 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:08,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-01-31 21:56:08,343 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:08,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:08,345 INFO L85 PathProgramCache]: Analyzing trace with hash 2108919237, now seen corresponding path program 1 times [2022-01-31 21:56:08,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:08,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1314598550] [2022-01-31 21:56:08,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:08,346 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:08,348 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:08,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:08,529 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:08,530 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:08,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1314598550] [2022-01-31 21:56:08,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1314598550] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:08,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:08,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:56:08,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874150328] [2022-01-31 21:56:08,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:08,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:56:08,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:08,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:56:08,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:56:08,532 INFO L87 Difference]: Start difference. First operand 743 states and 1038 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (7), 6 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:11,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:11,160 INFO L93 Difference]: Finished difference Result 1059 states and 1503 transitions. [2022-01-31 21:56:11,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:56:11,161 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (7), 6 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 48 [2022-01-31 21:56:11,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:11,165 INFO L225 Difference]: With dead ends: 1059 [2022-01-31 21:56:11,165 INFO L226 Difference]: Without dead ends: 998 [2022-01-31 21:56:11,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:56:11,166 INFO L933 BasicCegarLoop]: 763 mSDtfsCounter, 1792 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 2831 mSolverCounterSat, 578 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1820 SdHoareTripleChecker+Valid, 2029 SdHoareTripleChecker+Invalid, 3409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 578 IncrementalHoareTripleChecker+Valid, 2831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:11,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1820 Valid, 2029 Invalid, 3409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [578 Valid, 2831 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-31 21:56:11,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2022-01-31 21:56:11,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 786. [2022-01-31 21:56:11,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 616 states have (on average 1.3944805194805194) internal successors, (859), 627 states have internal predecessors, (859), 109 states have call successors, (109), 49 states have call predecessors, (109), 60 states have return successors, (131), 114 states have call predecessors, (131), 102 states have call successors, (131) [2022-01-31 21:56:11,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1099 transitions. [2022-01-31 21:56:11,321 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1099 transitions. Word has length 48 [2022-01-31 21:56:11,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:11,321 INFO L470 AbstractCegarLoop]: Abstraction has 786 states and 1099 transitions. [2022-01-31 21:56:11,321 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 7 states have internal predecessors, (36), 4 states have call successors, (7), 6 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:11,321 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1099 transitions. [2022-01-31 21:56:11,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 21:56:11,323 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:11,323 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:11,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-01-31 21:56:11,324 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:11,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:11,324 INFO L85 PathProgramCache]: Analyzing trace with hash -893181664, now seen corresponding path program 1 times [2022-01-31 21:56:11,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:11,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [900555595] [2022-01-31 21:56:11,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:11,325 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:11,326 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:11,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:11,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:11,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:11,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:11,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:11,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:11,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:11,457 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:11,457 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:11,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [900555595] [2022-01-31 21:56:11,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [900555595] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:11,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:11,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 21:56:11,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505755660] [2022-01-31 21:56:11,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:11,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 21:56:11,458 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:11,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 21:56:11,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-31 21:56:11,459 INFO L87 Difference]: Start difference. First operand 786 states and 1099 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 6 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,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:13,379 INFO L93 Difference]: Finished difference Result 1094 states and 1563 transitions. [2022-01-31 21:56:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 21:56:13,380 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 6 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 50 [2022-01-31 21:56:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:13,385 INFO L225 Difference]: With dead ends: 1094 [2022-01-31 21:56:13,385 INFO L226 Difference]: Without dead ends: 1083 [2022-01-31 21:56:13,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:56:13,386 INFO L933 BasicCegarLoop]: 794 mSDtfsCounter, 1242 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 433 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 1371 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 433 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:13,386 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1245 Valid, 1371 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [433 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-31 21:56:13,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2022-01-31 21:56:13,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 860. [2022-01-31 21:56:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 672 states have (on average 1.3675595238095237) internal successors, (919), 678 states have internal predecessors, (919), 111 states have call successors, (111), 51 states have call predecessors, (111), 76 states have return successors, (154), 137 states have call predecessors, (154), 104 states have call successors, (154) [2022-01-31 21:56:13,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1184 transitions. [2022-01-31 21:56:13,556 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1184 transitions. Word has length 50 [2022-01-31 21:56:13,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:13,556 INFO L470 AbstractCegarLoop]: Abstraction has 860 states and 1184 transitions. [2022-01-31 21:56:13,556 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (7), 6 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,556 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1184 transitions. [2022-01-31 21:56:13,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-01-31 21:56:13,558 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:13,559 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:13,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-31 21:56:13,559 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:13,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:13,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1039874466, now seen corresponding path program 1 times [2022-01-31 21:56:13,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:13,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1343620334] [2022-01-31 21:56:13,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:13,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:13,562 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:13,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:13,731 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,731 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:13,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1343620334] [2022-01-31 21:56:13,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1343620334] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:13,731 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:13,731 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:56:13,732 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782948324] [2022-01-31 21:56:13,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:13,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:56:13,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:13,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:56:13,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:13,733 INFO L87 Difference]: Start difference. First operand 860 states and 1184 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (7), 6 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:16,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:16,121 INFO L93 Difference]: Finished difference Result 1020 states and 1443 transitions. [2022-01-31 21:56:16,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:16,121 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 50 [2022-01-31 21:56:16,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:16,125 INFO L225 Difference]: With dead ends: 1020 [2022-01-31 21:56:16,125 INFO L226 Difference]: Without dead ends: 957 [2022-01-31 21:56:16,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:56:16,126 INFO L933 BasicCegarLoop]: 649 mSDtfsCounter, 2232 mSDsluCounter, 1136 mSDsCounter, 0 mSdLazyCounter, 2567 mSolverCounterSat, 662 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2241 SdHoareTripleChecker+Valid, 1785 SdHoareTripleChecker+Invalid, 3229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 662 IncrementalHoareTripleChecker+Valid, 2567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:16,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2241 Valid, 1785 Invalid, 3229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [662 Valid, 2567 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-31 21:56:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2022-01-31 21:56:16,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 837. [2022-01-31 21:56:16,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 653 states have (on average 1.3721286370597243) internal successors, (896), 666 states have internal predecessors, (896), 111 states have call successors, (111), 51 states have call predecessors, (111), 72 states have return successors, (143), 126 states have call predecessors, (143), 104 states have call successors, (143) [2022-01-31 21:56:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1150 transitions. [2022-01-31 21:56:16,277 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1150 transitions. Word has length 50 [2022-01-31 21:56:16,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:16,278 INFO L470 AbstractCegarLoop]: Abstraction has 837 states and 1150 transitions. [2022-01-31 21:56:16,278 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 8 states have internal predecessors, (38), 4 states have call successors, (7), 6 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:16,278 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1150 transitions. [2022-01-31 21:56:16,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 21:56:16,280 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:16,281 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:16,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-01-31 21:56:16,281 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:16,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:16,281 INFO L85 PathProgramCache]: Analyzing trace with hash 147300495, now seen corresponding path program 1 times [2022-01-31 21:56:16,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:16,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [648414905] [2022-01-31 21:56:16,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:16,282 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:16,284 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:16,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:16,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:16,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:16,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:16,448 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,448 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:16,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [648414905] [2022-01-31 21:56:16,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [648414905] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:16,449 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:16,449 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:56:16,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097574917] [2022-01-31 21:56:16,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:16,449 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:56:16,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:16,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:56:16,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:56:16,450 INFO L87 Difference]: Start difference. First operand 837 states and 1150 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:18,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:18,383 INFO L93 Difference]: Finished difference Result 982 states and 1391 transitions. [2022-01-31 21:56:18,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:56:18,384 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2022-01-31 21:56:18,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:18,387 INFO L225 Difference]: With dead ends: 982 [2022-01-31 21:56:18,387 INFO L226 Difference]: Without dead ends: 977 [2022-01-31 21:56:18,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:18,388 INFO L933 BasicCegarLoop]: 691 mSDtfsCounter, 1534 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 1821 mSolverCounterSat, 555 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 1435 SdHoareTripleChecker+Invalid, 2376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 555 IncrementalHoareTripleChecker+Valid, 1821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:18,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1537 Valid, 1435 Invalid, 2376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [555 Valid, 1821 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-31 21:56:18,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2022-01-31 21:56:18,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 855. [2022-01-31 21:56:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 668 states have (on average 1.3682634730538923) internal successors, (914), 682 states have internal predecessors, (914), 112 states have call successors, (112), 52 states have call predecessors, (112), 74 states have return successors, (145), 128 states have call predecessors, (145), 105 states have call successors, (145) [2022-01-31 21:56:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1171 transitions. [2022-01-31 21:56:18,612 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1171 transitions. Word has length 52 [2022-01-31 21:56:18,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:18,612 INFO L470 AbstractCegarLoop]: Abstraction has 855 states and 1171 transitions. [2022-01-31 21:56:18,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 8 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:18,612 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1171 transitions. [2022-01-31 21:56:18,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 21:56:18,615 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:18,615 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:18,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-01-31 21:56:18,615 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:18,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:18,617 INFO L85 PathProgramCache]: Analyzing trace with hash 926676691, now seen corresponding path program 1 times [2022-01-31 21:56:18,617 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:18,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [695635881] [2022-01-31 21:56:18,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:18,618 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:18,620 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:18,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:56:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-01-31 21:56:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:18,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:18,745 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:18,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [695635881] [2022-01-31 21:56:18,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [695635881] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:18,746 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:18,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:56:18,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598082773] [2022-01-31 21:56:18,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:18,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:56:18,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:18,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:56:18,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:56:18,747 INFO L87 Difference]: Start difference. First operand 855 states and 1171 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:20,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:20,540 INFO L93 Difference]: Finished difference Result 1188 states and 1671 transitions. [2022-01-31 21:56:20,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:56:20,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 7 states have call predecessors, (10), 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:20,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:20,544 INFO L225 Difference]: With dead ends: 1188 [2022-01-31 21:56:20,544 INFO L226 Difference]: Without dead ends: 947 [2022-01-31 21:56:20,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:56:20,545 INFO L933 BasicCegarLoop]: 638 mSDtfsCounter, 1034 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 1736 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1067 SdHoareTripleChecker+Valid, 1163 SdHoareTripleChecker+Invalid, 2098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 1736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:20,545 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1067 Valid, 1163 Invalid, 2098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 1736 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-01-31 21:56:20,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-01-31 21:56:20,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 827. [2022-01-31 21:56:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 647 states have (on average 1.3663060278207109) internal successors, (884), 659 states have internal predecessors, (884), 110 states have call successors, (110), 51 states have call predecessors, (110), 69 states have return successors, (140), 123 states have call predecessors, (140), 104 states have call successors, (140) [2022-01-31 21:56:20,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1134 transitions. [2022-01-31 21:56:20,733 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1134 transitions. Word has length 54 [2022-01-31 21:56:20,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:20,733 INFO L470 AbstractCegarLoop]: Abstraction has 827 states and 1134 transitions. [2022-01-31 21:56:20,733 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (10), 7 states have call predecessors, (10), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-01-31 21:56:20,733 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1134 transitions. [2022-01-31 21:56:20,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 21:56:20,735 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:20,736 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:20,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-01-31 21:56:20,736 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:20,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:20,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1474957070, now seen corresponding path program 1 times [2022-01-31 21:56:20,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:20,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1257926495] [2022-01-31 21:56:20,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:20,737 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:20,739 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:20,748 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 0 [2022-01-31 21:56:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:20,909 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:20,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1257926495] [2022-01-31 21:56:20,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1257926495] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:20,910 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:20,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:56:20,910 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758848077] [2022-01-31 21:56:20,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:20,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:56:20,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:20,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:56:20,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:20,911 INFO L87 Difference]: Start difference. First operand 827 states and 1134 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 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,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:23,737 INFO L93 Difference]: Finished difference Result 962 states and 1364 transitions. [2022-01-31 21:56:23,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:56:23,737 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2022-01-31 21:56:23,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:23,740 INFO L225 Difference]: With dead ends: 962 [2022-01-31 21:56:23,740 INFO L226 Difference]: Without dead ends: 958 [2022-01-31 21:56:23,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:23,741 INFO L933 BasicCegarLoop]: 703 mSDtfsCounter, 371 mSDsluCounter, 1675 mSDsCounter, 0 mSdLazyCounter, 4742 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 2378 SdHoareTripleChecker+Invalid, 4881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 4742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:23,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 2378 Invalid, 4881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 4742 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-01-31 21:56:23,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2022-01-31 21:56:23,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 834. [2022-01-31 21:56:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 653 states have (on average 1.3644716692189893) internal successors, (891), 666 states have internal predecessors, (891), 111 states have call successors, (111), 51 states have call predecessors, (111), 69 states have return successors, (141), 124 states have call predecessors, (141), 105 states have call successors, (141) [2022-01-31 21:56:23,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1143 transitions. [2022-01-31 21:56:23,921 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1143 transitions. Word has length 51 [2022-01-31 21:56:23,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:23,921 INFO L470 AbstractCegarLoop]: Abstraction has 834 states and 1143 transitions. [2022-01-31 21:56:23,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 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,922 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1143 transitions. [2022-01-31 21:56:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-31 21:56:23,924 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:23,924 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:23,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-01-31 21:56:23,924 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:23,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:23,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1475233900, now seen corresponding path program 1 times [2022-01-31 21:56:23,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:23,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [886550177] [2022-01-31 21:56:23,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:23,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:23,927 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:23,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:24,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:24,117 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,118 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:24,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [886550177] [2022-01-31 21:56:24,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [886550177] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:24,118 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:24,118 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:56:24,118 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182982402] [2022-01-31 21:56:24,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:24,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:56:24,118 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:24,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:56:24,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:56:24,119 INFO L87 Difference]: Start difference. First operand 834 states and 1143 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 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,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:26,492 INFO L93 Difference]: Finished difference Result 977 states and 1380 transitions. [2022-01-31 21:56:26,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:26,492 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 51 [2022-01-31 21:56:26,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:26,496 INFO L225 Difference]: With dead ends: 977 [2022-01-31 21:56:26,496 INFO L226 Difference]: Without dead ends: 953 [2022-01-31 21:56:26,497 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:26,497 INFO L933 BasicCegarLoop]: 705 mSDtfsCounter, 737 mSDsluCounter, 1731 mSDsCounter, 0 mSdLazyCounter, 3839 mSolverCounterSat, 275 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 4114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 275 IncrementalHoareTripleChecker+Valid, 3839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:26,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [739 Valid, 2436 Invalid, 4114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [275 Valid, 3839 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-31 21:56:26,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-01-31 21:56:26,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 833. [2022-01-31 21:56:26,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 652 states have (on average 1.3634969325153374) internal successors, (889), 665 states have internal predecessors, (889), 111 states have call successors, (111), 51 states have call predecessors, (111), 69 states have return successors, (141), 124 states have call predecessors, (141), 105 states have call successors, (141) [2022-01-31 21:56:26,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1141 transitions. [2022-01-31 21:56:26,696 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1141 transitions. Word has length 51 [2022-01-31 21:56:26,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:26,696 INFO L470 AbstractCegarLoop]: Abstraction has 833 states and 1141 transitions. [2022-01-31 21:56:26,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (7), 6 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,697 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1141 transitions. [2022-01-31 21:56:26,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-01-31 21:56:26,698 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:26,699 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:26,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-01-31 21:56:26,699 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:26,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:26,699 INFO L85 PathProgramCache]: Analyzing trace with hash 714941957, now seen corresponding path program 1 times [2022-01-31 21:56:26,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:26,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2015025613] [2022-01-31 21:56:26,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:26,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:26,702 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:26,947 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:26,947 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:26,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2015025613] [2022-01-31 21:56:26,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2015025613] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:26,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:26,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:56:26,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366557673] [2022-01-31 21:56:26,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:26,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:56:26,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:26,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:56:26,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:26,949 INFO L87 Difference]: Start difference. First operand 833 states and 1141 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 21:56:29,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:29,344 INFO L93 Difference]: Finished difference Result 963 states and 1362 transitions. [2022-01-31 21:56:29,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:29,345 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 53 [2022-01-31 21:56:29,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:29,349 INFO L225 Difference]: With dead ends: 963 [2022-01-31 21:56:29,349 INFO L226 Difference]: Without dead ends: 957 [2022-01-31 21:56:29,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:56:29,350 INFO L933 BasicCegarLoop]: 653 mSDtfsCounter, 1931 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 2469 mSolverCounterSat, 649 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1957 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 3118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 649 IncrementalHoareTripleChecker+Valid, 2469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:29,350 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1957 Valid, 1476 Invalid, 3118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [649 Valid, 2469 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-31 21:56:29,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2022-01-31 21:56:29,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 833. [2022-01-31 21:56:29,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 652 states have (on average 1.361963190184049) internal successors, (888), 665 states have internal predecessors, (888), 111 states have call successors, (111), 51 states have call predecessors, (111), 69 states have return successors, (141), 124 states have call predecessors, (141), 105 states have call successors, (141) [2022-01-31 21:56:29,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1140 transitions. [2022-01-31 21:56:29,529 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1140 transitions. Word has length 53 [2022-01-31 21:56:29,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:29,529 INFO L470 AbstractCegarLoop]: Abstraction has 833 states and 1140 transitions. [2022-01-31 21:56:29,530 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 21:56:29,530 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1140 transitions. [2022-01-31 21:56:29,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-31 21:56:29,532 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:29,532 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:29,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-01-31 21:56:29,532 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:29,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:29,533 INFO L85 PathProgramCache]: Analyzing trace with hash 345342278, now seen corresponding path program 1 times [2022-01-31 21:56:29,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:29,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1454633037] [2022-01-31 21:56:29,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:29,533 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:29,535 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:29,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:56:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:29,717 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,718 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:29,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1454633037] [2022-01-31 21:56:29,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1454633037] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:29,718 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:29,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:56:29,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069856837] [2022-01-31 21:56:29,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:29,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:56:29,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:29,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:56:29,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:56:29,719 INFO L87 Difference]: Start difference. First operand 833 states and 1140 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 6 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:31,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:31,592 INFO L93 Difference]: Finished difference Result 967 states and 1365 transitions. [2022-01-31 21:56:31,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:31,595 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 6 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 52 [2022-01-31 21:56:31,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:31,599 INFO L225 Difference]: With dead ends: 967 [2022-01-31 21:56:31,599 INFO L226 Difference]: Without dead ends: 931 [2022-01-31 21:56:31,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:56:31,601 INFO L933 BasicCegarLoop]: 656 mSDtfsCounter, 2284 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 1462 mSolverCounterSat, 719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2299 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 2181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 719 IncrementalHoareTripleChecker+Valid, 1462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:31,601 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2299 Valid, 1257 Invalid, 2181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [719 Valid, 1462 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-31 21:56:31,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2022-01-31 21:56:31,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 805. [2022-01-31 21:56:31,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 629 states have (on average 1.370429252782194) internal successors, (862), 641 states have internal predecessors, (862), 108 states have call successors, (108), 49 states have call predecessors, (108), 67 states have return successors, (138), 121 states have call predecessors, (138), 102 states have call successors, (138) [2022-01-31 21:56:31,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1108 transitions. [2022-01-31 21:56:31,775 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1108 transitions. Word has length 52 [2022-01-31 21:56:31,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:31,776 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 1108 transitions. [2022-01-31 21:56:31,776 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (7), 6 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:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1108 transitions. [2022-01-31 21:56:31,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-01-31 21:56:31,778 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:31,778 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:31,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-01-31 21:56:31,778 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:31,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:31,779 INFO L85 PathProgramCache]: Analyzing trace with hash 56348596, now seen corresponding path program 1 times [2022-01-31 21:56:31,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:31,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [812811834] [2022-01-31 21:56:31,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:31,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:31,781 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:31,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:31,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:31,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:31,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:31,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:31,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:31,964 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 3 [2022-01-31 21:56:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:32,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:32,045 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,045 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:32,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [812811834] [2022-01-31 21:56:32,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [812811834] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:32,046 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:32,046 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:56:32,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756537299] [2022-01-31 21:56:32,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:32,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:56:32,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:32,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:56:32,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:56:32,047 INFO L87 Difference]: Start difference. First operand 805 states and 1108 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 21:56:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:34,308 INFO L93 Difference]: Finished difference Result 933 states and 1327 transitions. [2022-01-31 21:56:34,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:56:34,309 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 54 [2022-01-31 21:56:34,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:34,312 INFO L225 Difference]: With dead ends: 933 [2022-01-31 21:56:34,312 INFO L226 Difference]: Without dead ends: 927 [2022-01-31 21:56:34,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:56:34,313 INFO L933 BasicCegarLoop]: 624 mSDtfsCounter, 2924 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 1811 mSolverCounterSat, 1081 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2950 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 2892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1081 IncrementalHoareTripleChecker+Valid, 1811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:34,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2950 Valid, 1295 Invalid, 2892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1081 Valid, 1811 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-31 21:56:34,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2022-01-31 21:56:34,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 805. [2022-01-31 21:56:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 629 states have (on average 1.368839427662957) internal successors, (861), 641 states have internal predecessors, (861), 108 states have call successors, (108), 49 states have call predecessors, (108), 67 states have return successors, (138), 121 states have call predecessors, (138), 102 states have call successors, (138) [2022-01-31 21:56:34,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1107 transitions. [2022-01-31 21:56:34,502 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1107 transitions. Word has length 54 [2022-01-31 21:56:34,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:34,502 INFO L470 AbstractCegarLoop]: Abstraction has 805 states and 1107 transitions. [2022-01-31 21:56:34,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 7 states have internal predecessors, (40), 3 states have call successors, (8), 8 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 21:56:34,502 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1107 transitions. [2022-01-31 21:56:34,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 21:56:34,504 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:34,504 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:34,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-01-31 21:56:34,504 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:34,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:34,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2058958222, now seen corresponding path program 1 times [2022-01-31 21:56:34,505 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:34,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1323326024] [2022-01-31 21:56:34,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:34,505 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:34,507 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:34,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:34,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:34,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:34,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:34,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:34,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:34,724 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:34,724 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:34,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1323326024] [2022-01-31 21:56:34,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1323326024] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:34,725 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:34,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:56:34,725 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485387681] [2022-01-31 21:56:34,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:34,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:56:34,726 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:34,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:56:34,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:56:34,726 INFO L87 Difference]: Start difference. First operand 805 states and 1107 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 21:56:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:37,337 INFO L93 Difference]: Finished difference Result 956 states and 1356 transitions. [2022-01-31 21:56:37,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:56:37,338 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 55 [2022-01-31 21:56:37,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:37,341 INFO L225 Difference]: With dead ends: 956 [2022-01-31 21:56:37,341 INFO L226 Difference]: Without dead ends: 916 [2022-01-31 21:56:37,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:56:37,342 INFO L933 BasicCegarLoop]: 675 mSDtfsCounter, 1419 mSDsluCounter, 1980 mSDsCounter, 0 mSdLazyCounter, 4556 mSolverCounterSat, 569 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1422 SdHoareTripleChecker+Valid, 2655 SdHoareTripleChecker+Invalid, 5125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 569 IncrementalHoareTripleChecker+Valid, 4556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:37,342 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1422 Valid, 2655 Invalid, 5125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [569 Valid, 4556 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-01-31 21:56:37,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2022-01-31 21:56:37,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 796. [2022-01-31 21:56:37,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 622 states have (on average 1.3520900321543408) internal successors, (841), 634 states have internal predecessors, (841), 106 states have call successors, (106), 49 states have call predecessors, (106), 67 states have return successors, (136), 119 states have call predecessors, (136), 100 states have call successors, (136) [2022-01-31 21:56:37,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1083 transitions. [2022-01-31 21:56:37,533 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1083 transitions. Word has length 55 [2022-01-31 21:56:37,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:37,533 INFO L470 AbstractCegarLoop]: Abstraction has 796 states and 1083 transitions. [2022-01-31 21:56:37,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 21:56:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1083 transitions. [2022-01-31 21:56:37,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 21:56:37,535 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:37,535 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:37,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-01-31 21:56:37,536 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:37,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:37,536 INFO L85 PathProgramCache]: Analyzing trace with hash 369563974, now seen corresponding path program 1 times [2022-01-31 21:56:37,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:37,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1781844676] [2022-01-31 21:56:37,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:37,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:37,538 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:37,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 21:56:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:37,809 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,809 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:37,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1781844676] [2022-01-31 21:56:37,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1781844676] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:37,809 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:37,809 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:56:37,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080227287] [2022-01-31 21:56:37,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:37,810 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:56:37,810 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:37,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:56:37,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:56:37,811 INFO L87 Difference]: Start difference. First operand 796 states and 1083 transitions. Second operand has 15 states, 15 states have (on average 2.8) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:40,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:40,631 INFO L93 Difference]: Finished difference Result 932 states and 1310 transitions. [2022-01-31 21:56:40,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:40,633 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 56 [2022-01-31 21:56:40,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:40,635 INFO L225 Difference]: With dead ends: 932 [2022-01-31 21:56:40,635 INFO L226 Difference]: Without dead ends: 914 [2022-01-31 21:56:40,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:40,636 INFO L933 BasicCegarLoop]: 670 mSDtfsCounter, 991 mSDsluCounter, 2105 mSDsCounter, 0 mSdLazyCounter, 5078 mSolverCounterSat, 399 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 2775 SdHoareTripleChecker+Invalid, 5477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 399 IncrementalHoareTripleChecker+Valid, 5078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:40,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [993 Valid, 2775 Invalid, 5477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [399 Valid, 5078 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-01-31 21:56:40,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2022-01-31 21:56:40,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 794. [2022-01-31 21:56:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 621 states have (on average 1.3510466988727858) internal successors, (839), 633 states have internal predecessors, (839), 105 states have call successors, (105), 49 states have call predecessors, (105), 67 states have return successors, (135), 118 states have call predecessors, (135), 99 states have call successors, (135) [2022-01-31 21:56:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1079 transitions. [2022-01-31 21:56:40,825 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1079 transitions. Word has length 56 [2022-01-31 21:56:40,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:40,825 INFO L470 AbstractCegarLoop]: Abstraction has 794 states and 1079 transitions. [2022-01-31 21:56:40,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 7 states have internal predecessors, (42), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:40,825 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1079 transitions. [2022-01-31 21:56:40,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-01-31 21:56:40,827 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:40,827 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:40,828 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-01-31 21:56:40,828 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:40,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:40,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1588510132, now seen corresponding path program 1 times [2022-01-31 21:56:40,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:40,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1488096780] [2022-01-31 21:56:40,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:40,829 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:40,830 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:40,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:40,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:40,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:40,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:40,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 21:56:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:40,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:41,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:41,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:41,067 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:41,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1488096780] [2022-01-31 21:56:41,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1488096780] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:41,067 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:41,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:56:41,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297346445] [2022-01-31 21:56:41,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:41,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:56:41,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:41,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:56:41,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:56:41,069 INFO L87 Difference]: Start difference. First operand 794 states and 1079 transitions. Second operand has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:43,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:43,543 INFO L93 Difference]: Finished difference Result 927 states and 1303 transitions. [2022-01-31 21:56:43,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:56:43,543 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 55 [2022-01-31 21:56:43,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:43,546 INFO L225 Difference]: With dead ends: 927 [2022-01-31 21:56:43,546 INFO L226 Difference]: Without dead ends: 909 [2022-01-31 21:56:43,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:43,547 INFO L933 BasicCegarLoop]: 654 mSDtfsCounter, 363 mSDsluCounter, 1927 mSDsCounter, 0 mSdLazyCounter, 4700 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 2581 SdHoareTripleChecker+Invalid, 4840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 4700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:43,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [365 Valid, 2581 Invalid, 4840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 4700 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-01-31 21:56:43,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2022-01-31 21:56:43,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 789. [2022-01-31 21:56:43,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 618 states have (on average 1.3511326860841424) internal successors, (835), 630 states have internal predecessors, (835), 104 states have call successors, (104), 49 states have call predecessors, (104), 66 states have return successors, (133), 116 states have call predecessors, (133), 98 states have call successors, (133) [2022-01-31 21:56:43,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1072 transitions. [2022-01-31 21:56:43,723 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1072 transitions. Word has length 55 [2022-01-31 21:56:43,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:43,724 INFO L470 AbstractCegarLoop]: Abstraction has 789 states and 1072 transitions. [2022-01-31 21:56:43,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1072 transitions. [2022-01-31 21:56:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-01-31 21:56:43,725 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:43,726 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:43,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-01-31 21:56:43,726 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:43,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:43,726 INFO L85 PathProgramCache]: Analyzing trace with hash 170307092, now seen corresponding path program 1 times [2022-01-31 21:56:43,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:43,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1116772777] [2022-01-31 21:56:43,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:43,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:43,728 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:56:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:56:43,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:43,881 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,881 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:43,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1116772777] [2022-01-31 21:56:43,881 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1116772777] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:43,881 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:43,881 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:56:43,881 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610408677] [2022-01-31 21:56:43,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:43,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:56:43,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:43,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:56:43,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:43,882 INFO L87 Difference]: Start difference. First operand 789 states and 1072 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 21:56:46,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:46,106 INFO L93 Difference]: Finished difference Result 974 states and 1354 transitions. [2022-01-31 21:56:46,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:56:46,106 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 56 [2022-01-31 21:56:46,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:46,110 INFO L225 Difference]: With dead ends: 974 [2022-01-31 21:56:46,110 INFO L226 Difference]: Without dead ends: 931 [2022-01-31 21:56:46,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:56:46,111 INFO L933 BasicCegarLoop]: 675 mSDtfsCounter, 1170 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1314 SdHoareTripleChecker+Invalid, 2736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:46,111 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1180 Valid, 1314 Invalid, 2736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 2494 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-31 21:56:46,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2022-01-31 21:56:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 789. [2022-01-31 21:56:46,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 618 states have (on average 1.3495145631067962) internal successors, (834), 630 states have internal predecessors, (834), 104 states have call successors, (104), 49 states have call predecessors, (104), 66 states have return successors, (133), 116 states have call predecessors, (133), 98 states have call successors, (133) [2022-01-31 21:56:46,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1071 transitions. [2022-01-31 21:56:46,308 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1071 transitions. Word has length 56 [2022-01-31 21:56:46,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:46,309 INFO L470 AbstractCegarLoop]: Abstraction has 789 states and 1071 transitions. [2022-01-31 21:56:46,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 4 states have internal predecessors, (42), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 21:56:46,309 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1071 transitions. [2022-01-31 21:56:46,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-31 21:56:46,311 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:46,312 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 21:56:46,312 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-01-31 21:56:46,312 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:46,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:46,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1014540615, now seen corresponding path program 1 times [2022-01-31 21:56:46,313 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:46,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1193878300] [2022-01-31 21:56:46,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:46,313 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:46,315 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-31 21:56:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-01-31 21:56:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:46,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:46,467 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:46,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1193878300] [2022-01-31 21:56:46,468 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1193878300] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:46,468 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:46,468 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:56:46,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919678281] [2022-01-31 21:56:46,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:46,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:56:46,469 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:46,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:56:46,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:56:46,469 INFO L87 Difference]: Start difference. First operand 789 states and 1071 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 21:56:47,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:47,724 INFO L93 Difference]: Finished difference Result 1224 states and 1667 transitions. [2022-01-31 21:56:47,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:56:47,725 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 73 [2022-01-31 21:56:47,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:47,728 INFO L225 Difference]: With dead ends: 1224 [2022-01-31 21:56:47,728 INFO L226 Difference]: Without dead ends: 778 [2022-01-31 21:56:47,729 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:56:47,730 INFO L933 BasicCegarLoop]: 530 mSDtfsCounter, 1764 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 630 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1764 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 630 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:47,730 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1764 Valid, 797 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [630 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:56:47,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2022-01-31 21:56:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 778. [2022-01-31 21:56:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 609 states have (on average 1.341543513957307) internal successors, (817), 620 states have internal predecessors, (817), 103 states have call successors, (103), 49 states have call predecessors, (103), 65 states have return successors, (122), 115 states have call predecessors, (122), 97 states have call successors, (122) [2022-01-31 21:56:47,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1042 transitions. [2022-01-31 21:56:47,930 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1042 transitions. Word has length 73 [2022-01-31 21:56:47,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:47,930 INFO L470 AbstractCegarLoop]: Abstraction has 778 states and 1042 transitions. [2022-01-31 21:56:47,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (12), 9 states have call predecessors, (12), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 21:56:47,931 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1042 transitions. [2022-01-31 21:56:47,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 21:56:47,932 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:47,932 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:47,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-01-31 21:56:47,933 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:47,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:47,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1574836108, now seen corresponding path program 1 times [2022-01-31 21:56:47,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:47,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1465439077] [2022-01-31 21:56:47,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:47,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:47,935 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:47,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:48,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:48,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:48,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 21:56:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:48,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:48,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:56:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:48,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:48,068 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:48,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1465439077] [2022-01-31 21:56:48,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1465439077] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:48,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:48,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 21:56:48,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980433562] [2022-01-31 21:56:48,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:48,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 21:56:48,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:48,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 21:56:48,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-01-31 21:56:48,070 INFO L87 Difference]: Start difference. First operand 778 states and 1042 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (12), 8 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:49,368 INFO L93 Difference]: Finished difference Result 911 states and 1202 transitions. [2022-01-31 21:56:49,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:56:49,369 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (12), 8 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 61 [2022-01-31 21:56:49,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:49,371 INFO L225 Difference]: With dead ends: 911 [2022-01-31 21:56:49,371 INFO L226 Difference]: Without dead ends: 820 [2022-01-31 21:56:49,372 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:56:49,372 INFO L933 BasicCegarLoop]: 606 mSDtfsCounter, 1177 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 1002 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1002 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:49,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1185 Valid, 1027 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1002 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 21:56:49,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2022-01-31 21:56:49,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 788. [2022-01-31 21:56:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 616 states have (on average 1.3327922077922079) internal successors, (821), 627 states have internal predecessors, (821), 103 states have call successors, (103), 51 states have call predecessors, (103), 68 states have return successors, (124), 116 states have call predecessors, (124), 98 states have call successors, (124) [2022-01-31 21:56:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1048 transitions. [2022-01-31 21:56:49,542 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1048 transitions. Word has length 61 [2022-01-31 21:56:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:49,543 INFO L470 AbstractCegarLoop]: Abstraction has 788 states and 1048 transitions. [2022-01-31 21:56:49,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 3 states have internal predecessors, (43), 3 states have call successors, (12), 8 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:49,543 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1048 transitions. [2022-01-31 21:56:49,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-31 21:56:49,544 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:49,544 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] [2022-01-31 21:56:49,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-01-31 21:56:49,545 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:49,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:49,545 INFO L85 PathProgramCache]: Analyzing trace with hash 163789660, now seen corresponding path program 1 times [2022-01-31 21:56:49,545 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:49,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [676360152] [2022-01-31 21:56:49,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:49,546 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:49,547 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:49,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:49,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 21:56:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:49,863 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,863 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:49,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [676360152] [2022-01-31 21:56:49,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [676360152] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:49,864 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:49,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:56:49,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294606795] [2022-01-31 21:56:49,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:49,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:56:49,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:49,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:56:49,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:56:49,865 INFO L87 Difference]: Start difference. First operand 788 states and 1048 transitions. Second operand has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 21:56:52,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:52,493 INFO L93 Difference]: Finished difference Result 814 states and 1076 transitions. [2022-01-31 21:56:52,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 21:56:52,493 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2022-01-31 21:56:52,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:52,496 INFO L225 Difference]: With dead ends: 814 [2022-01-31 21:56:52,496 INFO L226 Difference]: Without dead ends: 790 [2022-01-31 21:56:52,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2022-01-31 21:56:52,497 INFO L933 BasicCegarLoop]: 583 mSDtfsCounter, 709 mSDsluCounter, 1807 mSDsCounter, 0 mSdLazyCounter, 5602 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 2390 SdHoareTripleChecker+Invalid, 5858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 5602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:52,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [712 Valid, 2390 Invalid, 5858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 5602 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-01-31 21:56:52,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2022-01-31 21:56:52,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 786. [2022-01-31 21:56:52,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 615 states have (on average 1.3317073170731708) internal successors, (819), 626 states have internal predecessors, (819), 102 states have call successors, (102), 51 states have call predecessors, (102), 68 states have return successors, (123), 115 states have call predecessors, (123), 97 states have call successors, (123) [2022-01-31 21:56:52,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1044 transitions. [2022-01-31 21:56:52,676 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1044 transitions. Word has length 62 [2022-01-31 21:56:52,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:52,676 INFO L470 AbstractCegarLoop]: Abstraction has 786 states and 1044 transitions. [2022-01-31 21:56:52,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 10 states have internal predecessors, (46), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 21:56:52,676 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1044 transitions. [2022-01-31 21:56:52,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-31 21:56:52,678 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:52,678 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:52,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-01-31 21:56:52,678 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:52,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:52,679 INFO L85 PathProgramCache]: Analyzing trace with hash -939525102, now seen corresponding path program 1 times [2022-01-31 21:56:52,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:52,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1423537797] [2022-01-31 21:56:52,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:52,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:52,681 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:52,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:52,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:52,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:56:52,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:56:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:56:52,978 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:52,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1423537797] [2022-01-31 21:56:52,979 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1423537797] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:52,979 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:52,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:56:52,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722229329] [2022-01-31 21:56:52,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:52,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:56:52,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:52,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:56:52,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:56:52,980 INFO L87 Difference]: Start difference. First operand 786 states and 1044 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 21:56:55,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:55,495 INFO L93 Difference]: Finished difference Result 812 states and 1072 transitions. [2022-01-31 21:56:55,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 21:56:55,495 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2022-01-31 21:56:55,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:55,498 INFO L225 Difference]: With dead ends: 812 [2022-01-31 21:56:55,498 INFO L226 Difference]: Without dead ends: 787 [2022-01-31 21:56:55,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2022-01-31 21:56:55,499 INFO L933 BasicCegarLoop]: 562 mSDtfsCounter, 717 mSDsluCounter, 1592 mSDsCounter, 0 mSdLazyCounter, 5342 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 2154 SdHoareTripleChecker+Invalid, 5594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 5342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:55,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [720 Valid, 2154 Invalid, 5594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 5342 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-31 21:56:55,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2022-01-31 21:56:55,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 785. [2022-01-31 21:56:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 614 states have (on average 1.3159609120521172) internal successors, (808), 625 states have internal predecessors, (808), 102 states have call successors, (102), 51 states have call predecessors, (102), 68 states have return successors, (123), 115 states have call predecessors, (123), 97 states have call successors, (123) [2022-01-31 21:56:55,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1033 transitions. [2022-01-31 21:56:55,707 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1033 transitions. Word has length 59 [2022-01-31 21:56:55,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:55,708 INFO L470 AbstractCegarLoop]: Abstraction has 785 states and 1033 transitions. [2022-01-31 21:56:55,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 10 states have internal predecessors, (43), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 21:56:55,708 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1033 transitions. [2022-01-31 21:56:55,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-01-31 21:56:55,710 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:55,710 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:55,710 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-01-31 21:56:55,710 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:55,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:55,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1364943258, now seen corresponding path program 1 times [2022-01-31 21:56:55,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:55,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1236034401] [2022-01-31 21:56:55,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:55,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:55,713 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:55,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:55,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:55,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:55,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:55,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:55,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:55,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:56,003 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:56,003 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:56,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1236034401] [2022-01-31 21:56:56,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1236034401] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:56,004 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:56,004 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:56:56,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958070242] [2022-01-31 21:56:56,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:56,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:56:56,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:56,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:56:56,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:56,005 INFO L87 Difference]: Start difference. First operand 785 states and 1033 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:58,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:56:58,403 INFO L93 Difference]: Finished difference Result 802 states and 1051 transitions. [2022-01-31 21:56:58,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:56:58,404 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2022-01-31 21:56:58,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:56:58,406 INFO L225 Difference]: With dead ends: 802 [2022-01-31 21:56:58,406 INFO L226 Difference]: Without dead ends: 782 [2022-01-31 21:56:58,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:56:58,406 INFO L933 BasicCegarLoop]: 572 mSDtfsCounter, 641 mSDsluCounter, 1571 mSDsCounter, 0 mSdLazyCounter, 4881 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 2143 SdHoareTripleChecker+Invalid, 5104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 4881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:56:58,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [643 Valid, 2143 Invalid, 5104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 4881 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-31 21:56:58,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2022-01-31 21:56:58,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 782. [2022-01-31 21:56:58,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 612 states have (on average 1.315359477124183) internal successors, (805), 623 states have internal predecessors, (805), 101 states have call successors, (101), 51 states have call predecessors, (101), 68 states have return successors, (122), 114 states have call predecessors, (122), 96 states have call successors, (122) [2022-01-31 21:56:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1028 transitions. [2022-01-31 21:56:58,588 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1028 transitions. Word has length 58 [2022-01-31 21:56:58,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:56:58,588 INFO L470 AbstractCegarLoop]: Abstraction has 782 states and 1028 transitions. [2022-01-31 21:56:58,588 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 1 states have call successors, (6) [2022-01-31 21:56:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1028 transitions. [2022-01-31 21:56:58,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-01-31 21:56:58,590 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:56:58,590 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:56:58,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-01-31 21:56:58,590 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:56:58,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:56:58,590 INFO L85 PathProgramCache]: Analyzing trace with hash 483454952, now seen corresponding path program 1 times [2022-01-31 21:56:58,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:56:58,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1535764982] [2022-01-31 21:56:58,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:56:58,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:56:58,592 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:56:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:58,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:56:58,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:58,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:56:58,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:58,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:56:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:58,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:56:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:58,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:56:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:58,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 21:56:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:56:58,854 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:58,854 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:56:58,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1535764982] [2022-01-31 21:56:58,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1535764982] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:56:58,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:56:58,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:56:58,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331863224] [2022-01-31 21:56:58,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:56:58,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:56:58,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:56:58,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:56:58,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:56:58,855 INFO L87 Difference]: Start difference. First operand 782 states and 1028 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 21:57:01,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:01,171 INFO L93 Difference]: Finished difference Result 835 states and 1083 transitions. [2022-01-31 21:57:01,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 21:57:01,172 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 59 [2022-01-31 21:57:01,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:01,174 INFO L225 Difference]: With dead ends: 835 [2022-01-31 21:57:01,174 INFO L226 Difference]: Without dead ends: 770 [2022-01-31 21:57:01,175 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:57:01,176 INFO L933 BasicCegarLoop]: 567 mSDtfsCounter, 963 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 4086 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 1937 SdHoareTripleChecker+Invalid, 4432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 4086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:01,176 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [966 Valid, 1937 Invalid, 4432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 4086 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-31 21:57:01,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-01-31 21:57:01,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 770. [2022-01-31 21:57:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 603 states have (on average 1.3101160862354893) internal successors, (790), 614 states have internal predecessors, (790), 98 states have call successors, (98), 51 states have call predecessors, (98), 68 states have return successors, (119), 111 states have call predecessors, (119), 93 states have call successors, (119) [2022-01-31 21:57:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1007 transitions. [2022-01-31 21:57:01,362 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1007 transitions. Word has length 59 [2022-01-31 21:57:01,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:01,363 INFO L470 AbstractCegarLoop]: Abstraction has 770 states and 1007 transitions. [2022-01-31 21:57:01,363 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 8 states have internal predecessors, (45), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 21:57:01,363 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1007 transitions. [2022-01-31 21:57:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 21:57:01,364 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:57:01,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-01-31 21:57:01,364 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:01,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:01,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1218321174, now seen corresponding path program 1 times [2022-01-31 21:57:01,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:01,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2006531701] [2022-01-31 21:57:01,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:01,365 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:01,367 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:57:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 21:57:01,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:01,537 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:57:01,537 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:01,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2006531701] [2022-01-31 21:57:01,537 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2006531701] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:01,537 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:01,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-31 21:57:01,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538818667] [2022-01-31 21:57:01,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:01,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-31 21:57:01,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:01,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-31 21:57:01,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:57:01,538 INFO L87 Difference]: Start difference. First operand 770 states and 1007 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:57:03,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:03,028 INFO L93 Difference]: Finished difference Result 913 states and 1205 transitions. [2022-01-31 21:57:03,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:57:03,028 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2022-01-31 21:57:03,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:03,031 INFO L225 Difference]: With dead ends: 913 [2022-01-31 21:57:03,031 INFO L226 Difference]: Without dead ends: 808 [2022-01-31 21:57:03,031 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:57:03,032 INFO L933 BasicCegarLoop]: 536 mSDtfsCounter, 972 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 1687 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 2048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 1687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:03,032 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [974 Valid, 1181 Invalid, 2048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 1687 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 21:57:03,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2022-01-31 21:57:03,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 777. [2022-01-31 21:57:03,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 608 states have (on average 1.3108552631578947) internal successors, (797), 620 states have internal predecessors, (797), 99 states have call successors, (99), 51 states have call predecessors, (99), 69 states have return successors, (126), 112 states have call predecessors, (126), 94 states have call successors, (126) [2022-01-31 21:57:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1022 transitions. [2022-01-31 21:57:03,262 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1022 transitions. Word has length 60 [2022-01-31 21:57:03,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:03,262 INFO L470 AbstractCegarLoop]: Abstraction has 777 states and 1022 transitions. [2022-01-31 21:57:03,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:57:03,262 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1022 transitions. [2022-01-31 21:57:03,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 21:57:03,263 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:03,264 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:57:03,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-01-31 21:57:03,264 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:03,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:03,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1493080788, now seen corresponding path program 1 times [2022-01-31 21:57:03,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:03,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [53880473] [2022-01-31 21:57:03,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:03,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:03,266 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:03,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:03,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:03,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:57:03,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 21:57:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:03,474 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:57:03,474 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:03,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [53880473] [2022-01-31 21:57:03,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [53880473] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:03,474 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:03,474 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:57:03,475 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405645063] [2022-01-31 21:57:03,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:03,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:57:03,475 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:03,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:57:03,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:57:03,476 INFO L87 Difference]: Start difference. First operand 777 states and 1022 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:57:05,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:05,412 INFO L93 Difference]: Finished difference Result 799 states and 1045 transitions. [2022-01-31 21:57:05,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:57:05,413 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 60 [2022-01-31 21:57:05,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:05,415 INFO L225 Difference]: With dead ends: 799 [2022-01-31 21:57:05,415 INFO L226 Difference]: Without dead ends: 775 [2022-01-31 21:57:05,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:57:05,416 INFO L933 BasicCegarLoop]: 535 mSDtfsCounter, 366 mSDsluCounter, 1231 mSDsCounter, 0 mSdLazyCounter, 3699 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 3817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 3699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:05,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 1766 Invalid, 3817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 3699 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-31 21:57:05,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2022-01-31 21:57:05,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 775. [2022-01-31 21:57:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 607 states have (on average 1.3097199341021417) internal successors, (795), 619 states have internal predecessors, (795), 98 states have call successors, (98), 51 states have call predecessors, (98), 69 states have return successors, (125), 111 states have call predecessors, (125), 93 states have call successors, (125) [2022-01-31 21:57:05,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1018 transitions. [2022-01-31 21:57:05,637 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1018 transitions. Word has length 60 [2022-01-31 21:57:05,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:05,637 INFO L470 AbstractCegarLoop]: Abstraction has 775 states and 1018 transitions. [2022-01-31 21:57:05,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 7 states have internal predecessors, (44), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:57:05,638 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1018 transitions. [2022-01-31 21:57:05,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-01-31 21:57:05,639 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:05,639 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:57:05,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-01-31 21:57:05,639 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:05,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:05,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1062943735, now seen corresponding path program 1 times [2022-01-31 21:57:05,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:05,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [732895725] [2022-01-31 21:57:05,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:05,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:05,641 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:05,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:05,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:05,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:05,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:05,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:05,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:57:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:05,893 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:57:05,893 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:05,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [732895725] [2022-01-31 21:57:05,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [732895725] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:05,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:05,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:57:05,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513481585] [2022-01-31 21:57:05,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:05,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:57:05,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:05,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:57:05,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:57:05,895 INFO L87 Difference]: Start difference. First operand 775 states and 1018 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 21:57:07,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:07,957 INFO L93 Difference]: Finished difference Result 837 states and 1087 transitions. [2022-01-31 21:57:07,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 21:57:07,958 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 60 [2022-01-31 21:57:07,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:07,960 INFO L225 Difference]: With dead ends: 837 [2022-01-31 21:57:07,960 INFO L226 Difference]: Without dead ends: 767 [2022-01-31 21:57:07,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:57:07,962 INFO L933 BasicCegarLoop]: 529 mSDtfsCounter, 659 mSDsluCounter, 1237 mSDsCounter, 0 mSdLazyCounter, 3967 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 662 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 4201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 3967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:07,962 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [662 Valid, 1766 Invalid, 4201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 3967 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-31 21:57:07,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2022-01-31 21:57:08,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 767. [2022-01-31 21:57:08,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 601 states have (on average 1.302828618968386) internal successors, (783), 613 states have internal predecessors, (783), 96 states have call successors, (96), 51 states have call predecessors, (96), 69 states have return successors, (123), 109 states have call predecessors, (123), 91 states have call successors, (123) [2022-01-31 21:57:08,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1002 transitions. [2022-01-31 21:57:08,150 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1002 transitions. Word has length 60 [2022-01-31 21:57:08,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:08,150 INFO L470 AbstractCegarLoop]: Abstraction has 767 states and 1002 transitions. [2022-01-31 21:57:08,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 8 states have internal predecessors, (46), 3 states have call successors, (8), 8 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-01-31 21:57:08,150 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1002 transitions. [2022-01-31 21:57:08,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-01-31 21:57:08,152 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:08,152 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:57:08,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-01-31 21:57:08,153 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:08,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:08,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1831191438, now seen corresponding path program 1 times [2022-01-31 21:57:08,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:08,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [178337876] [2022-01-31 21:57:08,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:08,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:08,155 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:57:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:57:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:08,331 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:57:08,331 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:08,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [178337876] [2022-01-31 21:57:08,331 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [178337876] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:08,331 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:08,331 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:57:08,331 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688468769] [2022-01-31 21:57:08,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:08,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:57:08,332 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:08,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:57:08,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:57:08,332 INFO L87 Difference]: Start difference. First operand 767 states and 1002 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:57:09,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:09,845 INFO L93 Difference]: Finished difference Result 813 states and 1068 transitions. [2022-01-31 21:57:09,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:57:09,845 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 61 [2022-01-31 21:57:09,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:09,847 INFO L225 Difference]: With dead ends: 813 [2022-01-31 21:57:09,847 INFO L226 Difference]: Without dead ends: 779 [2022-01-31 21:57:09,848 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:57:09,848 INFO L933 BasicCegarLoop]: 518 mSDtfsCounter, 636 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1888 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 2140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:09,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [638 Valid, 1123 Invalid, 2140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1888 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 21:57:09,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-01-31 21:57:10,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 771. [2022-01-31 21:57:10,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 603 states have (on average 1.3018242122719734) internal successors, (785), 617 states have internal predecessors, (785), 96 states have call successors, (96), 51 states have call predecessors, (96), 71 states have return successors, (139), 109 states have call predecessors, (139), 91 states have call successors, (139) [2022-01-31 21:57:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1020 transitions. [2022-01-31 21:57:10,021 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1020 transitions. Word has length 61 [2022-01-31 21:57:10,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:10,022 INFO L470 AbstractCegarLoop]: Abstraction has 771 states and 1020 transitions. [2022-01-31 21:57:10,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:57:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1020 transitions. [2022-01-31 21:57:10,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 21:57:10,023 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:10,023 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:57:10,023 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-01-31 21:57:10,023 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:10,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:10,024 INFO L85 PathProgramCache]: Analyzing trace with hash -136478580, now seen corresponding path program 1 times [2022-01-31 21:57:10,024 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:10,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [546789067] [2022-01-31 21:57:10,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:10,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:10,026 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:10,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:10,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:10,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:10,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:10,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:57:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:10,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:10,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:10,336 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:57:10,336 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:10,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [546789067] [2022-01-31 21:57:10,337 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [546789067] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:10,337 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:10,337 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:57:10,337 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255112052] [2022-01-31 21:57:10,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:10,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:57:10,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:10,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:57:10,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:57:10,338 INFO L87 Difference]: Start difference. First operand 771 states and 1020 transitions. Second operand has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 21:57:12,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:12,854 INFO L93 Difference]: Finished difference Result 788 states and 1038 transitions. [2022-01-31 21:57:12,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:57:12,854 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2022-01-31 21:57:12,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:12,856 INFO L225 Difference]: With dead ends: 788 [2022-01-31 21:57:12,856 INFO L226 Difference]: Without dead ends: 766 [2022-01-31 21:57:12,857 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:57:12,857 INFO L933 BasicCegarLoop]: 531 mSDtfsCounter, 883 mSDsluCounter, 1874 mSDsCounter, 0 mSdLazyCounter, 5376 mSolverCounterSat, 310 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 2405 SdHoareTripleChecker+Invalid, 5686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 310 IncrementalHoareTripleChecker+Valid, 5376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:12,857 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [885 Valid, 2405 Invalid, 5686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [310 Valid, 5376 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-01-31 21:57:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-01-31 21:57:13,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 766. [2022-01-31 21:57:13,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 600 states have (on average 1.3016666666666667) internal successors, (781), 614 states have internal predecessors, (781), 95 states have call successors, (95), 51 states have call predecessors, (95), 70 states have return successors, (137), 107 states have call predecessors, (137), 90 states have call successors, (137) [2022-01-31 21:57:13,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 1013 transitions. [2022-01-31 21:57:13,034 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 1013 transitions. Word has length 63 [2022-01-31 21:57:13,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:13,034 INFO L470 AbstractCegarLoop]: Abstraction has 766 states and 1013 transitions. [2022-01-31 21:57:13,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.473684210526316) internal successors, (47), 9 states have internal predecessors, (47), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 21:57:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 1013 transitions. [2022-01-31 21:57:13,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-01-31 21:57:13,036 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:13,036 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] [2022-01-31 21:57:13,036 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-01-31 21:57:13,036 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:13,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:13,037 INFO L85 PathProgramCache]: Analyzing trace with hash 930890902, now seen corresponding path program 1 times [2022-01-31 21:57:13,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:13,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [520523086] [2022-01-31 21:57:13,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:13,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:13,039 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:13,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:13,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:13,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:13,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:13,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:13,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:13,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:57:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:13,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:13,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:13,294 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:57:13,294 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:13,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [520523086] [2022-01-31 21:57:13,294 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [520523086] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:13,294 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:13,295 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:57:13,295 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184979293] [2022-01-31 21:57:13,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:13,295 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:57:13,295 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:13,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:57:13,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:57:13,296 INFO L87 Difference]: Start difference. First operand 766 states and 1013 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 21:57:15,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:15,525 INFO L93 Difference]: Finished difference Result 783 states and 1031 transitions. [2022-01-31 21:57:15,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:57:15,526 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) Word has length 62 [2022-01-31 21:57:15,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:15,528 INFO L225 Difference]: With dead ends: 783 [2022-01-31 21:57:15,528 INFO L226 Difference]: Without dead ends: 761 [2022-01-31 21:57:15,528 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:57:15,529 INFO L933 BasicCegarLoop]: 521 mSDtfsCounter, 591 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 5196 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 2230 SdHoareTripleChecker+Invalid, 5407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 5196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:15,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [593 Valid, 2230 Invalid, 5407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 5196 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-31 21:57:15,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-01-31 21:57:15,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2022-01-31 21:57:15,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 761 states, 597 states have (on average 1.3015075376884422) internal successors, (777), 611 states have internal predecessors, (777), 94 states have call successors, (94), 51 states have call predecessors, (94), 69 states have return successors, (135), 105 states have call predecessors, (135), 89 states have call successors, (135) [2022-01-31 21:57:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1006 transitions. [2022-01-31 21:57:15,700 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1006 transitions. Word has length 62 [2022-01-31 21:57:15,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:15,700 INFO L470 AbstractCegarLoop]: Abstraction has 761 states and 1006 transitions. [2022-01-31 21:57:15,700 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 21:57:15,700 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1006 transitions. [2022-01-31 21:57:15,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 21:57:15,701 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:15,702 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:57:15,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-01-31 21:57:15,702 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:15,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:15,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1197060442, now seen corresponding path program 1 times [2022-01-31 21:57:15,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:15,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [919617939] [2022-01-31 21:57:15,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:15,702 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:15,704 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:15,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:15,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:15,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:15,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:15,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:15,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:57:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:15,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:16,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:57:16,067 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:16,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [919617939] [2022-01-31 21:57:16,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [919617939] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:16,068 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:16,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 21:57:16,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726996378] [2022-01-31 21:57:16,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:16,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 21:57:16,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:16,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 21:57:16,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:57:16,069 INFO L87 Difference]: Start difference. First operand 761 states and 1006 transitions. Second operand has 21 states, 20 states have (on average 2.45) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 21:57:18,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:18,539 INFO L93 Difference]: Finished difference Result 785 states and 1031 transitions. [2022-01-31 21:57:18,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:57:18,539 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 67 [2022-01-31 21:57:18,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:18,541 INFO L225 Difference]: With dead ends: 785 [2022-01-31 21:57:18,541 INFO L226 Difference]: Without dead ends: 761 [2022-01-31 21:57:18,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:57:18,542 INFO L933 BasicCegarLoop]: 516 mSDtfsCounter, 1780 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 4872 mSolverCounterSat, 624 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1782 SdHoareTripleChecker+Valid, 2244 SdHoareTripleChecker+Invalid, 5496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 624 IncrementalHoareTripleChecker+Valid, 4872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:18,542 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1782 Valid, 2244 Invalid, 5496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [624 Valid, 4872 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-31 21:57:18,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-01-31 21:57:18,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 759. [2022-01-31 21:57:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 596 states have (on average 1.3003355704697988) internal successors, (775), 610 states have internal predecessors, (775), 93 states have call successors, (93), 51 states have call predecessors, (93), 69 states have return successors, (134), 104 states have call predecessors, (134), 88 states have call successors, (134) [2022-01-31 21:57:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1002 transitions. [2022-01-31 21:57:18,731 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1002 transitions. Word has length 67 [2022-01-31 21:57:18,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:18,731 INFO L470 AbstractCegarLoop]: Abstraction has 759 states and 1002 transitions. [2022-01-31 21:57:18,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.45) internal successors, (49), 10 states have internal predecessors, (49), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 21:57:18,731 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1002 transitions. [2022-01-31 21:57:18,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 21:57:18,733 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:18,733 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:57:18,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-01-31 21:57:18,733 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:18,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:18,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1449409574, now seen corresponding path program 1 times [2022-01-31 21:57:18,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:18,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [974634175] [2022-01-31 21:57:18,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:18,734 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:18,735 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:18,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:18,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:18,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:18,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:18,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:18,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:57:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:19,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:19,029 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:57:19,030 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:19,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [974634175] [2022-01-31 21:57:19,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [974634175] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:19,030 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:19,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:57:19,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189744431] [2022-01-31 21:57:19,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:19,030 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:57:19,030 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:19,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:57:19,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:57:19,031 INFO L87 Difference]: Start difference. First operand 759 states and 1002 transitions. Second operand has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 21:57:21,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:21,484 INFO L93 Difference]: Finished difference Result 781 states and 1025 transitions. [2022-01-31 21:57:21,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 21:57:21,485 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 63 [2022-01-31 21:57:21,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:21,487 INFO L225 Difference]: With dead ends: 781 [2022-01-31 21:57:21,487 INFO L226 Difference]: Without dead ends: 757 [2022-01-31 21:57:21,487 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=603, Unknown=0, NotChecked=0, Total=702 [2022-01-31 21:57:21,487 INFO L933 BasicCegarLoop]: 493 mSDtfsCounter, 1456 mSDsluCounter, 1648 mSDsCounter, 0 mSdLazyCounter, 5075 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 2141 SdHoareTripleChecker+Invalid, 5584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 5075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:21,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1459 Valid, 2141 Invalid, 5584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 5075 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-01-31 21:57:21,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2022-01-31 21:57:21,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2022-01-31 21:57:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 595 states have (on average 1.2991596638655463) internal successors, (773), 609 states have internal predecessors, (773), 92 states have call successors, (92), 51 states have call predecessors, (92), 69 states have return successors, (133), 103 states have call predecessors, (133), 87 states have call successors, (133) [2022-01-31 21:57:21,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 998 transitions. [2022-01-31 21:57:21,674 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 998 transitions. Word has length 63 [2022-01-31 21:57:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:21,674 INFO L470 AbstractCegarLoop]: Abstraction has 757 states and 998 transitions. [2022-01-31 21:57:21,674 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.473684210526316) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 21:57:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 998 transitions. [2022-01-31 21:57:21,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-01-31 21:57:21,676 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:21,676 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:57:21,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-01-31 21:57:21,676 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:21,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:21,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1540652363, now seen corresponding path program 1 times [2022-01-31 21:57:21,677 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:21,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1962367025] [2022-01-31 21:57:21,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:21,677 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:21,679 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:21,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:21,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:21,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:21,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:21,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:21,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:21,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:57:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:21,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:21,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:21,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:21,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:57:21,824 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:21,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1962367025] [2022-01-31 21:57:21,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1962367025] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:21,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:21,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:57:21,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685594473] [2022-01-31 21:57:21,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:21,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:57:21,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:21,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:57:21,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:57:21,825 INFO L87 Difference]: Start difference. First operand 757 states and 998 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 3 states have internal predecessors, (47), 2 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:57:22,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:22,845 INFO L93 Difference]: Finished difference Result 1021 states and 1347 transitions. [2022-01-31 21:57:22,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:57:22,846 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 3 states have internal predecessors, (47), 2 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 63 [2022-01-31 21:57:22,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:22,848 INFO L225 Difference]: With dead ends: 1021 [2022-01-31 21:57:22,848 INFO L226 Difference]: Without dead ends: 702 [2022-01-31 21:57:22,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-01-31 21:57:22,849 INFO L933 BasicCegarLoop]: 487 mSDtfsCounter, 1149 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:22,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1151 Valid, 863 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:57:22,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-01-31 21:57:23,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 685. [2022-01-31 21:57:23,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 540 states have (on average 1.2925925925925925) internal successors, (698), 552 states have internal predecessors, (698), 82 states have call successors, (82), 47 states have call predecessors, (82), 62 states have return successors, (102), 92 states have call predecessors, (102), 77 states have call successors, (102) [2022-01-31 21:57:23,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 882 transitions. [2022-01-31 21:57:23,010 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 882 transitions. Word has length 63 [2022-01-31 21:57:23,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:23,010 INFO L470 AbstractCegarLoop]: Abstraction has 685 states and 882 transitions. [2022-01-31 21:57:23,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 3 states have internal predecessors, (47), 2 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:57:23,010 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 882 transitions. [2022-01-31 21:57:23,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 21:57:23,011 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:23,011 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] [2022-01-31 21:57:23,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-01-31 21:57:23,011 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:23,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:23,012 INFO L85 PathProgramCache]: Analyzing trace with hash 837617487, now seen corresponding path program 1 times [2022-01-31 21:57:23,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:23,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1544395307] [2022-01-31 21:57:23,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:23,012 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:23,013 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:23,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:23,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:23,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:23,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 21:57:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:23,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:23,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:57:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:23,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:57:23,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:23,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:57:23,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:23,159 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:57:23,159 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:23,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1544395307] [2022-01-31 21:57:23,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1544395307] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:23,160 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:23,160 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-31 21:57:23,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694210816] [2022-01-31 21:57:23,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:23,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-31 21:57:23,160 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:23,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-31 21:57:23,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-01-31 21:57:23,161 INFO L87 Difference]: Start difference. First operand 685 states and 882 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 8 states have call predecessors, (12), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-31 21:57:24,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:24,291 INFO L93 Difference]: Finished difference Result 805 states and 1038 transitions. [2022-01-31 21:57:24,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 21:57:24,291 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 8 states have call predecessors, (12), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 66 [2022-01-31 21:57:24,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:24,293 INFO L225 Difference]: With dead ends: 805 [2022-01-31 21:57:24,293 INFO L226 Difference]: Without dead ends: 685 [2022-01-31 21:57:24,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:57:24,294 INFO L933 BasicCegarLoop]: 463 mSDtfsCounter, 338 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 1259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:24,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 849 Invalid, 1259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:57:24,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2022-01-31 21:57:24,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2022-01-31 21:57:24,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 685 states, 540 states have (on average 1.288888888888889) internal successors, (696), 552 states have internal predecessors, (696), 82 states have call successors, (82), 47 states have call predecessors, (82), 62 states have return successors, (102), 92 states have call predecessors, (102), 77 states have call successors, (102) [2022-01-31 21:57:24,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 880 transitions. [2022-01-31 21:57:24,455 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 880 transitions. Word has length 66 [2022-01-31 21:57:24,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:24,455 INFO L470 AbstractCegarLoop]: Abstraction has 685 states and 880 transitions. [2022-01-31 21:57:24,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (12), 8 states have call predecessors, (12), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-31 21:57:24,455 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 880 transitions. [2022-01-31 21:57:24,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 21:57:24,457 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:24,457 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] [2022-01-31 21:57:24,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-01-31 21:57:24,457 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:24,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:24,458 INFO L85 PathProgramCache]: Analyzing trace with hash 459187299, now seen corresponding path program 1 times [2022-01-31 21:57:24,458 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:24,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1986967033] [2022-01-31 21:57:24,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:24,458 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:24,460 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:24,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:24,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:24,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:24,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:24,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:24,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:24,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:24,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:24,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:57:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:24,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:24,773 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:57:24,773 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:24,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1986967033] [2022-01-31 21:57:24,773 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1986967033] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:24,773 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:24,774 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 21:57:24,774 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641379421] [2022-01-31 21:57:24,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:24,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 21:57:24,774 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:24,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 21:57:24,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:57:24,775 INFO L87 Difference]: Start difference. First operand 685 states and 880 transitions. Second operand has 21 states, 20 states have (on average 2.4) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 21:57:27,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:27,125 INFO L93 Difference]: Finished difference Result 707 states and 903 transitions. [2022-01-31 21:57:27,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 21:57:27,126 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 66 [2022-01-31 21:57:27,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:27,127 INFO L225 Difference]: With dead ends: 707 [2022-01-31 21:57:27,127 INFO L226 Difference]: Without dead ends: 683 [2022-01-31 21:57:27,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:57:27,128 INFO L933 BasicCegarLoop]: 470 mSDtfsCounter, 1194 mSDsluCounter, 1576 mSDsCounter, 0 mSdLazyCounter, 4837 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 2046 SdHoareTripleChecker+Invalid, 5233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 4837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:27,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1196 Valid, 2046 Invalid, 5233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 4837 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-31 21:57:27,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-01-31 21:57:27,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 683. [2022-01-31 21:57:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 683 states, 539 states have (on average 1.287569573283859) internal successors, (694), 551 states have internal predecessors, (694), 81 states have call successors, (81), 47 states have call predecessors, (81), 62 states have return successors, (101), 91 states have call predecessors, (101), 76 states have call successors, (101) [2022-01-31 21:57:27,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 876 transitions. [2022-01-31 21:57:27,286 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 876 transitions. Word has length 66 [2022-01-31 21:57:27,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:27,286 INFO L470 AbstractCegarLoop]: Abstraction has 683 states and 876 transitions. [2022-01-31 21:57:27,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.4) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 21:57:27,286 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 876 transitions. [2022-01-31 21:57:27,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-01-31 21:57:27,287 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:27,287 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:57:27,287 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-01-31 21:57:27,287 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:27,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:27,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1196782002, now seen corresponding path program 1 times [2022-01-31 21:57:27,288 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:27,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1135318987] [2022-01-31 21:57:27,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:27,288 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:27,290 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:27,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:27,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:27,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:27,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:27,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:27,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:27,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:27,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:57:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:27,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 21:57:27,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:27,469 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:57:27,469 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:27,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1135318987] [2022-01-31 21:57:27,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1135318987] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:27,470 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:27,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:57:27,470 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83796279] [2022-01-31 21:57:27,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:27,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:57:27,470 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:27,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:57:27,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:57:27,471 INFO L87 Difference]: Start difference. First operand 683 states and 876 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 21:57:28,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:28,765 INFO L93 Difference]: Finished difference Result 747 states and 952 transitions. [2022-01-31 21:57:28,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-31 21:57:28,765 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-01-31 21:57:28,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:28,767 INFO L225 Difference]: With dead ends: 747 [2022-01-31 21:57:28,767 INFO L226 Difference]: Without dead ends: 714 [2022-01-31 21:57:28,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:57:28,767 INFO L933 BasicCegarLoop]: 467 mSDtfsCounter, 772 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:28,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [774 Valid, 863 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:57:28,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-01-31 21:57:28,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 689. [2022-01-31 21:57:28,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 544 states have (on average 1.286764705882353) internal successors, (700), 556 states have internal predecessors, (700), 82 states have call successors, (82), 47 states have call predecessors, (82), 62 states have return successors, (102), 92 states have call predecessors, (102), 77 states have call successors, (102) [2022-01-31 21:57:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 884 transitions. [2022-01-31 21:57:28,922 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 884 transitions. Word has length 65 [2022-01-31 21:57:28,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:28,923 INFO L470 AbstractCegarLoop]: Abstraction has 689 states and 884 transitions. [2022-01-31 21:57:28,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 5 states have internal predecessors, (49), 3 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-01-31 21:57:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 884 transitions. [2022-01-31 21:57:28,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 21:57:28,924 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:28,924 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] [2022-01-31 21:57:28,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-01-31 21:57:28,924 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:28,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:28,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1406064246, now seen corresponding path program 1 times [2022-01-31 21:57:28,924 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:28,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [515671433] [2022-01-31 21:57:28,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:28,925 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:28,926 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:28,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:28,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:29,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:29,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:29,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:29,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:29,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:29,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:29,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:57:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:29,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:57:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:29,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:57:29,106 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:29,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [515671433] [2022-01-31 21:57:29,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [515671433] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:29,106 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:29,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:57:29,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458842230] [2022-01-31 21:57:29,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:29,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:57:29,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:29,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:57:29,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:57:29,108 INFO L87 Difference]: Start difference. First operand 689 states and 884 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:57:30,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:30,313 INFO L93 Difference]: Finished difference Result 745 states and 945 transitions. [2022-01-31 21:57:30,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:57:30,314 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-01-31 21:57:30,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:30,315 INFO L225 Difference]: With dead ends: 745 [2022-01-31 21:57:30,315 INFO L226 Difference]: Without dead ends: 691 [2022-01-31 21:57:30,315 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:57:30,316 INFO L933 BasicCegarLoop]: 474 mSDtfsCounter, 615 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 617 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:30,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [617 Valid, 997 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:57:30,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-01-31 21:57:30,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2022-01-31 21:57:30,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 544 states have (on average 1.2830882352941178) internal successors, (698), 556 states have internal predecessors, (698), 82 states have call successors, (82), 47 states have call predecessors, (82), 62 states have return successors, (102), 92 states have call predecessors, (102), 77 states have call successors, (102) [2022-01-31 21:57:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 882 transitions. [2022-01-31 21:57:30,471 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 882 transitions. Word has length 66 [2022-01-31 21:57:30,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:30,471 INFO L470 AbstractCegarLoop]: Abstraction has 689 states and 882 transitions. [2022-01-31 21:57:30,471 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:57:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 882 transitions. [2022-01-31 21:57:30,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-01-31 21:57:30,473 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:30,473 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:30,473 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-01-31 21:57:30,474 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:30,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:30,474 INFO L85 PathProgramCache]: Analyzing trace with hash -704464372, now seen corresponding path program 1 times [2022-01-31 21:57:30,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:30,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [715933517] [2022-01-31 21:57:30,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:30,475 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:30,476 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:30,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:30,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:30,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:30,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:30,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:30,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:57:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:30,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:57:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:30,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:57:30,723 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:30,723 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [715933517] [2022-01-31 21:57:30,723 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [715933517] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:30,723 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:30,723 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-31 21:57:30,723 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206553525] [2022-01-31 21:57:30,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:30,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-31 21:57:30,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:30,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-31 21:57:30,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:57:30,724 INFO L87 Difference]: Start difference. First operand 689 states and 882 transitions. Second operand has 16 states, 16 states have (on average 3.125) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:57:32,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:32,744 INFO L93 Difference]: Finished difference Result 716 states and 912 transitions. [2022-01-31 21:57:32,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:57:32,744 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-01-31 21:57:32,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:32,747 INFO L225 Difference]: With dead ends: 716 [2022-01-31 21:57:32,747 INFO L226 Difference]: Without dead ends: 658 [2022-01-31 21:57:32,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:57:32,748 INFO L933 BasicCegarLoop]: 477 mSDtfsCounter, 361 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 3604 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 3733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 3604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:32,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 1642 Invalid, 3733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 3604 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-31 21:57:32,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2022-01-31 21:57:32,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 652. [2022-01-31 21:57:32,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 514 states have (on average 1.2684824902723735) internal successors, (652), 526 states have internal predecessors, (652), 75 states have call successors, (75), 47 states have call predecessors, (75), 62 states have return successors, (94), 85 states have call predecessors, (94), 70 states have call successors, (94) [2022-01-31 21:57:32,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 821 transitions. [2022-01-31 21:57:32,888 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 821 transitions. Word has length 66 [2022-01-31 21:57:32,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:32,897 INFO L470 AbstractCegarLoop]: Abstraction has 652 states and 821 transitions. [2022-01-31 21:57:32,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.125) internal successors, (50), 7 states have internal predecessors, (50), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:57:32,897 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 821 transitions. [2022-01-31 21:57:32,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 21:57:32,898 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:32,898 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:57:32,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-01-31 21:57:32,899 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:32,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:32,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1352254083, now seen corresponding path program 1 times [2022-01-31 21:57:32,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:32,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [386099911] [2022-01-31 21:57:32,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:32,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:32,901 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:32,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:32,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:32,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:33,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:33,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:33,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-31 21:57:33,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:33,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:33,076 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:57:33,076 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:33,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [386099911] [2022-01-31 21:57:33,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [386099911] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:33,076 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:33,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:57:33,076 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393120850] [2022-01-31 21:57:33,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:33,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:57:33,077 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:33,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:57:33,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:57:33,077 INFO L87 Difference]: Start difference. First operand 652 states and 821 transitions. Second operand has 12 states, 12 states have (on average 4.25) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:57:34,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:34,209 INFO L93 Difference]: Finished difference Result 686 states and 856 transitions. [2022-01-31 21:57:34,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:57:34,210 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2022-01-31 21:57:34,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:34,211 INFO L225 Difference]: With dead ends: 686 [2022-01-31 21:57:34,211 INFO L226 Difference]: Without dead ends: 647 [2022-01-31 21:57:34,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:57:34,212 INFO L933 BasicCegarLoop]: 424 mSDtfsCounter, 510 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:34,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [512 Valid, 1027 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:57:34,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-01-31 21:57:34,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 647. [2022-01-31 21:57:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 510 states have (on average 1.268627450980392) internal successors, (647), 522 states have internal predecessors, (647), 74 states have call successors, (74), 47 states have call predecessors, (74), 62 states have return successors, (93), 84 states have call predecessors, (93), 69 states have call successors, (93) [2022-01-31 21:57:34,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 814 transitions. [2022-01-31 21:57:34,346 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 814 transitions. Word has length 67 [2022-01-31 21:57:34,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:34,346 INFO L470 AbstractCegarLoop]: Abstraction has 647 states and 814 transitions. [2022-01-31 21:57:34,346 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.25) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:57:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 814 transitions. [2022-01-31 21:57:34,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-01-31 21:57:34,347 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:34,347 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:57:34,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-01-31 21:57:34,348 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:34,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:34,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1349512903, now seen corresponding path program 1 times [2022-01-31 21:57:34,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:34,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1884235898] [2022-01-31 21:57:34,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:34,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:34,350 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:34,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:34,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:34,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:34,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:34,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:34,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:34,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:57:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:34,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:57:34,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:34,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:34,528 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:57:34,528 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:34,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1884235898] [2022-01-31 21:57:34,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1884235898] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:34,529 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:34,529 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 21:57:34,529 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018764745] [2022-01-31 21:57:34,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:34,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 21:57:34,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:34,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 21:57:34,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-01-31 21:57:34,530 INFO L87 Difference]: Start difference. First operand 647 states and 814 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 21:57:35,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:35,709 INFO L93 Difference]: Finished difference Result 771 states and 965 transitions. [2022-01-31 21:57:35,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:57:35,709 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 67 [2022-01-31 21:57:35,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:35,711 INFO L225 Difference]: With dead ends: 771 [2022-01-31 21:57:35,711 INFO L226 Difference]: Without dead ends: 763 [2022-01-31 21:57:35,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:57:35,712 INFO L933 BasicCegarLoop]: 453 mSDtfsCounter, 907 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:35,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [917 Valid, 925 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:57:35,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2022-01-31 21:57:35,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 689. [2022-01-31 21:57:35,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 542 states have (on average 1.2619926199261993) internal successors, (684), 556 states have internal predecessors, (684), 76 states have call successors, (76), 49 states have call predecessors, (76), 70 states have return successors, (101), 92 states have call predecessors, (101), 71 states have call successors, (101) [2022-01-31 21:57:35,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 861 transitions. [2022-01-31 21:57:35,926 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 861 transitions. Word has length 67 [2022-01-31 21:57:35,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:35,926 INFO L470 AbstractCegarLoop]: Abstraction has 689 states and 861 transitions. [2022-01-31 21:57:35,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (9), 9 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 21:57:35,926 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 861 transitions. [2022-01-31 21:57:35,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-01-31 21:57:35,928 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:35,928 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:57:35,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-01-31 21:57:35,928 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:35,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:35,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1558643705, now seen corresponding path program 1 times [2022-01-31 21:57:35,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:35,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [618902469] [2022-01-31 21:57:35,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:35,929 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:35,930 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:35,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:36,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:36,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:36,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:36,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:57:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:36,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:57:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:36,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:36,116 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:57:36,116 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:36,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [618902469] [2022-01-31 21:57:36,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [618902469] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:36,116 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:36,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:57:36,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540186623] [2022-01-31 21:57:36,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:36,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:57:36,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:36,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:57:36,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:57:36,117 INFO L87 Difference]: Start difference. First operand 689 states and 861 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:57:37,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:37,502 INFO L93 Difference]: Finished difference Result 767 states and 959 transitions. [2022-01-31 21:57:37,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:57:37,502 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2022-01-31 21:57:37,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:37,503 INFO L225 Difference]: With dead ends: 767 [2022-01-31 21:57:37,504 INFO L226 Difference]: Without dead ends: 761 [2022-01-31 21:57:37,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:57:37,504 INFO L933 BasicCegarLoop]: 455 mSDtfsCounter, 1189 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:37,504 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1196 Valid, 821 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:57:37,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2022-01-31 21:57:37,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 689. [2022-01-31 21:57:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 542 states have (on average 1.2601476014760147) internal successors, (683), 556 states have internal predecessors, (683), 76 states have call successors, (76), 49 states have call predecessors, (76), 70 states have return successors, (101), 92 states have call predecessors, (101), 71 states have call successors, (101) [2022-01-31 21:57:37,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 860 transitions. [2022-01-31 21:57:37,664 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 860 transitions. Word has length 68 [2022-01-31 21:57:37,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:37,664 INFO L470 AbstractCegarLoop]: Abstraction has 689 states and 860 transitions. [2022-01-31 21:57:37,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:57:37,664 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 860 transitions. [2022-01-31 21:57:37,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-01-31 21:57:37,666 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:37,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:57:37,666 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-01-31 21:57:37,666 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:37,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:37,667 INFO L85 PathProgramCache]: Analyzing trace with hash -394111726, now seen corresponding path program 1 times [2022-01-31 21:57:37,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:37,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [855373041] [2022-01-31 21:57:37,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:37,667 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:37,669 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:37,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:37,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:37,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:37,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:37,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:37,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:37,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:37,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:57:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:37,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 21:57:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:37,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:37,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:57:37,969 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:37,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [855373041] [2022-01-31 21:57:37,970 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [855373041] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:37,970 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:37,970 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 21:57:37,970 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495033636] [2022-01-31 21:57:37,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:37,970 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 21:57:37,970 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:37,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 21:57:37,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:57:37,971 INFO L87 Difference]: Start difference. First operand 689 states and 860 transitions. Second operand has 21 states, 20 states have (on average 2.7) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-31 21:57:40,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:40,318 INFO L93 Difference]: Finished difference Result 722 states and 899 transitions. [2022-01-31 21:57:40,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:57:40,319 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 74 [2022-01-31 21:57:40,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:40,320 INFO L225 Difference]: With dead ends: 722 [2022-01-31 21:57:40,320 INFO L226 Difference]: Without dead ends: 698 [2022-01-31 21:57:40,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:57:40,321 INFO L933 BasicCegarLoop]: 434 mSDtfsCounter, 311 mSDsluCounter, 1778 mSDsCounter, 0 mSdLazyCounter, 4450 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 4559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 4450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:40,321 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [313 Valid, 2212 Invalid, 4559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 4450 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-01-31 21:57:40,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2022-01-31 21:57:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 687. [2022-01-31 21:57:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 541 states have (on average 1.2587800369685767) internal successors, (681), 555 states have internal predecessors, (681), 75 states have call successors, (75), 49 states have call predecessors, (75), 70 states have return successors, (100), 91 states have call predecessors, (100), 70 states have call successors, (100) [2022-01-31 21:57:40,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 856 transitions. [2022-01-31 21:57:40,482 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 856 transitions. Word has length 74 [2022-01-31 21:57:40,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:40,482 INFO L470 AbstractCegarLoop]: Abstraction has 687 states and 856 transitions. [2022-01-31 21:57:40,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.7) internal successors, (54), 10 states have internal predecessors, (54), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-31 21:57:40,482 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 856 transitions. [2022-01-31 21:57:40,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-01-31 21:57:40,483 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:40,483 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:57:40,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-01-31 21:57:40,484 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:40,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:40,484 INFO L85 PathProgramCache]: Analyzing trace with hash 160645946, now seen corresponding path program 1 times [2022-01-31 21:57:40,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:40,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [591479060] [2022-01-31 21:57:40,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:40,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:40,486 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:40,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:40,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:40,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:40,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:40,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:40,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:40,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:40,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:57:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:40,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:57:40,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:40,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:40,811 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:57:40,811 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:40,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [591479060] [2022-01-31 21:57:40,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [591479060] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:40,811 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:40,811 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-01-31 21:57:40,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458008070] [2022-01-31 21:57:40,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:40,812 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-31 21:57:40,812 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:40,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-31 21:57:40,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:57:40,812 INFO L87 Difference]: Start difference. First operand 687 states and 856 transitions. Second operand has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (10), 10 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 21:57:43,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:43,064 INFO L93 Difference]: Finished difference Result 711 states and 882 transitions. [2022-01-31 21:57:43,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-31 21:57:43,064 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (10), 10 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) Word has length 70 [2022-01-31 21:57:43,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:43,066 INFO L225 Difference]: With dead ends: 711 [2022-01-31 21:57:43,066 INFO L226 Difference]: Without dead ends: 684 [2022-01-31 21:57:43,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2022-01-31 21:57:43,067 INFO L933 BasicCegarLoop]: 426 mSDtfsCounter, 789 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 4575 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 2269 SdHoareTripleChecker+Invalid, 4844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 4575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:43,067 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [791 Valid, 2269 Invalid, 4844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 4575 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-01-31 21:57:43,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-01-31 21:57:43,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2022-01-31 21:57:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 539 states have (on average 1.2578849721706864) internal successors, (678), 553 states have internal predecessors, (678), 74 states have call successors, (74), 49 states have call predecessors, (74), 70 states have return successors, (99), 90 states have call predecessors, (99), 69 states have call successors, (99) [2022-01-31 21:57:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 851 transitions. [2022-01-31 21:57:43,220 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 851 transitions. Word has length 70 [2022-01-31 21:57:43,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:43,220 INFO L470 AbstractCegarLoop]: Abstraction has 684 states and 851 transitions. [2022-01-31 21:57:43,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 11 states have internal predecessors, (52), 4 states have call successors, (10), 10 states have call predecessors, (10), 5 states have return successors, (8), 6 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 21:57:43,220 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 851 transitions. [2022-01-31 21:57:43,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-31 21:57:43,221 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:43,221 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] [2022-01-31 21:57:43,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-01-31 21:57:43,221 INFO L402 AbstractCegarLoop]: === Iteration 50 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:43,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:43,222 INFO L85 PathProgramCache]: Analyzing trace with hash -20472114, now seen corresponding path program 1 times [2022-01-31 21:57:43,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:43,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [118100726] [2022-01-31 21:57:43,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:43,222 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:43,224 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:43,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:43,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:43,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:43,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:43,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:43,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:43,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:43,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:57:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:43,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:43,575 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:57:43,575 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:43,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [118100726] [2022-01-31 21:57:43,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [118100726] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:43,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:43,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:57:43,576 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108469962] [2022-01-31 21:57:43,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:43,576 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:57:43,576 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:43,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:57:43,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:57:43,577 INFO L87 Difference]: Start difference. First operand 684 states and 851 transitions. Second operand has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 21:57:45,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:45,460 INFO L93 Difference]: Finished difference Result 704 states and 872 transitions. [2022-01-31 21:57:45,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:57:45,461 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) Word has length 72 [2022-01-31 21:57:45,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:45,462 INFO L225 Difference]: With dead ends: 704 [2022-01-31 21:57:45,462 INFO L226 Difference]: Without dead ends: 682 [2022-01-31 21:57:45,463 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:57:45,463 INFO L933 BasicCegarLoop]: 421 mSDtfsCounter, 465 mSDsluCounter, 1610 mSDsCounter, 0 mSdLazyCounter, 4066 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 2031 SdHoareTripleChecker+Invalid, 4228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 4066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:45,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [467 Valid, 2031 Invalid, 4228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 4066 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-31 21:57:45,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2022-01-31 21:57:45,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2022-01-31 21:57:45,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 538 states have (on average 1.2565055762081785) internal successors, (676), 552 states have internal predecessors, (676), 73 states have call successors, (73), 49 states have call predecessors, (73), 70 states have return successors, (98), 89 states have call predecessors, (98), 68 states have call successors, (98) [2022-01-31 21:57:45,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 847 transitions. [2022-01-31 21:57:45,627 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 847 transitions. Word has length 72 [2022-01-31 21:57:45,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:45,627 INFO L470 AbstractCegarLoop]: Abstraction has 682 states and 847 transitions. [2022-01-31 21:57:45,627 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 9 states have internal predecessors, (56), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 21:57:45,627 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 847 transitions. [2022-01-31 21:57:45,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-31 21:57:45,628 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:45,628 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] [2022-01-31 21:57:45,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-01-31 21:57:45,629 INFO L402 AbstractCegarLoop]: === Iteration 51 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:45,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:45,629 INFO L85 PathProgramCache]: Analyzing trace with hash 968945146, now seen corresponding path program 1 times [2022-01-31 21:57:45,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:45,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1002330847] [2022-01-31 21:57:45,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:45,629 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:45,631 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:45,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:45,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:45,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:45,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:45,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:45,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:45,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:57:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:45,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:45,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:57:45,947 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:45,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1002330847] [2022-01-31 21:57:45,947 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1002330847] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:45,947 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:45,947 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:57:45,947 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162629582] [2022-01-31 21:57:45,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:45,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:57:45,947 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:45,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:57:45,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:57:45,948 INFO L87 Difference]: Start difference. First operand 682 states and 847 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 21:57:47,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:47,916 INFO L93 Difference]: Finished difference Result 699 states and 865 transitions. [2022-01-31 21:57:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:57:47,916 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) Word has length 69 [2022-01-31 21:57:47,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:47,918 INFO L225 Difference]: With dead ends: 699 [2022-01-31 21:57:47,918 INFO L226 Difference]: Without dead ends: 670 [2022-01-31 21:57:47,919 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:57:47,919 INFO L933 BasicCegarLoop]: 414 mSDtfsCounter, 689 mSDsluCounter, 1589 mSDsCounter, 0 mSdLazyCounter, 4182 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 2003 SdHoareTripleChecker+Invalid, 4417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 4182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:47,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [691 Valid, 2003 Invalid, 4417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 4182 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-01-31 21:57:47,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-01-31 21:57:48,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2022-01-31 21:57:48,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 529 states have (on average 1.2570888468809074) internal successors, (665), 543 states have internal predecessors, (665), 71 states have call successors, (71), 49 states have call predecessors, (71), 69 states have return successors, (95), 86 states have call predecessors, (95), 66 states have call successors, (95) [2022-01-31 21:57:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 831 transitions. [2022-01-31 21:57:48,152 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 831 transitions. Word has length 69 [2022-01-31 21:57:48,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:48,152 INFO L470 AbstractCegarLoop]: Abstraction has 670 states and 831 transitions. [2022-01-31 21:57:48,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (9), 8 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 21:57:48,152 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 831 transitions. [2022-01-31 21:57:48,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-31 21:57:48,154 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:48,154 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] [2022-01-31 21:57:48,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-01-31 21:57:48,154 INFO L402 AbstractCegarLoop]: === Iteration 52 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:48,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:48,155 INFO L85 PathProgramCache]: Analyzing trace with hash 215886750, now seen corresponding path program 1 times [2022-01-31 21:57:48,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:48,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1826699289] [2022-01-31 21:57:48,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:48,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:48,158 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:48,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:48,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:48,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:48,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:48,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:48,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:48,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:57:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:48,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:57:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:48,325 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:57:48,325 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:48,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1826699289] [2022-01-31 21:57:48,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1826699289] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:48,326 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:48,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:57:48,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621115640] [2022-01-31 21:57:48,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:48,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:57:48,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:48,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:57:48,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:57:48,327 INFO L87 Difference]: Start difference. First operand 670 states and 831 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:57:49,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:49,702 INFO L93 Difference]: Finished difference Result 704 states and 866 transitions. [2022-01-31 21:57:49,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:57:49,702 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2022-01-31 21:57:49,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:49,704 INFO L225 Difference]: With dead ends: 704 [2022-01-31 21:57:49,704 INFO L226 Difference]: Without dead ends: 665 [2022-01-31 21:57:49,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:57:49,705 INFO L933 BasicCegarLoop]: 395 mSDtfsCounter, 703 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:49,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [705 Valid, 981 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 21:57:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-01-31 21:57:49,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 665. [2022-01-31 21:57:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 525 states have (on average 1.2571428571428571) internal successors, (660), 539 states have internal predecessors, (660), 70 states have call successors, (70), 49 states have call predecessors, (70), 69 states have return successors, (94), 85 states have call predecessors, (94), 65 states have call successors, (94) [2022-01-31 21:57:49,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 824 transitions. [2022-01-31 21:57:49,931 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 824 transitions. Word has length 69 [2022-01-31 21:57:49,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:49,931 INFO L470 AbstractCegarLoop]: Abstraction has 665 states and 824 transitions. [2022-01-31 21:57:49,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:57:49,931 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 824 transitions. [2022-01-31 21:57:49,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-31 21:57:49,933 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:49,933 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:49,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-01-31 21:57:49,933 INFO L402 AbstractCegarLoop]: === Iteration 53 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:49,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:49,933 INFO L85 PathProgramCache]: Analyzing trace with hash 430312169, now seen corresponding path program 1 times [2022-01-31 21:57:49,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:49,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1392363659] [2022-01-31 21:57:49,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:49,934 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:49,935 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:49,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:50,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:50,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:50,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:50,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:50,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:50,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-31 21:57:50,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:50,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:57:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:50,174 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:57:50,175 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:50,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1392363659] [2022-01-31 21:57:50,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1392363659] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:50,175 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:50,175 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 21:57:50,175 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60572280] [2022-01-31 21:57:50,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:50,176 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 21:57:50,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:50,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 21:57:50,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:57:50,176 INFO L87 Difference]: Start difference. First operand 665 states and 824 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:57:51,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:51,983 INFO L93 Difference]: Finished difference Result 692 states and 854 transitions. [2022-01-31 21:57:51,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-31 21:57:51,983 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2022-01-31 21:57:51,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:51,985 INFO L225 Difference]: With dead ends: 692 [2022-01-31 21:57:51,985 INFO L226 Difference]: Without dead ends: 662 [2022-01-31 21:57:51,985 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2022-01-31 21:57:51,985 INFO L933 BasicCegarLoop]: 409 mSDtfsCounter, 260 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 3535 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 1933 SdHoareTripleChecker+Invalid, 3617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 3535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:51,986 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [263 Valid, 1933 Invalid, 3617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3535 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-31 21:57:51,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2022-01-31 21:57:52,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2022-01-31 21:57:52,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 523 states have (on average 1.2562141491395793) internal successors, (657), 537 states have internal predecessors, (657), 69 states have call successors, (69), 49 states have call predecessors, (69), 69 states have return successors, (93), 84 states have call predecessors, (93), 64 states have call successors, (93) [2022-01-31 21:57:52,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 819 transitions. [2022-01-31 21:57:52,154 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 819 transitions. Word has length 69 [2022-01-31 21:57:52,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:52,154 INFO L470 AbstractCegarLoop]: Abstraction has 662 states and 819 transitions. [2022-01-31 21:57:52,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:57:52,154 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 819 transitions. [2022-01-31 21:57:52,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-31 21:57:52,155 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:52,155 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] [2022-01-31 21:57:52,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-01-31 21:57:52,155 INFO L402 AbstractCegarLoop]: === Iteration 54 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:52,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:52,155 INFO L85 PathProgramCache]: Analyzing trace with hash 432994108, now seen corresponding path program 1 times [2022-01-31 21:57:52,155 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:52,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1748406454] [2022-01-31 21:57:52,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:52,156 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:52,157 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:52,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:52,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:52,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:52,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:52,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:52,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:57:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:52,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:57:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:52,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:52,371 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:57:52,371 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:52,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1748406454] [2022-01-31 21:57:52,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1748406454] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:52,371 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:52,372 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 21:57:52,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545902096] [2022-01-31 21:57:52,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:52,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 21:57:52,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:52,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 21:57:52,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:57:52,373 INFO L87 Difference]: Start difference. First operand 662 states and 819 transitions. Second operand has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 21:57:54,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:54,043 INFO L93 Difference]: Finished difference Result 672 states and 828 transitions. [2022-01-31 21:57:54,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 21:57:54,044 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) Word has length 69 [2022-01-31 21:57:54,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:54,045 INFO L225 Difference]: With dead ends: 672 [2022-01-31 21:57:54,045 INFO L226 Difference]: Without dead ends: 666 [2022-01-31 21:57:54,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2022-01-31 21:57:54,046 INFO L933 BasicCegarLoop]: 358 mSDtfsCounter, 748 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 3455 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 3700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 3455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:54,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [757 Valid, 1544 Invalid, 3700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 3455 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-31 21:57:54,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-01-31 21:57:54,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 660. [2022-01-31 21:57:54,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 521 states have (on average 1.2533589251439539) internal successors, (653), 535 states have internal predecessors, (653), 69 states have call successors, (69), 49 states have call predecessors, (69), 69 states have return successors, (93), 84 states have call predecessors, (93), 64 states have call successors, (93) [2022-01-31 21:57:54,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 815 transitions. [2022-01-31 21:57:54,190 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 815 transitions. Word has length 69 [2022-01-31 21:57:54,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:54,190 INFO L470 AbstractCegarLoop]: Abstraction has 660 states and 815 transitions. [2022-01-31 21:57:54,190 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (9), 9 states have call predecessors, (9), 4 states have return successors, (7), 4 states have call predecessors, (7), 1 states have call successors, (7) [2022-01-31 21:57:54,190 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 815 transitions. [2022-01-31 21:57:54,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-01-31 21:57:54,191 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:54,191 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:57:54,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-01-31 21:57:54,192 INFO L402 AbstractCegarLoop]: === Iteration 55 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:54,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:54,192 INFO L85 PathProgramCache]: Analyzing trace with hash 432717278, now seen corresponding path program 1 times [2022-01-31 21:57:54,192 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:54,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [752507708] [2022-01-31 21:57:54,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:54,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:54,194 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:54,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:54,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:54,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:54,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:54,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:57:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:54,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:57:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:54,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:54,390 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:57:54,390 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:54,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [752507708] [2022-01-31 21:57:54,390 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [752507708] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:54,390 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:54,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:57:54,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125401457] [2022-01-31 21:57:54,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:54,391 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:57:54,391 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:54,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:57:54,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:57:54,392 INFO L87 Difference]: Start difference. First operand 660 states and 815 transitions. Second operand has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:57:55,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:55,871 INFO L93 Difference]: Finished difference Result 736 states and 910 transitions. [2022-01-31 21:57:55,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:57:55,872 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2022-01-31 21:57:55,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:55,873 INFO L225 Difference]: With dead ends: 736 [2022-01-31 21:57:55,874 INFO L226 Difference]: Without dead ends: 674 [2022-01-31 21:57:55,874 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:57:55,874 INFO L933 BasicCegarLoop]: 418 mSDtfsCounter, 901 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 840 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:55,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [908 Valid, 840 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1391 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-01-31 21:57:55,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-01-31 21:57:56,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 604. [2022-01-31 21:57:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 475 states have (on average 1.2463157894736843) internal successors, (592), 487 states have internal predecessors, (592), 67 states have call successors, (67), 47 states have call predecessors, (67), 61 states have return successors, (85), 76 states have call predecessors, (85), 62 states have call successors, (85) [2022-01-31 21:57:56,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 744 transitions. [2022-01-31 21:57:56,067 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 744 transitions. Word has length 69 [2022-01-31 21:57:56,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:56,068 INFO L470 AbstractCegarLoop]: Abstraction has 604 states and 744 transitions. [2022-01-31 21:57:56,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.416666666666667) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:57:56,068 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 744 transitions. [2022-01-31 21:57:56,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 21:57:56,069 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:56,069 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:56,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-01-31 21:57:56,069 INFO L402 AbstractCegarLoop]: === Iteration 56 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:56,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:56,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1139480101, now seen corresponding path program 1 times [2022-01-31 21:57:56,070 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:56,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1849803525] [2022-01-31 21:57:56,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:56,070 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:56,071 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:56,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:56,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:56,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:56,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:56,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:56,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:57:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:56,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 21:57:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:56,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:56,406 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:57:56,406 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:56,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1849803525] [2022-01-31 21:57:56,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1849803525] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:56,406 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:56,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 21:57:56,407 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866782268] [2022-01-31 21:57:56,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:56,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 21:57:56,408 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:56,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 21:57:56,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:57:56,408 INFO L87 Difference]: Start difference. First operand 604 states and 744 transitions. Second operand has 21 states, 20 states have (on average 2.65) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 21:57:58,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:58,327 INFO L93 Difference]: Finished difference Result 637 states and 783 transitions. [2022-01-31 21:57:58,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:57:58,328 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.65) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 71 [2022-01-31 21:57:58,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:58,331 INFO L225 Difference]: With dead ends: 637 [2022-01-31 21:57:58,331 INFO L226 Difference]: Without dead ends: 610 [2022-01-31 21:57:58,331 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:57:58,332 INFO L933 BasicCegarLoop]: 409 mSDtfsCounter, 1108 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 4000 mSolverCounterSat, 385 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 2200 SdHoareTripleChecker+Invalid, 4385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 385 IncrementalHoareTripleChecker+Valid, 4000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:58,332 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1110 Valid, 2200 Invalid, 4385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [385 Valid, 4000 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-01-31 21:57:58,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-01-31 21:57:58,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 606. [2022-01-31 21:57:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 477 states have (on average 1.2389937106918238) internal successors, (591), 489 states have internal predecessors, (591), 67 states have call successors, (67), 47 states have call predecessors, (67), 61 states have return successors, (85), 76 states have call predecessors, (85), 62 states have call successors, (85) [2022-01-31 21:57:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 743 transitions. [2022-01-31 21:57:58,547 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 743 transitions. Word has length 71 [2022-01-31 21:57:58,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:57:58,547 INFO L470 AbstractCegarLoop]: Abstraction has 606 states and 743 transitions. [2022-01-31 21:57:58,547 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.65) internal successors, (53), 10 states have internal predecessors, (53), 4 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2022-01-31 21:57:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 743 transitions. [2022-01-31 21:57:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 21:57:58,548 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:57:58,548 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:57:58,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-01-31 21:57:58,549 INFO L402 AbstractCegarLoop]: === Iteration 57 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:57:58,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:57:58,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1104503197, now seen corresponding path program 1 times [2022-01-31 21:57:58,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:57:58,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [381196651] [2022-01-31 21:57:58,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:57:58,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:57:58,551 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:57:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:58,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:57:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:58,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:57:58,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:58,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:57:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:58,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:57:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:58,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:57:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:58,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:57:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:58,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 21:57:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:58,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:57:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:57:58,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:57:58,729 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:57:58,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [381196651] [2022-01-31 21:57:58,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [381196651] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:57:58,730 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:57:58,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:57:58,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284768193] [2022-01-31 21:57:58,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:57:58,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:57:58,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:57:58,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:57:58,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:57:58,730 INFO L87 Difference]: Start difference. First operand 606 states and 743 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 21:57:59,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:57:59,935 INFO L93 Difference]: Finished difference Result 644 states and 782 transitions. [2022-01-31 21:57:59,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:57:59,935 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2022-01-31 21:57:59,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:57:59,937 INFO L225 Difference]: With dead ends: 644 [2022-01-31 21:57:59,937 INFO L226 Difference]: Without dead ends: 599 [2022-01-31 21:57:59,937 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:57:59,937 INFO L933 BasicCegarLoop]: 390 mSDtfsCounter, 243 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 1780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:57:59,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 1087 Invalid, 1780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:57:59,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-01-31 21:58:00,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2022-01-31 21:58:00,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 471 states have (on average 1.2399150743099787) internal successors, (584), 483 states have internal predecessors, (584), 66 states have call successors, (66), 47 states have call predecessors, (66), 61 states have return successors, (83), 75 states have call predecessors, (83), 61 states have call successors, (83) [2022-01-31 21:58:00,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 733 transitions. [2022-01-31 21:58:00,131 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 733 transitions. Word has length 71 [2022-01-31 21:58:00,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:00,131 INFO L470 AbstractCegarLoop]: Abstraction has 599 states and 733 transitions. [2022-01-31 21:58:00,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 21:58:00,131 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 733 transitions. [2022-01-31 21:58:00,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-01-31 21:58:00,132 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:58:00,132 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:58:00,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-01-31 21:58:00,133 INFO L402 AbstractCegarLoop]: === Iteration 58 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:58:00,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:58:00,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1182907842, now seen corresponding path program 1 times [2022-01-31 21:58:00,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:58:00,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1587615079] [2022-01-31 21:58:00,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:58:00,134 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:58:00,135 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:58:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:00,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:58:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:00,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:58:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:00,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:00,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:58:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:00,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:58:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:00,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-01-31 21:58:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:00,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 21:58:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:00,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:58:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:00,336 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:58:00,336 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:58:00,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1587615079] [2022-01-31 21:58:00,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1587615079] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:58:00,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:58:00,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:58:00,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943267816] [2022-01-31 21:58:00,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:58:00,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:58:00,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:58:00,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:58:00,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:58:00,337 INFO L87 Difference]: Start difference. First operand 599 states and 733 transitions. Second operand has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 21:58:01,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:58:01,400 INFO L93 Difference]: Finished difference Result 637 states and 772 transitions. [2022-01-31 21:58:01,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:58:01,400 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 71 [2022-01-31 21:58:01,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:58:01,401 INFO L225 Difference]: With dead ends: 637 [2022-01-31 21:58:01,402 INFO L226 Difference]: Without dead ends: 593 [2022-01-31 21:58:01,402 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:58:01,402 INFO L933 BasicCegarLoop]: 382 mSDtfsCounter, 623 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:58:01,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [624 Valid, 949 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:58:01,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-01-31 21:58:01,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2022-01-31 21:58:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 593 states, 466 states have (on average 1.240343347639485) internal successors, (578), 478 states have internal predecessors, (578), 65 states have call successors, (65), 47 states have call predecessors, (65), 61 states have return successors, (82), 74 states have call predecessors, (82), 60 states have call successors, (82) [2022-01-31 21:58:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 725 transitions. [2022-01-31 21:58:01,535 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 725 transitions. Word has length 71 [2022-01-31 21:58:01,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:01,535 INFO L470 AbstractCegarLoop]: Abstraction has 593 states and 725 transitions. [2022-01-31 21:58:01,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.076923076923077) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 21:58:01,535 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 725 transitions. [2022-01-31 21:58:01,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-31 21:58:01,536 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:58:01,536 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:58:01,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-01-31 21:58:01,536 INFO L402 AbstractCegarLoop]: === Iteration 59 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:58:01,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:58:01,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1729682275, now seen corresponding path program 1 times [2022-01-31 21:58:01,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:58:01,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [436121162] [2022-01-31 21:58:01,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:58:01,537 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:58:01,538 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:58:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:01,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:58:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:01,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:58:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:01,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:01,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:58:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:01,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:58:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:01,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:58:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:01,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:58:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:01,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:58:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:01,726 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:58:01,727 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:58:01,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [436121162] [2022-01-31 21:58:01,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [436121162] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:58:01,727 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:58:01,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:58:01,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302513646] [2022-01-31 21:58:01,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:58:01,727 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:58:01,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:58:01,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:58:01,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:58:01,728 INFO L87 Difference]: Start difference. First operand 593 states and 725 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 21:58:02,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:58:02,747 INFO L93 Difference]: Finished difference Result 631 states and 764 transitions. [2022-01-31 21:58:02,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:58:02,748 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 73 [2022-01-31 21:58:02,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:58:02,749 INFO L225 Difference]: With dead ends: 631 [2022-01-31 21:58:02,749 INFO L226 Difference]: Without dead ends: 581 [2022-01-31 21:58:02,749 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:58:02,750 INFO L933 BasicCegarLoop]: 373 mSDtfsCounter, 632 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:58:02,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [633 Valid, 886 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:58:02,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-01-31 21:58:02,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 581. [2022-01-31 21:58:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 455 states have (on average 1.2351648351648352) internal successors, (562), 467 states have internal predecessors, (562), 64 states have call successors, (64), 47 states have call predecessors, (64), 61 states have return successors, (81), 73 states have call predecessors, (81), 59 states have call successors, (81) [2022-01-31 21:58:02,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 707 transitions. [2022-01-31 21:58:02,886 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 707 transitions. Word has length 73 [2022-01-31 21:58:02,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:02,887 INFO L470 AbstractCegarLoop]: Abstraction has 581 states and 707 transitions. [2022-01-31 21:58:02,887 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 21:58:02,887 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 707 transitions. [2022-01-31 21:58:02,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-31 21:58:02,888 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:58:02,888 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:58:02,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-01-31 21:58:02,888 INFO L402 AbstractCegarLoop]: === Iteration 60 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:58:02,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:58:02,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2105282597, now seen corresponding path program 1 times [2022-01-31 21:58:02,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:58:02,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1474748839] [2022-01-31 21:58:02,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:58:02,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:58:02,890 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:58:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:02,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:58:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:02,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:58:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:03,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:03,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:58:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:03,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:58:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:03,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:58:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:03,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:58:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:03,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:58:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:03,219 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:58:03,219 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:58:03,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1474748839] [2022-01-31 21:58:03,219 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1474748839] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:58:03,219 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:58:03,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:58:03,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83888796] [2022-01-31 21:58:03,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:58:03,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:58:03,220 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:58:03,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:58:03,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:58:03,220 INFO L87 Difference]: Start difference. First operand 581 states and 707 transitions. Second operand has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 10 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-31 21:58:06,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:58:06,542 INFO L93 Difference]: Finished difference Result 1245 states and 1510 transitions. [2022-01-31 21:58:06,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-01-31 21:58:06,543 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 10 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) Word has length 73 [2022-01-31 21:58:06,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:58:06,546 INFO L225 Difference]: With dead ends: 1245 [2022-01-31 21:58:06,546 INFO L226 Difference]: Without dead ends: 1100 [2022-01-31 21:58:06,546 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=614, Invalid=2356, Unknown=0, NotChecked=0, Total=2970 [2022-01-31 21:58:06,546 INFO L933 BasicCegarLoop]: 377 mSDtfsCounter, 2001 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 3823 mSolverCounterSat, 620 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2005 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 4443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 620 IncrementalHoareTripleChecker+Valid, 3823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-01-31 21:58:06,547 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2005 Valid, 1198 Invalid, 4443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [620 Valid, 3823 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-01-31 21:58:06,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2022-01-31 21:58:06,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 892. [2022-01-31 21:58:06,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 703 states have (on average 1.2574679943100995) internal successors, (884), 722 states have internal predecessors, (884), 95 states have call successors, (95), 74 states have call predecessors, (95), 93 states have return successors, (124), 102 states have call predecessors, (124), 90 states have call successors, (124) [2022-01-31 21:58:06,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1103 transitions. [2022-01-31 21:58:06,775 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1103 transitions. Word has length 73 [2022-01-31 21:58:06,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:06,775 INFO L470 AbstractCegarLoop]: Abstraction has 892 states and 1103 transitions. [2022-01-31 21:58:06,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.8947368421052633) internal successors, (55), 10 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 4 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-31 21:58:06,775 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1103 transitions. [2022-01-31 21:58:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-31 21:58:06,776 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:58:06,776 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:58:06,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-01-31 21:58:06,777 INFO L402 AbstractCegarLoop]: === Iteration 61 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:58:06,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:58:06,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1426010343, now seen corresponding path program 1 times [2022-01-31 21:58:06,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:58:06,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [851814509] [2022-01-31 21:58:06,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:58:06,777 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:58:06,778 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:58:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:06,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:58:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:06,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:58:06,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:06,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:06,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:58:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:06,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:58:06,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:06,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:58:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:06,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:58:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:06,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:58:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:06,987 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:58:06,987 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:58:06,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [851814509] [2022-01-31 21:58:06,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [851814509] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:58:06,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:58:06,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:58:06,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804180790] [2022-01-31 21:58:06,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:58:06,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:58:06,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:58:06,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:58:06,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:58:06,989 INFO L87 Difference]: Start difference. First operand 892 states and 1103 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 6 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-31 21:58:08,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:58:08,827 INFO L93 Difference]: Finished difference Result 1149 states and 1395 transitions. [2022-01-31 21:58:08,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-31 21:58:08,828 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 6 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 73 [2022-01-31 21:58:08,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:58:08,830 INFO L225 Difference]: With dead ends: 1149 [2022-01-31 21:58:08,830 INFO L226 Difference]: Without dead ends: 1044 [2022-01-31 21:58:08,831 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=567, Unknown=0, NotChecked=0, Total=756 [2022-01-31 21:58:08,831 INFO L933 BasicCegarLoop]: 624 mSDtfsCounter, 2826 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 902 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2830 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 2346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 902 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:58:08,831 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2830 Valid, 1160 Invalid, 2346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [902 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-01-31 21:58:08,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2022-01-31 21:58:09,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 985. [2022-01-31 21:58:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 776 states have (on average 1.2448453608247423) internal successors, (966), 790 states have internal predecessors, (966), 109 states have call successors, (109), 78 states have call predecessors, (109), 99 states have return successors, (140), 121 states have call predecessors, (140), 104 states have call successors, (140) [2022-01-31 21:58:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1215 transitions. [2022-01-31 21:58:09,227 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1215 transitions. Word has length 73 [2022-01-31 21:58:09,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:09,227 INFO L470 AbstractCegarLoop]: Abstraction has 985 states and 1215 transitions. [2022-01-31 21:58:09,227 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 6 states have internal predecessors, (55), 5 states have call successors, (10), 10 states have call predecessors, (10), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-01-31 21:58:09,227 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1215 transitions. [2022-01-31 21:58:09,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-31 21:58:09,229 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:58:09,229 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] [2022-01-31 21:58:09,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-01-31 21:58:09,229 INFO L402 AbstractCegarLoop]: === Iteration 62 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:58:09,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:58:09,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1171935895, now seen corresponding path program 1 times [2022-01-31 21:58:09,230 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:58:09,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1346342939] [2022-01-31 21:58:09,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:58:09,230 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:58:09,232 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:58:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:09,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:58:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:09,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:58:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:09,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:09,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:09,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:58:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:09,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:58:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:09,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:09,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:09,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:09,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 21:58:09,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:09,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:58:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:09,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:58:09,534 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:58:09,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1346342939] [2022-01-31 21:58:09,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1346342939] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:58:09,534 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:58:09,534 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-01-31 21:58:09,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91867770] [2022-01-31 21:58:09,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:58:09,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-31 21:58:09,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:58:09,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-31 21:58:09,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-01-31 21:58:09,535 INFO L87 Difference]: Start difference. First operand 985 states and 1215 transitions. Second operand has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 10 states have internal predecessors, (57), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-31 21:58:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:58:11,428 INFO L93 Difference]: Finished difference Result 1017 states and 1250 transitions. [2022-01-31 21:58:11,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-31 21:58:11,428 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 10 states have internal predecessors, (57), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) Word has length 77 [2022-01-31 21:58:11,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:58:11,430 INFO L225 Difference]: With dead ends: 1017 [2022-01-31 21:58:11,431 INFO L226 Difference]: Without dead ends: 981 [2022-01-31 21:58:11,431 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=692, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:58:11,431 INFO L933 BasicCegarLoop]: 372 mSDtfsCounter, 565 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 3699 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 2184 SdHoareTripleChecker+Invalid, 3910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 3699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:58:11,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [567 Valid, 2184 Invalid, 3910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 3699 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-01-31 21:58:11,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2022-01-31 21:58:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 981. [2022-01-31 21:58:11,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 772 states have (on average 1.2435233160621761) internal successors, (960), 786 states have internal predecessors, (960), 109 states have call successors, (109), 78 states have call predecessors, (109), 99 states have return successors, (140), 121 states have call predecessors, (140), 104 states have call successors, (140) [2022-01-31 21:58:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1209 transitions. [2022-01-31 21:58:11,700 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1209 transitions. Word has length 77 [2022-01-31 21:58:11,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:11,701 INFO L470 AbstractCegarLoop]: Abstraction has 981 states and 1209 transitions. [2022-01-31 21:58:11,701 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.7142857142857144) internal successors, (57), 10 states have internal predecessors, (57), 4 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 5 states have call predecessors, (9), 3 states have call successors, (9) [2022-01-31 21:58:11,701 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1209 transitions. [2022-01-31 21:58:11,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-31 21:58:11,702 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:58:11,702 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] [2022-01-31 21:58:11,702 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-01-31 21:58:11,702 INFO L402 AbstractCegarLoop]: === Iteration 63 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:58:11,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:58:11,703 INFO L85 PathProgramCache]: Analyzing trace with hash -31950521, now seen corresponding path program 1 times [2022-01-31 21:58:11,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:58:11,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [457183466] [2022-01-31 21:58:11,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:58:11,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:58:11,705 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:58:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:11,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:58:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:11,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:58:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:11,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:11,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:58:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:11,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:58:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:11,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:11,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:11,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:11,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-31 21:58:11,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:11,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:58:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:11,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:58:11,916 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:58:11,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [457183466] [2022-01-31 21:58:11,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [457183466] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:58:11,917 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:58:11,917 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:58:11,917 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78245351] [2022-01-31 21:58:11,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:58:11,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:58:11,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:58:11,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:58:11,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:58:11,918 INFO L87 Difference]: Start difference. First operand 981 states and 1209 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 21:58:13,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:58:13,212 INFO L93 Difference]: Finished difference Result 1034 states and 1265 transitions. [2022-01-31 21:58:13,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:58:13,212 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 78 [2022-01-31 21:58:13,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:58:13,215 INFO L225 Difference]: With dead ends: 1034 [2022-01-31 21:58:13,215 INFO L226 Difference]: Without dead ends: 947 [2022-01-31 21:58:13,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:58:13,216 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 520 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1647 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1099 SdHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-31 21:58:13,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [521 Valid, 1099 Invalid, 1844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1647 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-01-31 21:58:13,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2022-01-31 21:58:13,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 947. [2022-01-31 21:58:13,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 744 states have (on average 1.239247311827957) internal successors, (922), 758 states have internal predecessors, (922), 103 states have call successors, (103), 78 states have call predecessors, (103), 99 states have return successors, (132), 115 states have call predecessors, (132), 98 states have call successors, (132) [2022-01-31 21:58:13,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1157 transitions. [2022-01-31 21:58:13,460 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1157 transitions. Word has length 78 [2022-01-31 21:58:13,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:13,460 INFO L470 AbstractCegarLoop]: Abstraction has 947 states and 1157 transitions. [2022-01-31 21:58:13,460 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 10 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 21:58:13,461 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1157 transitions. [2022-01-31 21:58:13,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-31 21:58:13,462 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:58:13,462 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] [2022-01-31 21:58:13,462 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-01-31 21:58:13,462 INFO L402 AbstractCegarLoop]: === Iteration 64 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:58:13,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:58:13,462 INFO L85 PathProgramCache]: Analyzing trace with hash -460582850, now seen corresponding path program 1 times [2022-01-31 21:58:13,462 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:58:13,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2131766026] [2022-01-31 21:58:13,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:58:13,463 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:58:13,464 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:58:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:13,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:58:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:13,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:58:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:13,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:13,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:58:13,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:13,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:58:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:13,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:58:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:13,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:58:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:13,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:58:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:13,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:58:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:13,685 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:58:13,685 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:58:13,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2131766026] [2022-01-31 21:58:13,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2131766026] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:58:13,685 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:58:13,685 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-01-31 21:58:13,685 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424971] [2022-01-31 21:58:13,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:58:13,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-31 21:58:13,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:58:13,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-31 21:58:13,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:58:13,686 INFO L87 Difference]: Start difference. First operand 947 states and 1157 transitions. Second operand has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (11), 10 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:58:14,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:58:14,905 INFO L93 Difference]: Finished difference Result 976 states and 1185 transitions. [2022-01-31 21:58:14,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:58:14,906 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (11), 10 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 75 [2022-01-31 21:58:14,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:58:14,907 INFO L225 Difference]: With dead ends: 976 [2022-01-31 21:58:14,908 INFO L226 Difference]: Without dead ends: 899 [2022-01-31 21:58:14,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:58:14,908 INFO L933 BasicCegarLoop]: 321 mSDtfsCounter, 203 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 1777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-31 21:58:14,909 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 1048 Invalid, 1777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1702 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-31 21:58:14,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2022-01-31 21:58:15,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2022-01-31 21:58:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 710 states have (on average 1.2422535211267605) internal successors, (882), 724 states have internal predecessors, (882), 93 states have call successors, (93), 74 states have call predecessors, (93), 95 states have return successors, (120), 105 states have call predecessors, (120), 88 states have call successors, (120) [2022-01-31 21:58:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1095 transitions. [2022-01-31 21:58:15,189 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1095 transitions. Word has length 75 [2022-01-31 21:58:15,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:15,189 INFO L470 AbstractCegarLoop]: Abstraction has 899 states and 1095 transitions. [2022-01-31 21:58:15,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6666666666666665) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (11), 10 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:58:15,189 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1095 transitions. [2022-01-31 21:58:15,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-01-31 21:58:15,191 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:58:15,191 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:58:15,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-01-31 21:58:15,191 INFO L402 AbstractCegarLoop]: === Iteration 65 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:58:15,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:58:15,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1062745439, now seen corresponding path program 1 times [2022-01-31 21:58:15,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:58:15,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1139394495] [2022-01-31 21:58:15,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:58:15,192 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:58:15,193 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:58:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:15,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:58:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:15,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:58:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:15,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:15,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:58:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:15,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:58:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:15,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 21:58:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:15,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-01-31 21:58:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:15,361 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:58:15,361 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:58:15,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1139394495] [2022-01-31 21:58:15,361 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1139394495] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:58:15,361 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:58:15,361 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:58:15,361 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688514922] [2022-01-31 21:58:15,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:58:15,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:58:15,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:58:15,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:58:15,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:58:15,363 INFO L87 Difference]: Start difference. First operand 899 states and 1095 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:58:16,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:58:16,280 INFO L93 Difference]: Finished difference Result 944 states and 1143 transitions. [2022-01-31 21:58:16,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:58:16,280 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2022-01-31 21:58:16,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:58:16,282 INFO L225 Difference]: With dead ends: 944 [2022-01-31 21:58:16,282 INFO L226 Difference]: Without dead ends: 883 [2022-01-31 21:58:16,283 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:58:16,283 INFO L933 BasicCegarLoop]: 305 mSDtfsCounter, 307 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 926 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:58:16,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 857 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 926 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:58:16,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2022-01-31 21:58:16,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2022-01-31 21:58:16,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 696 states have (on average 1.2413793103448276) internal successors, (864), 710 states have internal predecessors, (864), 91 states have call successors, (91), 74 states have call predecessors, (91), 95 states have return successors, (116), 103 states have call predecessors, (116), 86 states have call successors, (116) [2022-01-31 21:58:16,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1071 transitions. [2022-01-31 21:58:16,576 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1071 transitions. Word has length 73 [2022-01-31 21:58:16,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:16,576 INFO L470 AbstractCegarLoop]: Abstraction has 883 states and 1071 transitions. [2022-01-31 21:58:16,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (9), 9 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-01-31 21:58:16,577 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1071 transitions. [2022-01-31 21:58:16,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-31 21:58:16,579 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:58:16,579 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] [2022-01-31 21:58:16,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-01-31 21:58:16,579 INFO L402 AbstractCegarLoop]: === Iteration 66 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:58:16,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:58:16,579 INFO L85 PathProgramCache]: Analyzing trace with hash 225974744, now seen corresponding path program 1 times [2022-01-31 21:58:16,579 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:58:16,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1769074036] [2022-01-31 21:58:16,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:58:16,580 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:58:16,581 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:58:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:16,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:58:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:16,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:58:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:16,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:16,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:16,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 21:58:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:16,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:58:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:16,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:16,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:16,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:58:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:16,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-31 21:58:16,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:16,826 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:58:16,826 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:58:16,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1769074036] [2022-01-31 21:58:16,826 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1769074036] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:58:16,826 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:58:16,826 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-01-31 21:58:16,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451764394] [2022-01-31 21:58:16,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:58:16,827 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-31 21:58:16,827 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:58:16,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-31 21:58:16,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-01-31 21:58:16,827 INFO L87 Difference]: Start difference. First operand 883 states and 1071 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 21:58:17,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:58:17,876 INFO L93 Difference]: Finished difference Result 1161 states and 1426 transitions. [2022-01-31 21:58:17,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 21:58:17,877 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 77 [2022-01-31 21:58:17,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:58:17,878 INFO L225 Difference]: With dead ends: 1161 [2022-01-31 21:58:17,878 INFO L226 Difference]: Without dead ends: 869 [2022-01-31 21:58:17,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2022-01-31 21:58:17,879 INFO L933 BasicCegarLoop]: 297 mSDtfsCounter, 622 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 624 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-31 21:58:17,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [624 Valid, 959 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-31 21:58:17,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2022-01-31 21:58:18,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2022-01-31 21:58:18,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 682 states have (on average 1.2346041055718475) internal successors, (842), 696 states have internal predecessors, (842), 91 states have call successors, (91), 74 states have call predecessors, (91), 95 states have return successors, (116), 103 states have call predecessors, (116), 86 states have call successors, (116) [2022-01-31 21:58:18,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1049 transitions. [2022-01-31 21:58:18,085 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1049 transitions. Word has length 77 [2022-01-31 21:58:18,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:18,085 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 1049 transitions. [2022-01-31 21:58:18,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 5 states have internal predecessors, (55), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-01-31 21:58:18,085 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1049 transitions. [2022-01-31 21:58:18,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-31 21:58:18,086 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:58:18,086 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 21:58:18,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-01-31 21:58:18,087 INFO L402 AbstractCegarLoop]: === Iteration 67 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:58:18,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:58:18,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1317209987, now seen corresponding path program 1 times [2022-01-31 21:58:18,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:58:18,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [934977795] [2022-01-31 21:58:18,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:58:18,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:58:18,088 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:58:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:18,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:58:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:18,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:58:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:18,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:18,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:58:18,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:18,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:58:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:18,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:18,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-31 21:58:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:18,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-01-31 21:58:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:18,301 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-31 21:58:18,301 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:58:18,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [934977795] [2022-01-31 21:58:18,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [934977795] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:58:18,301 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:58:18,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:58:18,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137370378] [2022-01-31 21:58:18,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:58:18,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:58:18,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:58:18,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:58:18,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:58:18,302 INFO L87 Difference]: Start difference. First operand 869 states and 1049 transitions. Second operand has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 21:58:19,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:58:19,134 INFO L93 Difference]: Finished difference Result 914 states and 1097 transitions. [2022-01-31 21:58:19,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-31 21:58:19,135 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 75 [2022-01-31 21:58:19,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:58:19,136 INFO L225 Difference]: With dead ends: 914 [2022-01-31 21:58:19,136 INFO L226 Difference]: Without dead ends: 849 [2022-01-31 21:58:19,137 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:58:19,137 INFO L933 BasicCegarLoop]: 289 mSDtfsCounter, 284 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:58:19,137 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 858 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 792 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:58:19,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2022-01-31 21:58:19,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2022-01-31 21:58:19,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 849 states, 666 states have (on average 1.2342342342342343) internal successors, (822), 680 states have internal predecessors, (822), 87 states have call successors, (87), 74 states have call predecessors, (87), 95 states have return successors, (112), 99 states have call predecessors, (112), 82 states have call successors, (112) [2022-01-31 21:58:19,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 1021 transitions. [2022-01-31 21:58:19,339 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 1021 transitions. Word has length 75 [2022-01-31 21:58:19,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:19,340 INFO L470 AbstractCegarLoop]: Abstraction has 849 states and 1021 transitions. [2022-01-31 21:58:19,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.583333333333333) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 21:58:19,340 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1021 transitions. [2022-01-31 21:58:19,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-31 21:58:19,341 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:58:19,342 INFO L514 BasicCegarLoop]: trace histogram [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] [2022-01-31 21:58:19,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-01-31 21:58:19,342 INFO L402 AbstractCegarLoop]: === Iteration 68 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:58:19,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:58:19,342 INFO L85 PathProgramCache]: Analyzing trace with hash -611792915, now seen corresponding path program 1 times [2022-01-31 21:58:19,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:58:19,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1607157670] [2022-01-31 21:58:19,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:58:19,343 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:58:19,344 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:58:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:19,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:58:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:19,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:58:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:19,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:19,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:58:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:19,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:58:19,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:19,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-31 21:58:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:19,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:58:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:19,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-31 21:58:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:19,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-31 21:58:19,522 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:58:19,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1607157670] [2022-01-31 21:58:19,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1607157670] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:58:19,523 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:58:19,523 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:58:19,523 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191403758] [2022-01-31 21:58:19,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:58:19,523 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:58:19,523 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:58:19,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:58:19,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:58:19,524 INFO L87 Difference]: Start difference. First operand 849 states and 1021 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 21:58:20,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:58:20,382 INFO L93 Difference]: Finished difference Result 883 states and 1053 transitions. [2022-01-31 21:58:20,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 21:58:20,382 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 77 [2022-01-31 21:58:20,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:58:20,384 INFO L225 Difference]: With dead ends: 883 [2022-01-31 21:58:20,384 INFO L226 Difference]: Without dead ends: 788 [2022-01-31 21:58:20,384 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-01-31 21:58:20,385 INFO L933 BasicCegarLoop]: 267 mSDtfsCounter, 257 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:58:20,385 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 787 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:58:20,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-01-31 21:58:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2022-01-31 21:58:20,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 620 states have (on average 1.2419354838709677) internal successors, (770), 631 states have internal predecessors, (770), 81 states have call successors, (81), 71 states have call predecessors, (81), 86 states have return successors, (100), 90 states have call predecessors, (100), 76 states have call successors, (100) [2022-01-31 21:58:20,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 951 transitions. [2022-01-31 21:58:20,584 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 951 transitions. Word has length 77 [2022-01-31 21:58:20,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:20,584 INFO L470 AbstractCegarLoop]: Abstraction has 788 states and 951 transitions. [2022-01-31 21:58:20,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (10), 9 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-01-31 21:58:20,584 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 951 transitions. [2022-01-31 21:58:20,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-31 21:58:20,585 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:58:20,585 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:58:20,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2022-01-31 21:58:20,585 INFO L402 AbstractCegarLoop]: === Iteration 69 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:58:20,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:58:20,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1451191297, now seen corresponding path program 1 times [2022-01-31 21:58:20,586 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:58:20,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2017697005] [2022-01-31 21:58:20,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:58:20,586 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:58:20,587 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:58:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:20,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:58:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:20,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:58:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:20,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:20,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 21:58:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:20,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:58:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:20,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:20,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:20,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:58:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:20,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 21:58:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:20,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-01-31 21:58:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:58:20,824 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:58:20,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2017697005] [2022-01-31 21:58:20,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2017697005] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:58:20,824 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:58:20,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-01-31 21:58:20,824 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255817201] [2022-01-31 21:58:20,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:58:20,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-31 21:58:20,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:58:20,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-31 21:58:20,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:58:20,825 INFO L87 Difference]: Start difference. First operand 788 states and 951 transitions. Second operand has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (14), 11 states have call predecessors, (14), 5 states have return successors, (10), 6 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-31 21:58:21,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:58:21,709 INFO L93 Difference]: Finished difference Result 1066 states and 1306 transitions. [2022-01-31 21:58:21,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-31 21:58:21,709 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (14), 11 states have call predecessors, (14), 5 states have return successors, (10), 6 states have call predecessors, (10), 3 states have call successors, (10) Word has length 81 [2022-01-31 21:58:21,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:58:21,710 INFO L225 Difference]: With dead ends: 1066 [2022-01-31 21:58:21,710 INFO L226 Difference]: Without dead ends: 788 [2022-01-31 21:58:21,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2022-01-31 21:58:21,711 INFO L933 BasicCegarLoop]: 260 mSDtfsCounter, 752 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 759 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:58:21,711 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [759 Valid, 761 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:58:21,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-01-31 21:58:21,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2022-01-31 21:58:21,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 620 states have (on average 1.238709677419355) internal successors, (768), 631 states have internal predecessors, (768), 81 states have call successors, (81), 71 states have call predecessors, (81), 86 states have return successors, (100), 90 states have call predecessors, (100), 76 states have call successors, (100) [2022-01-31 21:58:21,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 949 transitions. [2022-01-31 21:58:21,957 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 949 transitions. Word has length 81 [2022-01-31 21:58:21,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:21,957 INFO L470 AbstractCegarLoop]: Abstraction has 788 states and 949 transitions. [2022-01-31 21:58:21,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (14), 11 states have call predecessors, (14), 5 states have return successors, (10), 6 states have call predecessors, (10), 3 states have call successors, (10) [2022-01-31 21:58:21,957 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 949 transitions. [2022-01-31 21:58:21,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-01-31 21:58:21,958 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:58:21,958 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] [2022-01-31 21:58:21,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2022-01-31 21:58:21,958 INFO L402 AbstractCegarLoop]: === Iteration 70 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:58:21,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:58:21,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1545448737, now seen corresponding path program 1 times [2022-01-31 21:58:21,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:58:21,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1013502140] [2022-01-31 21:58:21,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:58:21,959 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:58:21,960 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:58:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:22,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:58:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:22,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:58:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:22,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:22,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:22,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:58:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:22,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:58:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:22,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-01-31 21:58:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:22,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:58:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:22,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:58:22,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:22,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:58:22,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:22,223 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:58:22,223 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:58:22,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1013502140] [2022-01-31 21:58:22,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1013502140] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:58:22,223 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:58:22,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 21:58:22,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761470936] [2022-01-31 21:58:22,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:58:22,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 21:58:22,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:58:22,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 21:58:22,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:58:22,224 INFO L87 Difference]: Start difference. First operand 788 states and 949 transitions. Second operand has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 9 states have internal predecessors, (58), 5 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-01-31 21:58:24,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:58:24,095 INFO L93 Difference]: Finished difference Result 833 states and 994 transitions. [2022-01-31 21:58:24,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-31 21:58:24,096 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 9 states have internal predecessors, (58), 5 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 78 [2022-01-31 21:58:24,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:58:24,097 INFO L225 Difference]: With dead ends: 833 [2022-01-31 21:58:24,097 INFO L226 Difference]: Without dead ends: 700 [2022-01-31 21:58:24,097 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=271, Invalid=851, Unknown=0, NotChecked=0, Total=1122 [2022-01-31 21:58:24,098 INFO L933 BasicCegarLoop]: 425 mSDtfsCounter, 886 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 2983 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 3316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 2983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:58:24,098 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [888 Valid, 1546 Invalid, 3316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 2983 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-01-31 21:58:24,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2022-01-31 21:58:24,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 359. [2022-01-31 21:58:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 282 states have (on average 1.2375886524822695) internal successors, (349), 286 states have internal predecessors, (349), 39 states have call successors, (39), 35 states have call predecessors, (39), 37 states have return successors, (43), 39 states have call predecessors, (43), 35 states have call successors, (43) [2022-01-31 21:58:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 431 transitions. [2022-01-31 21:58:24,195 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 431 transitions. Word has length 78 [2022-01-31 21:58:24,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:24,195 INFO L470 AbstractCegarLoop]: Abstraction has 359 states and 431 transitions. [2022-01-31 21:58:24,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.2222222222222223) internal successors, (58), 9 states have internal predecessors, (58), 5 states have call successors, (11), 10 states have call predecessors, (11), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2022-01-31 21:58:24,195 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 431 transitions. [2022-01-31 21:58:24,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-01-31 21:58:24,196 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:58:24,196 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:58:24,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-01-31 21:58:24,196 INFO L402 AbstractCegarLoop]: === Iteration 71 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:58:24,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:58:24,197 INFO L85 PathProgramCache]: Analyzing trace with hash -550550697, now seen corresponding path program 1 times [2022-01-31 21:58:24,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:58:24,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1395211483] [2022-01-31 21:58:24,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:58:24,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:58:24,198 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:58:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:24,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:58:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:24,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:58:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:24,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:24,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-31 21:58:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:24,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:58:24,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:24,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-31 21:58:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:24,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-01-31 21:58:24,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:24,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-31 21:58:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:24,445 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:58:24,445 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:58:24,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1395211483] [2022-01-31 21:58:24,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1395211483] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:58:24,445 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:58:24,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:58:24,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446694210] [2022-01-31 21:58:24,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:58:24,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:58:24,446 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:58:24,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:58:24,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:58:24,446 INFO L87 Difference]: Start difference. First operand 359 states and 431 transitions. Second operand has 20 states, 20 states have (on average 3.05) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (10), 9 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-31 21:58:25,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:58:25,198 INFO L93 Difference]: Finished difference Result 361 states and 432 transitions. [2022-01-31 21:58:25,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-31 21:58:25,199 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (10), 9 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 1 states have call successors, (8) Word has length 79 [2022-01-31 21:58:25,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:58:25,199 INFO L225 Difference]: With dead ends: 361 [2022-01-31 21:58:25,199 INFO L226 Difference]: Without dead ends: 282 [2022-01-31 21:58:25,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-01-31 21:58:25,200 INFO L933 BasicCegarLoop]: 219 mSDtfsCounter, 193 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1510 SdHoareTripleChecker+Invalid, 1821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-31 21:58:25,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 1510 Invalid, 1821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-31 21:58:25,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-01-31 21:58:25,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-01-31 21:58:25,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 219 states have (on average 1.2557077625570776) internal successors, (275), 221 states have internal predecessors, (275), 31 states have call successors, (31), 29 states have call predecessors, (31), 31 states have return successors, (36), 32 states have call predecessors, (36), 28 states have call successors, (36) [2022-01-31 21:58:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 342 transitions. [2022-01-31 21:58:25,269 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 342 transitions. Word has length 79 [2022-01-31 21:58:25,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:25,269 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 342 transitions. [2022-01-31 21:58:25,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 9 states have internal predecessors, (61), 2 states have call successors, (10), 9 states have call predecessors, (10), 5 states have return successors, (8), 5 states have call predecessors, (8), 1 states have call successors, (8) [2022-01-31 21:58:25,269 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 342 transitions. [2022-01-31 21:58:25,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-01-31 21:58:25,270 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:58:25,270 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:58:25,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2022-01-31 21:58:25,270 INFO L402 AbstractCegarLoop]: === Iteration 72 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:58:25,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:58:25,270 INFO L85 PathProgramCache]: Analyzing trace with hash -312566598, now seen corresponding path program 1 times [2022-01-31 21:58:25,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:58:25,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [18381368] [2022-01-31 21:58:25,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:58:25,271 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:58:25,272 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:58:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:25,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:58:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:25,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:58:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:25,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:25,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-31 21:58:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:25,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:58:25,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:25,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:25,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:25,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:58:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:25,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 21:58:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:25,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:58:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:25,429 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:58:25,429 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:58:25,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [18381368] [2022-01-31 21:58:25,430 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [18381368] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:58:25,430 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:58:25,430 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:58:25,430 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821721013] [2022-01-31 21:58:25,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:58:25,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:58:25,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:58:25,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:58:25,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:58:25,430 INFO L87 Difference]: Start difference. First operand 282 states and 342 transitions. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-31 21:58:25,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:58:25,893 INFO L93 Difference]: Finished difference Result 365 states and 428 transitions. [2022-01-31 21:58:25,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-31 21:58:25,893 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 83 [2022-01-31 21:58:25,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:58:25,894 INFO L225 Difference]: With dead ends: 365 [2022-01-31 21:58:25,894 INFO L226 Difference]: Without dead ends: 279 [2022-01-31 21:58:25,894 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:58:25,894 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 216 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-31 21:58:25,894 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 674 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-31 21:58:25,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-01-31 21:58:25,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 235. [2022-01-31 21:58:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 180 states have (on average 1.1722222222222223) internal successors, (211), 183 states have internal predecessors, (211), 28 states have call successors, (28), 26 states have call predecessors, (28), 26 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2022-01-31 21:58:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 267 transitions. [2022-01-31 21:58:25,953 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 267 transitions. Word has length 83 [2022-01-31 21:58:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:25,953 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 267 transitions. [2022-01-31 21:58:25,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-01-31 21:58:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 267 transitions. [2022-01-31 21:58:25,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-01-31 21:58:25,954 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:58:25,954 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 21:58:25,954 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2022-01-31 21:58:25,954 INFO L402 AbstractCegarLoop]: === Iteration 73 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:58:25,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:58:25,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1508205253, now seen corresponding path program 1 times [2022-01-31 21:58:25,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:58:25,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [30751676] [2022-01-31 21:58:25,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:58:25,955 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:58:25,956 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:58:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:26,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:58:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:26,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:58:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:26,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:26,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:26,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 21:58:26,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:26,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:58:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:26,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:58:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:26,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:26,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:26,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:58:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:26,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 21:58:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:26,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:58:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:26,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-01-31 21:58:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:26,216 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:58:26,216 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:58:26,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [30751676] [2022-01-31 21:58:26,216 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [30751676] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:58:26,216 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:58:26,216 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 21:58:26,217 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137826049] [2022-01-31 21:58:26,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:58:26,217 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 21:58:26,217 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:58:26,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 21:58:26,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:58:26,218 INFO L87 Difference]: Start difference. First operand 235 states and 267 transitions. Second operand has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (14), 11 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-31 21:58:26,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:58:26,878 INFO L93 Difference]: Finished difference Result 287 states and 322 transitions. [2022-01-31 21:58:26,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:58:26,878 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (14), 11 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) Word has length 99 [2022-01-31 21:58:26,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:58:26,879 INFO L225 Difference]: With dead ends: 287 [2022-01-31 21:58:26,879 INFO L226 Difference]: Without dead ends: 255 [2022-01-31 21:58:26,879 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=671, Unknown=0, NotChecked=0, Total=812 [2022-01-31 21:58:26,880 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 386 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:58:26,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [391 Valid, 968 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:58:26,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2022-01-31 21:58:26,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 234. [2022-01-31 21:58:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 179 states have (on average 1.1564245810055866) internal successors, (207), 182 states have internal predecessors, (207), 28 states have call successors, (28), 26 states have call predecessors, (28), 26 states have return successors, (28), 26 states have call predecessors, (28), 26 states have call successors, (28) [2022-01-31 21:58:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 263 transitions. [2022-01-31 21:58:26,939 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 263 transitions. Word has length 99 [2022-01-31 21:58:26,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:26,939 INFO L470 AbstractCegarLoop]: Abstraction has 234 states and 263 transitions. [2022-01-31 21:58:26,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.055555555555555) internal successors, (73), 7 states have internal predecessors, (73), 4 states have call successors, (14), 11 states have call predecessors, (14), 3 states have return successors, (12), 5 states have call predecessors, (12), 3 states have call successors, (12) [2022-01-31 21:58:26,939 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 263 transitions. [2022-01-31 21:58:26,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-31 21:58:26,940 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:58:26,940 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:58:26,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2022-01-31 21:58:26,940 INFO L402 AbstractCegarLoop]: === Iteration 74 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:58:26,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:58:26,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2089325257, now seen corresponding path program 1 times [2022-01-31 21:58:26,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:58:26,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [29261565] [2022-01-31 21:58:26,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:58:26,941 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:58:26,942 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:58:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:27,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:58:27,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:27,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:58:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:27,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:27,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:27,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 21:58:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:27,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:58:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:27,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:58:27,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:27,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:27,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:27,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:58:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:27,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 21:58:27,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:27,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:58:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:27,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 21:58:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:27,217 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:58:27,217 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:58:27,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [29261565] [2022-01-31 21:58:27,217 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [29261565] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:58:27,217 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:58:27,217 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-01-31 21:58:27,218 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095266248] [2022-01-31 21:58:27,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:58:27,218 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-31 21:58:27,218 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:58:27,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-31 21:58:27,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:58:27,219 INFO L87 Difference]: Start difference. First operand 234 states and 263 transitions. Second operand has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 9 states have internal predecessors, (75), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-01-31 21:58:28,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:58:28,771 INFO L93 Difference]: Finished difference Result 508 states and 570 transitions. [2022-01-31 21:58:28,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-01-31 21:58:28,772 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 9 states have internal predecessors, (75), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) Word has length 101 [2022-01-31 21:58:28,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:58:28,773 INFO L225 Difference]: With dead ends: 508 [2022-01-31 21:58:28,773 INFO L226 Difference]: Without dead ends: 399 [2022-01-31 21:58:28,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=245, Invalid=1315, Unknown=0, NotChecked=0, Total=1560 [2022-01-31 21:58:28,774 INFO L933 BasicCegarLoop]: 252 mSDtfsCounter, 633 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 2522 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 2740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 2522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-31 21:58:28,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [634 Valid, 952 Invalid, 2740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 2522 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-31 21:58:28,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-01-31 21:58:28,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 349. [2022-01-31 21:58:28,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 269 states have (on average 1.1486988847583643) internal successors, (309), 274 states have internal predecessors, (309), 40 states have call successors, (40), 38 states have call predecessors, (40), 39 states have return successors, (41), 37 states have call predecessors, (41), 38 states have call successors, (41) [2022-01-31 21:58:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 390 transitions. [2022-01-31 21:58:28,875 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 390 transitions. Word has length 101 [2022-01-31 21:58:28,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:28,875 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 390 transitions. [2022-01-31 21:58:28,875 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.9473684210526314) internal successors, (75), 9 states have internal predecessors, (75), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2022-01-31 21:58:28,875 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 390 transitions. [2022-01-31 21:58:28,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-01-31 21:58:28,876 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:58:28,876 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:58:28,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2022-01-31 21:58:28,876 INFO L402 AbstractCegarLoop]: === Iteration 75 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:58:28,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:58:28,876 INFO L85 PathProgramCache]: Analyzing trace with hash -212262027, now seen corresponding path program 1 times [2022-01-31 21:58:28,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:58:28,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1471656258] [2022-01-31 21:58:28,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:58:28,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:58:28,878 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:58:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:28,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:58:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:28,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:58:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:28,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 21:58:29,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-31 21:58:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:58:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:58:29,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 21:58:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:58:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-01-31 21:58:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,131 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:58:29,131 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:58:29,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1471656258] [2022-01-31 21:58:29,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1471656258] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:58:29,132 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:58:29,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-31 21:58:29,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621110983] [2022-01-31 21:58:29,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:58:29,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-31 21:58:29,132 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:58:29,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-31 21:58:29,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2022-01-31 21:58:29,133 INFO L87 Difference]: Start difference. First operand 349 states and 390 transitions. Second operand has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (14), 11 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:58:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:58:29,701 INFO L93 Difference]: Finished difference Result 367 states and 409 transitions. [2022-01-31 21:58:29,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 21:58:29,701 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (14), 11 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:58:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:58:29,702 INFO L225 Difference]: With dead ends: 367 [2022-01-31 21:58:29,702 INFO L226 Difference]: Without dead ends: 261 [2022-01-31 21:58:29,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2022-01-31 21:58:29,703 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 59 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:58:29,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 1040 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:58:29,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-01-31 21:58:29,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 146. [2022-01-31 21:58:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 112 states have (on average 1.125) internal successors, (126), 114 states have internal predecessors, (126), 17 states have call successors, (17), 17 states have call predecessors, (17), 16 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2022-01-31 21:58:29,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 159 transitions. [2022-01-31 21:58:29,743 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 159 transitions. Word has length 101 [2022-01-31 21:58:29,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:29,743 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 159 transitions. [2022-01-31 21:58:29,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.411764705882353) internal successors, (75), 6 states have internal predecessors, (75), 3 states have call successors, (14), 11 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:58:29,744 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 159 transitions. [2022-01-31 21:58:29,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-01-31 21:58:29,744 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:58:29,744 INFO L514 BasicCegarLoop]: trace histogram [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:58:29,744 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2022-01-31 21:58:29,744 INFO L402 AbstractCegarLoop]: === Iteration 76 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:58:29,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:58:29,745 INFO L85 PathProgramCache]: Analyzing trace with hash -972922875, now seen corresponding path program 1 times [2022-01-31 21:58:29,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:58:29,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [955204128] [2022-01-31 21:58:29,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:58:29,745 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:58:29,746 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:58:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:58:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:58:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 21:58:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:58:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:58:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 21:58:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:58:29,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 21:58:29,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-01-31 21:58:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:29,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 21:58:29,909 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:58:29,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [955204128] [2022-01-31 21:58:29,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [955204128] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:58:29,909 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:58:29,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 21:58:29,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057063566] [2022-01-31 21:58:29,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:58:29,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 21:58:29,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:58:29,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 21:58:29,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-01-31 21:58:29,910 INFO L87 Difference]: Start difference. First operand 146 states and 159 transitions. Second operand has 12 states, 12 states have (on average 6.75) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 11 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-01-31 21:58:30,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:58:30,211 INFO L93 Difference]: Finished difference Result 192 states and 212 transitions. [2022-01-31 21:58:30,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 21:58:30,211 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 11 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 116 [2022-01-31 21:58:30,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:58:30,212 INFO L225 Difference]: With dead ends: 192 [2022-01-31 21:58:30,212 INFO L226 Difference]: Without dead ends: 158 [2022-01-31 21:58:30,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=107, Unknown=0, NotChecked=0, Total=182 [2022-01-31 21:58:30,212 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 147 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 21:58:30,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 422 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 21:58:30,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-01-31 21:58:30,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2022-01-31 21:58:30,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 117 states have (on average 1.1196581196581197) internal successors, (131), 119 states have internal predecessors, (131), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-01-31 21:58:30,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2022-01-31 21:58:30,255 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 116 [2022-01-31 21:58:30,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:30,255 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2022-01-31 21:58:30,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.75) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 11 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2022-01-31 21:58:30,255 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2022-01-31 21:58:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-01-31 21:58:30,256 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:58:30,256 INFO L514 BasicCegarLoop]: trace histogram [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:58:30,256 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2022-01-31 21:58:30,256 INFO L402 AbstractCegarLoop]: === Iteration 77 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:58:30,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:58:30,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1873274440, now seen corresponding path program 1 times [2022-01-31 21:58:30,257 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:58:30,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [83619384] [2022-01-31 21:58:30,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:58:30,257 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:58:30,258 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:58:30,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:30,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:58:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:30,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:58:30,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:30,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:30,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 21:58:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:30,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:30,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:58:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:30,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:30,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:30,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:30,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:58:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:30,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 21:58:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:30,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:58:30,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:30,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 21:58:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:30,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-01-31 21:58:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:30,504 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:58:30,504 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:58:30,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [83619384] [2022-01-31 21:58:30,504 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [83619384] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:58:30,505 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:58:30,505 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-01-31 21:58:30,505 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242002964] [2022-01-31 21:58:30,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:58:30,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-31 21:58:30,505 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:58:30,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-31 21:58:30,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-01-31 21:58:30,505 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 18 states, 18 states have (on average 4.5) internal successors, (81), 8 states have internal predecessors, (81), 5 states have call successors, (15), 11 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-31 21:58:31,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:58:31,282 INFO L93 Difference]: Finished difference Result 292 states and 319 transitions. [2022-01-31 21:58:31,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-31 21:58:31,283 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 8 states have internal predecessors, (81), 5 states have call successors, (15), 11 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) Word has length 116 [2022-01-31 21:58:31,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:58:31,284 INFO L225 Difference]: With dead ends: 292 [2022-01-31 21:58:31,284 INFO L226 Difference]: Without dead ends: 152 [2022-01-31 21:58:31,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=225, Invalid=1181, Unknown=0, NotChecked=0, Total=1406 [2022-01-31 21:58:31,284 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 254 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-31 21:58:31,284 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 377 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-31 21:58:31,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-01-31 21:58:31,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-01-31 21:58:31,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 117 states have (on average 1.1111111111111112) internal successors, (130), 119 states have internal predecessors, (130), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (17), 16 states have call predecessors, (17), 16 states have call successors, (17) [2022-01-31 21:58:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2022-01-31 21:58:31,345 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 116 [2022-01-31 21:58:31,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:31,345 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2022-01-31 21:58:31,345 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.5) internal successors, (81), 8 states have internal predecessors, (81), 5 states have call successors, (15), 11 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-31 21:58:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2022-01-31 21:58:31,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-01-31 21:58:31,345 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 21:58:31,345 INFO L514 BasicCegarLoop]: trace histogram [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:58:31,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2022-01-31 21:58:31,346 INFO L402 AbstractCegarLoop]: === Iteration 78 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 21:58:31,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 21:58:31,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1991715914, now seen corresponding path program 1 times [2022-01-31 21:58:31,346 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 21:58:31,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [557010874] [2022-01-31 21:58:31,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 21:58:31,347 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 21:58:31,348 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 21:58:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:31,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 21:58:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:31,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-01-31 21:58:31,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:31,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-01-31 21:58:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:31,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 21:58:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:31,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:31,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 21:58:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:31,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:31,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-01-31 21:58:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:31,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-31 21:58:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:31,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-31 21:58:31,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:31,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-31 21:58:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:31,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-31 21:58:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:31,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-01-31 21:58:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 21:58:31,645 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:58:31,645 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 21:58:31,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [557010874] [2022-01-31 21:58:31,645 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [557010874] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 21:58:31,645 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 21:58:31,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-01-31 21:58:31,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522351156] [2022-01-31 21:58:31,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 21:58:31,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-01-31 21:58:31,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 21:58:31,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-01-31 21:58:31,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-01-31 21:58:31,646 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand has 20 states, 20 states have (on average 4.05) internal successors, (81), 9 states have internal predecessors, (81), 5 states have call successors, (15), 11 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-31 21:58:32,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 21:58:32,235 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2022-01-31 21:58:32,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-31 21:58:32,236 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.05) internal successors, (81), 9 states have internal predecessors, (81), 5 states have call successors, (15), 11 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) Word has length 116 [2022-01-31 21:58:32,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 21:58:32,236 INFO L225 Difference]: With dead ends: 152 [2022-01-31 21:58:32,236 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 21:58:32,237 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2022-01-31 21:58:32,237 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 271 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-31 21:58:32,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 332 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-31 21:58:32,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 21:58:32,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 21:58:32,238 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:58:32,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 21:58:32,238 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 116 [2022-01-31 21:58:32,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 21:58:32,238 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 21:58:32,238 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.05) internal successors, (81), 9 states have internal predecessors, (81), 5 states have call successors, (15), 11 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 4 states have call successors, (13) [2022-01-31 21:58:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 21:58:32,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 21:58:32,240 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 21:58:32,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2022-01-31 21:58:32,243 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.