/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-7390193 [2022-04-05 04:10:44,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-05 04:10:44,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-05 04:10:44,690 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-05 04:10:44,690 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-05 04:10:44,691 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-05 04:10:44,693 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-05 04:10:44,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-05 04:10:44,696 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-05 04:10:44,699 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-05 04:10:44,700 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-05 04:10:44,701 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-05 04:10:44,701 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-05 04:10:44,703 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-05 04:10:44,704 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-05 04:10:44,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-05 04:10:44,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-05 04:10:44,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-05 04:10:44,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-05 04:10:44,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-05 04:10:44,715 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-05 04:10:44,716 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-05 04:10:44,717 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-05 04:10:44,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-05 04:10:44,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-05 04:10:44,723 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-05 04:10:44,723 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-05 04:10:44,724 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-05 04:10:44,724 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-05 04:10:44,724 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-05 04:10:44,725 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-05 04:10:44,726 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-05 04:10:44,727 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-05 04:10:44,727 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-05 04:10:44,728 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-05 04:10:44,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-05 04:10:44,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-05 04:10:44,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-05 04:10:44,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-05 04:10:44,729 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-05 04:10:44,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-05 04:10:44,731 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-05 04:10:44,731 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-05 04:10:44,739 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-05 04:10:44,739 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-05 04:10:44,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-05 04:10:44,741 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-05 04:10:44,741 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-05 04:10:44,741 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-05 04:10:44,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-05 04:10:44,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-05 04:10:44,741 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-05 04:10:44,742 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-05 04:10:44,742 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-05 04:10:44,742 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-05 04:10:44,742 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-05 04:10:44,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-05 04:10:44,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-05 04:10:44,742 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-05 04:10:44,743 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-05 04:10:44,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-05 04:10:44,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 04:10:44,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-05 04:10:44,743 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-05 04:10:44,744 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-05 04:10:44,744 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-04-05 04:10:44,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-05 04:10:44,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-05 04:10:44,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-05 04:10:44,960 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-05 04:10:44,960 INFO L275 PluginConnector]: CDTParser initialized [2022-04-05 04:10:44,961 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2022-04-05 04:10:45,002 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bcf145d0/164bdfcb04744350974c14363c99768c/FLAGbb79ebb1f [2022-04-05 04:10:45,386 INFO L306 CDTParser]: Found 1 translation units. [2022-04-05 04:10:45,387 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ntdrivers-simplified/diskperf_simpl1.cil.c [2022-04-05 04:10:45,395 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bcf145d0/164bdfcb04744350974c14363c99768c/FLAGbb79ebb1f [2022-04-05 04:10:45,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bcf145d0/164bdfcb04744350974c14363c99768c [2022-04-05 04:10:45,737 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-05 04:10:45,738 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-05 04:10:45,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-05 04:10:45,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-05 04:10:45,754 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-05 04:10:45,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 04:10:45" (1/1) ... [2022-04-05 04:10:45,755 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b05621d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:10:45, skipping insertion in model container [2022-04-05 04:10:45,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.04 04:10:45" (1/1) ... [2022-04-05 04:10:45,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-05 04:10:45,792 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-05 04:10:45,931 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/diskperf_simpl1.cil.c[2072,2085] [2022-04-05 04:10:46,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 04:10:46,032 INFO L203 MainTranslator]: Completed pre-run [2022-04-05 04:10:46,042 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/diskperf_simpl1.cil.c[2072,2085] [2022-04-05 04:10:46,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-05 04:10:46,097 INFO L208 MainTranslator]: Completed translation [2022-04-05 04:10:46,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:10:46 WrapperNode [2022-04-05 04:10:46,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-05 04:10:46,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-05 04:10:46,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-05 04:10:46,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-05 04:10:46,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:10:46" (1/1) ... [2022-04-05 04:10:46,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:10:46" (1/1) ... [2022-04-05 04:10:46,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:10:46" (1/1) ... [2022-04-05 04:10:46,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:10:46" (1/1) ... [2022-04-05 04:10:46,144 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:10:46" (1/1) ... [2022-04-05 04:10:46,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:10:46" (1/1) ... [2022-04-05 04:10:46,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:10:46" (1/1) ... [2022-04-05 04:10:46,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-05 04:10:46,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-05 04:10:46,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-05 04:10:46,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-05 04:10:46,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:10:46" (1/1) ... [2022-04-05 04:10:46,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-05 04:10:46,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 04:10:46,212 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-04-05 04:10:46,225 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-04-05 04:10:46,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-05 04:10:46,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-05 04:10:46,290 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-05 04:10:46,290 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-04-05 04:10:46,290 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2022-04-05 04:10:46,290 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSyncFilterWithTarget [2022-04-05 04:10:46,290 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPnp [2022-04-05 04:10:46,290 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2022-04-05 04:10:46,290 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfStartDevice [2022-04-05 04:10:46,290 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRemoveDevice [2022-04-05 04:10:46,290 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfSendToNextDriver [2022-04-05 04:10:46,290 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDispatchPower [2022-04-05 04:10:46,291 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2022-04-05 04:10:46,291 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfCreate [2022-04-05 04:10:46,291 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2022-04-05 04:10:46,291 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfDeviceControl [2022-04-05 04:10:46,291 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfShutdownFlush [2022-04-05 04:10:46,291 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfUnload [2022-04-05 04:10:46,291 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfRegisterDevice [2022-04-05 04:10:46,291 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2022-04-05 04:10:46,291 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-05 04:10:46,291 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-04-05 04:10:46,291 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-04-05 04:10:46,291 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-04-05 04:10:46,291 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-04-05 04:10:46,291 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2022-04-05 04:10:46,292 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-04-05 04:10:46,292 INFO L138 BoogieDeclarations]: Found implementation of procedure PoCallDriver [2022-04-05 04:10:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-05 04:10:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-05 04:10:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-05 04:10:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-05 04:10:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-04-05 04:10:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-05 04:10:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2022-04-05 04:10:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPnp [2022-04-05 04:10:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2022-04-05 04:10:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfStartDevice [2022-04-05 04:10:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRemoveDevice [2022-04-05 04:10:46,292 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSendToNextDriver [2022-04-05 04:10:46,293 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDispatchPower [2022-04-05 04:10:46,293 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2022-04-05 04:10:46,293 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfCreate [2022-04-05 04:10:46,293 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2022-04-05 04:10:46,293 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfDeviceControl [2022-04-05 04:10:46,293 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfShutdownFlush [2022-04-05 04:10:46,293 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfRegisterDevice [2022-04-05 04:10:46,293 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-04-05 04:10:46,293 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-04-05 04:10:46,293 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2022-04-05 04:10:46,293 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-04-05 04:10:46,293 INFO L130 BoogieDeclarations]: Found specification of procedure PoCallDriver [2022-04-05 04:10:46,293 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-04-05 04:10:46,293 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-04-05 04:10:46,293 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2022-04-05 04:10:46,294 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfSyncFilterWithTarget [2022-04-05 04:10:46,294 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfUnload [2022-04-05 04:10:46,294 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2022-04-05 04:10:46,294 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-05 04:10:46,294 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-04-05 04:10:46,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-05 04:10:46,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-05 04:10:46,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-05 04:10:46,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-05 04:10:46,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-05 04:10:46,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-05 04:10:46,521 INFO L234 CfgBuilder]: Building ICFG [2022-04-05 04:10:46,523 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-05 04:10:46,594 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:10:46,784 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-04-05 04:10:46,785 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-04-05 04:10:46,795 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:10:46,822 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume !false; [2022-04-05 04:10:46,822 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##17: assume false; [2022-04-05 04:10:46,834 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:10:46,844 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-04-05 04:10:46,844 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-04-05 04:10:46,847 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:10:46,866 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-04-05 04:10:46,867 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-04-05 04:10:47,050 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:10:47,073 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-04-05 04:10:47,073 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-04-05 04:10:47,135 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-04-05 04:10:47,147 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##6: assume !false; [2022-04-05 04:10:47,147 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume false; [2022-04-05 04:10:47,180 INFO L275 CfgBuilder]: Performing block encoding [2022-04-05 04:10:47,217 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-05 04:10:47,217 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-05 04:10:47,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 04:10:47 BoogieIcfgContainer [2022-04-05 04:10:47,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-05 04:10:47,221 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-05 04:10:47,222 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-05 04:10:47,223 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-05 04:10:47,225 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 04:10:47" (1/1) ... [2022-04-05 04:10:47,227 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-05 04:10:47,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 04:10:47 BasicIcfg [2022-04-05 04:10:47,273 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-05 04:10:47,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-05 04:10:47,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-05 04:10:47,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-05 04:10:47,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.04 04:10:45" (1/4) ... [2022-04-05 04:10:47,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5004fe2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 04:10:47, skipping insertion in model container [2022-04-05 04:10:47,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.04 04:10:46" (2/4) ... [2022-04-05 04:10:47,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5004fe2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.04 04:10:47, skipping insertion in model container [2022-04-05 04:10:47,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.04 04:10:47" (3/4) ... [2022-04-05 04:10:47,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5004fe2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 04:10:47, skipping insertion in model container [2022-04-05 04:10:47,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 05.04 04:10:47" (4/4) ... [2022-04-05 04:10:47,284 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.cJordan [2022-04-05 04:10:47,287 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-05 04:10:47,288 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-05 04:10:47,339 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-05 04:10:47,345 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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 [2022-04-05 04:10:47,346 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-05 04:10:47,373 INFO L276 IsEmpty]: Start isEmpty. Operand has 295 states, 206 states have (on average 1.4271844660194175) internal successors, (294), 224 states have internal predecessors, (294), 61 states have call successors, (61), 26 states have call predecessors, (61), 26 states have return successors, (61), 57 states have call predecessors, (61), 61 states have call successors, (61) [2022-04-05 04:10:47,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-05 04:10:47,387 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:10:47,388 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:10:47,388 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:10:47,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:10:47,396 INFO L85 PathProgramCache]: Analyzing trace with hash 13220813, now seen corresponding path program 1 times [2022-04-05 04:10:47,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:10:47,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019221610] [2022-04-05 04:10:47,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:10:47,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:10:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:47,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:10:47,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:47,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:10:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:10:47,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:10:47,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019221610] [2022-04-05 04:10:47,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019221610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:10:47,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:10:47,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-05 04:10:47,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795459926] [2022-04-05 04:10:47,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:10:47,761 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-05 04:10:47,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:10:47,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-05 04:10:47,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-05 04:10:47,785 INFO L87 Difference]: Start difference. First operand has 295 states, 206 states have (on average 1.4271844660194175) internal successors, (294), 224 states have internal predecessors, (294), 61 states have call successors, (61), 26 states have call predecessors, (61), 26 states have return successors, (61), 57 states have call predecessors, (61), 61 states have call successors, (61) 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-04-05 04:10:48,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:10:48,415 INFO L93 Difference]: Finished difference Result 342 states and 472 transitions. [2022-04-05 04:10:48,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 04:10:48,417 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-04-05 04:10:48,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:10:48,425 INFO L225 Difference]: With dead ends: 342 [2022-04-05 04:10:48,425 INFO L226 Difference]: Without dead ends: 326 [2022-04-05 04:10:48,426 INFO L912 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-04-05 04:10:48,428 INFO L913 BasicCegarLoop]: 355 mSDtfsCounter, 234 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-05 04:10:48,429 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 597 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-05 04:10:48,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-04-05 04:10:48,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 287. [2022-04-05 04:10:48,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 201 states have (on average 1.373134328358209) internal successors, (276), 217 states have internal predecessors, (276), 61 states have call successors, (61), 26 states have call predecessors, (61), 24 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-05 04:10:48,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 383 transitions. [2022-04-05 04:10:48,467 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 383 transitions. Word has length 20 [2022-04-05 04:10:48,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:10:48,467 INFO L478 AbstractCegarLoop]: Abstraction has 287 states and 383 transitions. [2022-04-05 04:10:48,467 INFO L479 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-04-05 04:10:48,467 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 383 transitions. [2022-04-05 04:10:48,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-05 04:10:48,468 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:10:48,468 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:10:48,468 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-05 04:10:48,469 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:10:48,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:10:48,469 INFO L85 PathProgramCache]: Analyzing trace with hash 690648180, now seen corresponding path program 1 times [2022-04-05 04:10:48,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:10:48,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210827111] [2022-04-05 04:10:48,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:10:48,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:10:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:48,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:10:48,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:48,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:10:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:48,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:10:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:48,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:10:48,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:10:48,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210827111] [2022-04-05 04:10:48,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210827111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:10:48,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:10:48,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 04:10:48,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810711428] [2022-04-05 04:10:48,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:10:48,618 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 04:10:48,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:10:48,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 04:10:48,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-05 04:10:48,619 INFO L87 Difference]: Start difference. First operand 287 states and 383 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-05 04:10:49,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:10:49,809 INFO L93 Difference]: Finished difference Result 508 states and 702 transitions. [2022-04-05 04:10:49,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 04:10:49,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2022-04-05 04:10:49,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:10:49,812 INFO L225 Difference]: With dead ends: 508 [2022-04-05 04:10:49,812 INFO L226 Difference]: Without dead ends: 507 [2022-04-05 04:10:49,813 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-04-05 04:10:49,813 INFO L913 BasicCegarLoop]: 490 mSDtfsCounter, 428 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-05 04:10:49,814 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 716 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-05 04:10:49,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-04-05 04:10:49,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 440. [2022-04-05 04:10:49,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 318 states have (on average 1.3459119496855345) internal successors, (428), 329 states have internal predecessors, (428), 80 states have call successors, (80), 37 states have call predecessors, (80), 41 states have return successors, (100), 77 states have call predecessors, (100), 68 states have call successors, (100) [2022-04-05 04:10:49,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 608 transitions. [2022-04-05 04:10:49,836 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 608 transitions. Word has length 25 [2022-04-05 04:10:49,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:10:49,836 INFO L478 AbstractCegarLoop]: Abstraction has 440 states and 608 transitions. [2022-04-05 04:10:49,836 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-05 04:10:49,836 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 608 transitions. [2022-04-05 04:10:49,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-05 04:10:49,837 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:10:49,837 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:10:49,838 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-05 04:10:49,838 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:10:49,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:10:49,838 INFO L85 PathProgramCache]: Analyzing trace with hash 543429165, now seen corresponding path program 1 times [2022-04-05 04:10:49,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:10:49,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245942370] [2022-04-05 04:10:49,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:10:49,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:10:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:49,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:10:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:49,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:10:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:49,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:10:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:49,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:10:49,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:10:49,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245942370] [2022-04-05 04:10:49,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245942370] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:10:49,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:10:49,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 04:10:49,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779382920] [2022-04-05 04:10:49,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:10:49,967 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 04:10:49,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:10:49,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 04:10:49,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-05 04:10:49,968 INFO L87 Difference]: Start difference. First operand 440 states and 608 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (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-04-05 04:10:50,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:10:50,699 INFO L93 Difference]: Finished difference Result 690 states and 979 transitions. [2022-04-05 04:10:50,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 04:10:50,699 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (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 31 [2022-04-05 04:10:50,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:10:50,706 INFO L225 Difference]: With dead ends: 690 [2022-04-05 04:10:50,706 INFO L226 Difference]: Without dead ends: 690 [2022-04-05 04:10:50,707 INFO L912 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-04-05 04:10:50,710 INFO L913 BasicCegarLoop]: 402 mSDtfsCounter, 501 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-05 04:10:50,712 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [503 Valid, 610 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-05 04:10:50,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2022-04-05 04:10:50,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 618. [2022-04-05 04:10:50,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 455 states have (on average 1.3560439560439561) internal successors, (617), 466 states have internal predecessors, (617), 109 states have call successors, (109), 49 states have call predecessors, (109), 53 states have return successors, (162), 105 states have call predecessors, (162), 98 states have call successors, (162) [2022-04-05 04:10:50,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 888 transitions. [2022-04-05 04:10:50,748 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 888 transitions. Word has length 31 [2022-04-05 04:10:50,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:10:50,748 INFO L478 AbstractCegarLoop]: Abstraction has 618 states and 888 transitions. [2022-04-05 04:10:50,748 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 3 states have internal predecessors, (20), 3 states have call successors, (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-04-05 04:10:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 888 transitions. [2022-04-05 04:10:50,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-05 04:10:50,754 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:10:50,754 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:10:50,754 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-05 04:10:50,755 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:10:50,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:10:50,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1394943520, now seen corresponding path program 1 times [2022-04-05 04:10:50,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:10:50,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114515050] [2022-04-05 04:10:50,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:10:50,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:10:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:50,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:10:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:50,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:10:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:50,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:10:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:10:50,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:10:50,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114515050] [2022-04-05 04:10:50,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114515050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:10:50,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:10:50,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 04:10:50,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627145730] [2022-04-05 04:10:50,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:10:50,888 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 04:10:50,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:10:50,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 04:10:50,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-05 04:10:50,889 INFO L87 Difference]: Start difference. First operand 618 states and 888 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-05 04:10:51,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:10:51,428 INFO L93 Difference]: Finished difference Result 661 states and 947 transitions. [2022-04-05 04:10:51,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 04:10:51,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-04-05 04:10:51,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:10:51,430 INFO L225 Difference]: With dead ends: 661 [2022-04-05 04:10:51,430 INFO L226 Difference]: Without dead ends: 661 [2022-04-05 04:10:51,431 INFO L912 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-04-05 04:10:51,431 INFO L913 BasicCegarLoop]: 340 mSDtfsCounter, 224 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-05 04:10:51,431 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 589 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-05 04:10:51,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-04-05 04:10:51,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 628. [2022-04-05 04:10:51,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 466 states have (on average 1.354077253218884) internal successors, (631), 475 states have internal predecessors, (631), 108 states have call successors, (108), 50 states have call predecessors, (108), 53 states have return successors, (162), 105 states have call predecessors, (162), 98 states have call successors, (162) [2022-04-05 04:10:51,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 901 transitions. [2022-04-05 04:10:51,447 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 901 transitions. Word has length 36 [2022-04-05 04:10:51,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:10:51,447 INFO L478 AbstractCegarLoop]: Abstraction has 628 states and 901 transitions. [2022-04-05 04:10:51,447 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 3 states have internal predecessors, (26), 3 states have call successors, (7), 6 states have call predecessors, (7), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-05 04:10:51,447 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 901 transitions. [2022-04-05 04:10:51,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-05 04:10:51,448 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:10:51,448 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:10:51,448 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-05 04:10:51,448 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:10:51,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:10:51,448 INFO L85 PathProgramCache]: Analyzing trace with hash -455202915, now seen corresponding path program 1 times [2022-04-05 04:10:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:10:51,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128316173] [2022-04-05 04:10:51,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:10:51,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:10:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:51,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:10:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:51,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:10:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:51,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:10:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:51,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-05 04:10:51,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:51,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:10:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:51,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:10:51,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:10:51,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128316173] [2022-04-05 04:10:51,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128316173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:10:51,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:10:51,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-05 04:10:51,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073441478] [2022-04-05 04:10:51,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:10:51,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 04:10:51,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:10:51,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 04:10:51,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-05 04:10:51,548 INFO L87 Difference]: Start difference. First operand 628 states and 901 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-05 04:10:51,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:10:51,936 INFO L93 Difference]: Finished difference Result 705 states and 1001 transitions. [2022-04-05 04:10:51,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 04:10:51,936 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 39 [2022-04-05 04:10:51,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:10:51,939 INFO L225 Difference]: With dead ends: 705 [2022-04-05 04:10:51,939 INFO L226 Difference]: Without dead ends: 705 [2022-04-05 04:10:51,939 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-05 04:10:51,939 INFO L913 BasicCegarLoop]: 320 mSDtfsCounter, 415 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-05 04:10:51,940 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [416 Valid, 621 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-05 04:10:51,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-04-05 04:10:51,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2022-04-05 04:10:51,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 488 states have (on average 1.3504098360655739) internal successors, (659), 502 states have internal predecessors, (659), 109 states have call successors, (109), 51 states have call predecessors, (109), 60 states have return successors, (169), 108 states have call predecessors, (169), 99 states have call successors, (169) [2022-04-05 04:10:51,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 937 transitions. [2022-04-05 04:10:51,954 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 937 transitions. Word has length 39 [2022-04-05 04:10:51,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:10:51,955 INFO L478 AbstractCegarLoop]: Abstraction has 658 states and 937 transitions. [2022-04-05 04:10:51,955 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-05 04:10:51,955 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 937 transitions. [2022-04-05 04:10:51,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-05 04:10:51,955 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:10:51,955 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:10:51,955 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-05 04:10:51,956 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:10:51,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:10:51,956 INFO L85 PathProgramCache]: Analyzing trace with hash -454217859, now seen corresponding path program 1 times [2022-04-05 04:10:51,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:10:51,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35021421] [2022-04-05 04:10:51,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:10:51,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:10:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:52,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:10:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:52,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:10:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:52,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:10:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:52,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-05 04:10:52,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:52,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:10:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:52,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-04-05 04:10:52,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:10:52,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35021421] [2022-04-05 04:10:52,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35021421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:10:52,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:10:52,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 04:10:52,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199836277] [2022-04-05 04:10:52,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:10:52,117 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 04:10:52,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:10:52,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 04:10:52,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:10:52,117 INFO L87 Difference]: Start difference. First operand 658 states and 937 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-05 04:10:53,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:10:53,125 INFO L93 Difference]: Finished difference Result 705 states and 1000 transitions. [2022-04-05 04:10:53,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-05 04:10:53,125 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-05 04:10:53,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:10:53,128 INFO L225 Difference]: With dead ends: 705 [2022-04-05 04:10:53,128 INFO L226 Difference]: Without dead ends: 705 [2022-04-05 04:10:53,128 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-04-05 04:10:53,130 INFO L913 BasicCegarLoop]: 302 mSDtfsCounter, 559 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-05 04:10:53,131 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [568 Valid, 760 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-05 04:10:53,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-04-05 04:10:53,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2022-04-05 04:10:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 488 states have (on average 1.348360655737705) internal successors, (658), 502 states have internal predecessors, (658), 109 states have call successors, (109), 51 states have call predecessors, (109), 60 states have return successors, (169), 108 states have call predecessors, (169), 99 states have call successors, (169) [2022-04-05 04:10:53,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 936 transitions. [2022-04-05 04:10:53,146 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 936 transitions. Word has length 39 [2022-04-05 04:10:53,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:10:53,147 INFO L478 AbstractCegarLoop]: Abstraction has 658 states and 936 transitions. [2022-04-05 04:10:53,147 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-05 04:10:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 936 transitions. [2022-04-05 04:10:53,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-05 04:10:53,147 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:10:53,147 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:10:53,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-05 04:10:53,148 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:10:53,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:10:53,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1225775968, now seen corresponding path program 1 times [2022-04-05 04:10:53,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:10:53,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583557248] [2022-04-05 04:10:53,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:10:53,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:10:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:53,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:10:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:53,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:10:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:53,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:10:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:53,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-05 04:10:53,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:53,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:10:53,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:53,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:10:53,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:10:53,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583557248] [2022-04-05 04:10:53,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583557248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:10:53,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:10:53,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 04:10:53,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287673211] [2022-04-05 04:10:53,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:10:53,327 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 04:10:53,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:10:53,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 04:10:53,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:10:53,327 INFO L87 Difference]: Start difference. First operand 658 states and 936 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-05 04:10:54,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:10:54,389 INFO L93 Difference]: Finished difference Result 705 states and 999 transitions. [2022-04-05 04:10:54,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-05 04:10:54,389 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 40 [2022-04-05 04:10:54,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:10:54,392 INFO L225 Difference]: With dead ends: 705 [2022-04-05 04:10:54,392 INFO L226 Difference]: Without dead ends: 705 [2022-04-05 04:10:54,392 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-04-05 04:10:54,394 INFO L913 BasicCegarLoop]: 303 mSDtfsCounter, 1133 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-05 04:10:54,394 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1142 Valid, 865 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-05 04:10:54,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2022-04-05 04:10:54,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 658. [2022-04-05 04:10:54,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 488 states have (on average 1.346311475409836) internal successors, (657), 502 states have internal predecessors, (657), 109 states have call successors, (109), 51 states have call predecessors, (109), 60 states have return successors, (169), 108 states have call predecessors, (169), 99 states have call successors, (169) [2022-04-05 04:10:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 935 transitions. [2022-04-05 04:10:54,408 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 935 transitions. Word has length 40 [2022-04-05 04:10:54,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:10:54,408 INFO L478 AbstractCegarLoop]: Abstraction has 658 states and 935 transitions. [2022-04-05 04:10:54,408 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-05 04:10:54,408 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 935 transitions. [2022-04-05 04:10:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-05 04:10:54,409 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:10:54,409 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:10:54,410 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-05 04:10:54,410 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:10:54,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:10:54,410 INFO L85 PathProgramCache]: Analyzing trace with hash 636808681, now seen corresponding path program 1 times [2022-04-05 04:10:54,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:10:54,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442253398] [2022-04-05 04:10:54,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:10:54,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:10:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:54,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:10:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:54,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:10:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:54,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:10:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:54,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-05 04:10:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:54,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:10:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:54,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-04-05 04:10:54,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:10:54,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442253398] [2022-04-05 04:10:54,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442253398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:10:54,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:10:54,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-05 04:10:54,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579185418] [2022-04-05 04:10:54,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:10:54,530 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 04:10:54,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:10:54,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 04:10:54,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-05 04:10:54,530 INFO L87 Difference]: Start difference. First operand 658 states and 935 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-05 04:10:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:10:55,061 INFO L93 Difference]: Finished difference Result 1186 states and 1741 transitions. [2022-04-05 04:10:55,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 04:10:55,061 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 41 [2022-04-05 04:10:55,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:10:55,066 INFO L225 Difference]: With dead ends: 1186 [2022-04-05 04:10:55,066 INFO L226 Difference]: Without dead ends: 1186 [2022-04-05 04:10:55,066 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-05 04:10:55,067 INFO L913 BasicCegarLoop]: 392 mSDtfsCounter, 749 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-05 04:10:55,067 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [754 Valid, 719 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-05 04:10:55,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2022-04-05 04:10:55,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1085. [2022-04-05 04:10:55,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 817 states have (on average 1.3635250917992656) internal successors, (1114), 835 states have internal predecessors, (1114), 173 states have call successors, (173), 79 states have call predecessors, (173), 94 states have return successors, (315), 175 states have call predecessors, (315), 163 states have call successors, (315) [2022-04-05 04:10:55,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1602 transitions. [2022-04-05 04:10:55,090 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1602 transitions. Word has length 41 [2022-04-05 04:10:55,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:10:55,092 INFO L478 AbstractCegarLoop]: Abstraction has 1085 states and 1602 transitions. [2022-04-05 04:10:55,092 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 3 states have internal predecessors, (29), 2 states have call successors, (7), 7 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-05 04:10:55,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1602 transitions. [2022-04-05 04:10:55,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-05 04:10:55,093 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:10:55,093 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:10:55,093 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-05 04:10:55,093 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:10:55,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:10:55,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1732782333, now seen corresponding path program 1 times [2022-04-05 04:10:55,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:10:55,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793147767] [2022-04-05 04:10:55,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:10:55,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:10:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:55,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:10:55,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:55,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:10:55,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:55,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:10:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:55,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-04-05 04:10:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:55,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:10:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:10:55,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:10:55,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793147767] [2022-04-05 04:10:55,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793147767] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:10:55,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:10:55,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-05 04:10:55,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590713904] [2022-04-05 04:10:55,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:10:55,232 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-05 04:10:55,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:10:55,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-05 04:10:55,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-05 04:10:55,232 INFO L87 Difference]: Start difference. First operand 1085 states and 1602 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-05 04:10:56,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:10:56,139 INFO L93 Difference]: Finished difference Result 1167 states and 1721 transitions. [2022-04-05 04:10:56,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 04:10:56,139 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 42 [2022-04-05 04:10:56,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:10:56,144 INFO L225 Difference]: With dead ends: 1167 [2022-04-05 04:10:56,144 INFO L226 Difference]: Without dead ends: 1148 [2022-04-05 04:10:56,144 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-05 04:10:56,145 INFO L913 BasicCegarLoop]: 327 mSDtfsCounter, 133 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 1562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-05 04:10:56,146 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [134 Valid, 1133 Invalid, 1562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-05 04:10:56,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2022-04-05 04:10:56,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1078. [2022-04-05 04:10:56,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 813 states have (on average 1.3640836408364083) internal successors, (1109), 831 states have internal predecessors, (1109), 171 states have call successors, (171), 78 states have call predecessors, (171), 93 states have return successors, (313), 173 states have call predecessors, (313), 161 states have call successors, (313) [2022-04-05 04:10:56,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1593 transitions. [2022-04-05 04:10:56,168 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1593 transitions. Word has length 42 [2022-04-05 04:10:56,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:10:56,169 INFO L478 AbstractCegarLoop]: Abstraction has 1078 states and 1593 transitions. [2022-04-05 04:10:56,169 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 4 states have internal predecessors, (30), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-05 04:10:56,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1593 transitions. [2022-04-05 04:10:56,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-05 04:10:56,169 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:10:56,169 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:10:56,170 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-05 04:10:56,170 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:10:56,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:10:56,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1415168827, now seen corresponding path program 1 times [2022-04-05 04:10:56,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:10:56,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228078365] [2022-04-05 04:10:56,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:10:56,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:10:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:56,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:10:56,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:56,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:10:56,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:56,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:10:56,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:56,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:10:56,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:10:56,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228078365] [2022-04-05 04:10:56,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228078365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:10:56,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:10:56,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-05 04:10:56,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005538443] [2022-04-05 04:10:56,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:10:56,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 04:10:56,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:10:56,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 04:10:56,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-05 04:10:56,260 INFO L87 Difference]: Start difference. First operand 1078 states and 1593 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 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-04-05 04:10:56,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:10:56,580 INFO L93 Difference]: Finished difference Result 599 states and 851 transitions. [2022-04-05 04:10:56,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 04:10:56,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 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 45 [2022-04-05 04:10:56,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:10:56,583 INFO L225 Difference]: With dead ends: 599 [2022-04-05 04:10:56,583 INFO L226 Difference]: Without dead ends: 599 [2022-04-05 04:10:56,583 INFO L912 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-04-05 04:10:56,583 INFO L913 BasicCegarLoop]: 281 mSDtfsCounter, 446 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-05 04:10:56,584 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [448 Valid, 311 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-05 04:10:56,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-04-05 04:10:56,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 598. [2022-04-05 04:10:56,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 443 states have (on average 1.327313769751693) internal successors, (588), 455 states have internal predecessors, (588), 102 states have call successors, (102), 47 states have call predecessors, (102), 52 states have return successors, (160), 98 states have call predecessors, (160), 94 states have call successors, (160) [2022-04-05 04:10:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 850 transitions. [2022-04-05 04:10:56,596 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 850 transitions. Word has length 45 [2022-04-05 04:10:56,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:10:56,596 INFO L478 AbstractCegarLoop]: Abstraction has 598 states and 850 transitions. [2022-04-05 04:10:56,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 3 states have internal predecessors, (32), 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-04-05 04:10:56,596 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 850 transitions. [2022-04-05 04:10:56,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-05 04:10:56,596 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:10:56,596 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:10:56,597 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-05 04:10:56,597 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:10:56,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:10:56,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1870236117, now seen corresponding path program 1 times [2022-04-05 04:10:56,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:10:56,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935132192] [2022-04-05 04:10:56,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:10:56,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:10:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:56,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:10:56,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:56,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:10:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:56,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:10:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:56,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-05 04:10:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:56,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:10:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:10:56,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:10:56,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935132192] [2022-04-05 04:10:56,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935132192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:10:56,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:10:56,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-05 04:10:56,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506180151] [2022-04-05 04:10:56,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:10:56,749 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-05 04:10:56,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:10:56,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-05 04:10:56,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-05 04:10:56,750 INFO L87 Difference]: Start difference. First operand 598 states and 850 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-05 04:10:57,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:10:57,537 INFO L93 Difference]: Finished difference Result 630 states and 890 transitions. [2022-04-05 04:10:57,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 04:10:57,538 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-04-05 04:10:57,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:10:57,540 INFO L225 Difference]: With dead ends: 630 [2022-04-05 04:10:57,540 INFO L226 Difference]: Without dead ends: 608 [2022-04-05 04:10:57,540 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-05 04:10:57,541 INFO L913 BasicCegarLoop]: 293 mSDtfsCounter, 112 mSDsluCounter, 913 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-05 04:10:57,541 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 1206 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1337 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-05 04:10:57,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2022-04-05 04:10:57,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 596. [2022-04-05 04:10:57,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 442 states have (on average 1.3235294117647058) internal successors, (585), 454 states have internal predecessors, (585), 101 states have call successors, (101), 47 states have call predecessors, (101), 52 states have return successors, (159), 97 states have call predecessors, (159), 93 states have call successors, (159) [2022-04-05 04:10:57,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 845 transitions. [2022-04-05 04:10:57,552 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 845 transitions. Word has length 46 [2022-04-05 04:10:57,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:10:57,552 INFO L478 AbstractCegarLoop]: Abstraction has 596 states and 845 transitions. [2022-04-05 04:10:57,552 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 5 states have internal predecessors, (34), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-05 04:10:57,552 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 845 transitions. [2022-04-05 04:10:57,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-05 04:10:57,553 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:10:57,553 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:10:57,553 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-05 04:10:57,553 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:10:57,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:10:57,553 INFO L85 PathProgramCache]: Analyzing trace with hash -961233056, now seen corresponding path program 1 times [2022-04-05 04:10:57,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:10:57,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350654694] [2022-04-05 04:10:57,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:10:57,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:10:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:57,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:10:57,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:57,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:10:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:57,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:10:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:57,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-05 04:10:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:57,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:10:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:57,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:10:57,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:10:57,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350654694] [2022-04-05 04:10:57,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350654694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:10:57,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:10:57,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-05 04:10:57,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013869548] [2022-04-05 04:10:57,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:10:57,672 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 04:10:57,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:10:57,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 04:10:57,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-05 04:10:57,672 INFO L87 Difference]: Start difference. First operand 596 states and 845 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-05 04:10:58,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:10:58,158 INFO L93 Difference]: Finished difference Result 826 states and 1225 transitions. [2022-04-05 04:10:58,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-05 04:10:58,158 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2022-04-05 04:10:58,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:10:58,161 INFO L225 Difference]: With dead ends: 826 [2022-04-05 04:10:58,161 INFO L226 Difference]: Without dead ends: 826 [2022-04-05 04:10:58,162 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-05 04:10:58,162 INFO L913 BasicCegarLoop]: 324 mSDtfsCounter, 520 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-05 04:10:58,162 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [525 Valid, 636 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-05 04:10:58,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2022-04-05 04:10:58,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 665. [2022-04-05 04:10:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 495 states have (on average 1.3232323232323233) internal successors, (655), 508 states have internal predecessors, (655), 109 states have call successors, (109), 50 states have call predecessors, (109), 60 states have return successors, (184), 110 states have call predecessors, (184), 101 states have call successors, (184) [2022-04-05 04:10:58,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 948 transitions. [2022-04-05 04:10:58,178 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 948 transitions. Word has length 46 [2022-04-05 04:10:58,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:10:58,178 INFO L478 AbstractCegarLoop]: Abstraction has 665 states and 948 transitions. [2022-04-05 04:10:58,178 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-05 04:10:58,178 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 948 transitions. [2022-04-05 04:10:58,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-05 04:10:58,179 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:10:58,179 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:10:58,179 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-05 04:10:58,179 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:10:58,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:10:58,180 INFO L85 PathProgramCache]: Analyzing trace with hash -91170375, now seen corresponding path program 1 times [2022-04-05 04:10:58,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:10:58,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013605592] [2022-04-05 04:10:58,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:10:58,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:10:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:58,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:10:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:58,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:10:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:58,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:10:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:58,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-05 04:10:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:58,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-04-05 04:10:58,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:10:58,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013605592] [2022-04-05 04:10:58,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013605592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:10:58,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:10:58,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-05 04:10:58,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441524260] [2022-04-05 04:10:58,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:10:58,294 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 04:10:58,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:10:58,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 04:10:58,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-04-05 04:10:58,295 INFO L87 Difference]: Start difference. First operand 665 states and 948 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-05 04:10:58,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:10:58,932 INFO L93 Difference]: Finished difference Result 462 states and 599 transitions. [2022-04-05 04:10:58,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 04:10:58,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 49 [2022-04-05 04:10:58,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:10:58,934 INFO L225 Difference]: With dead ends: 462 [2022-04-05 04:10:58,935 INFO L226 Difference]: Without dead ends: 462 [2022-04-05 04:10:58,935 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:10:58,935 INFO L913 BasicCegarLoop]: 314 mSDtfsCounter, 471 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-05 04:10:58,935 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [478 Valid, 677 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 767 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-05 04:10:58,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-04-05 04:10:58,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 441. [2022-04-05 04:10:58,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 327 states have (on average 1.27217125382263) internal successors, (416), 338 states have internal predecessors, (416), 69 states have call successors, (69), 38 states have call predecessors, (69), 44 states have return successors, (93), 68 states have call predecessors, (93), 61 states have call successors, (93) [2022-04-05 04:10:58,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 578 transitions. [2022-04-05 04:10:58,942 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 578 transitions. Word has length 49 [2022-04-05 04:10:58,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:10:58,943 INFO L478 AbstractCegarLoop]: Abstraction has 441 states and 578 transitions. [2022-04-05 04:10:58,943 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 4 states have internal predecessors, (35), 3 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-05 04:10:58,943 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 578 transitions. [2022-04-05 04:10:58,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-05 04:10:58,943 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:10:58,943 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:10:58,944 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-05 04:10:58,944 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:10:58,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:10:58,944 INFO L85 PathProgramCache]: Analyzing trace with hash 298099852, now seen corresponding path program 1 times [2022-04-05 04:10:58,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:10:58,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372903351] [2022-04-05 04:10:58,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:10:58,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:10:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:58,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:10:58,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:59,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:10:59,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:59,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:10:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:59,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-05 04:10:59,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:59,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:10:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:59,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:10:59,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:10:59,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372903351] [2022-04-05 04:10:59,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372903351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:10:59,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:10:59,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-05 04:10:59,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568250404] [2022-04-05 04:10:59,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:10:59,091 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-05 04:10:59,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:10:59,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-05 04:10:59,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-05 04:10:59,092 INFO L87 Difference]: Start difference. First operand 441 states and 578 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-05 04:10:59,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:10:59,848 INFO L93 Difference]: Finished difference Result 454 states and 594 transitions. [2022-04-05 04:10:59,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-05 04:10:59,848 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-04-05 04:10:59,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:10:59,850 INFO L225 Difference]: With dead ends: 454 [2022-04-05 04:10:59,850 INFO L226 Difference]: Without dead ends: 453 [2022-04-05 04:10:59,850 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-05 04:10:59,850 INFO L913 BasicCegarLoop]: 284 mSDtfsCounter, 235 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 1628 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 1488 SdHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-05 04:10:59,851 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 1488 Invalid, 1781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1628 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-05 04:10:59,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2022-04-05 04:10:59,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 449. [2022-04-05 04:10:59,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 334 states have (on average 1.2724550898203593) internal successors, (425), 346 states have internal predecessors, (425), 70 states have call successors, (70), 38 states have call predecessors, (70), 44 states have return successors, (94), 69 states have call predecessors, (94), 62 states have call successors, (94) [2022-04-05 04:10:59,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 589 transitions. [2022-04-05 04:10:59,857 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 589 transitions. Word has length 47 [2022-04-05 04:10:59,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:10:59,858 INFO L478 AbstractCegarLoop]: Abstraction has 449 states and 589 transitions. [2022-04-05 04:10:59,858 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-05 04:10:59,858 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 589 transitions. [2022-04-05 04:10:59,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-05 04:10:59,858 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:10:59,858 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:10:59,858 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-05 04:10:59,858 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:10:59,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:10:59,859 INFO L85 PathProgramCache]: Analyzing trace with hash 298068108, now seen corresponding path program 1 times [2022-04-05 04:10:59,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:10:59,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343829547] [2022-04-05 04:10:59,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:10:59,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:10:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:59,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:10:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:59,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:10:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:59,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:10:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:10:59,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-05 04:10:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:00,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:11:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:00,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:00,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343829547] [2022-04-05 04:11:00,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343829547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:00,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:00,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-05 04:11:00,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444391877] [2022-04-05 04:11:00,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:00,037 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-05 04:11:00,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:00,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-05 04:11:00,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-04-05 04:11:00,038 INFO L87 Difference]: Start difference. First operand 449 states and 589 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-05 04:11:00,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:00,608 INFO L93 Difference]: Finished difference Result 487 states and 652 transitions. [2022-04-05 04:11:00,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-05 04:11:00,608 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 47 [2022-04-05 04:11:00,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:00,610 INFO L225 Difference]: With dead ends: 487 [2022-04-05 04:11:00,610 INFO L226 Difference]: Without dead ends: 472 [2022-04-05 04:11:00,611 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-04-05 04:11:00,612 INFO L913 BasicCegarLoop]: 286 mSDtfsCounter, 338 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 1470 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:00,612 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [339 Valid, 1470 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-05 04:11:00,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-04-05 04:11:00,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 459. [2022-04-05 04:11:00,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 343 states have (on average 1.2769679300291545) internal successors, (438), 356 states have internal predecessors, (438), 70 states have call successors, (70), 38 states have call predecessors, (70), 45 states have return successors, (96), 69 states have call predecessors, (96), 62 states have call successors, (96) [2022-04-05 04:11:00,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 604 transitions. [2022-04-05 04:11:00,620 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 604 transitions. Word has length 47 [2022-04-05 04:11:00,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:00,620 INFO L478 AbstractCegarLoop]: Abstraction has 459 states and 604 transitions. [2022-04-05 04:11:00,620 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 6 states have internal predecessors, (35), 2 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-05 04:11:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 604 transitions. [2022-04-05 04:11:00,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-05 04:11:00,621 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:00,621 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:00,621 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-05 04:11:00,621 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:00,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:00,622 INFO L85 PathProgramCache]: Analyzing trace with hash -309998534, now seen corresponding path program 1 times [2022-04-05 04:11:00,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:00,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058365144] [2022-04-05 04:11:00,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:00,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:00,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:00,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:00,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:00,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-05 04:11:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:00,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:11:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:00,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:00,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058365144] [2022-04-05 04:11:00,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058365144] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:00,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:00,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-05 04:11:00,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460537254] [2022-04-05 04:11:00,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:00,781 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-05 04:11:00,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:00,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-05 04:11:00,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-04-05 04:11:00,781 INFO L87 Difference]: Start difference. First operand 459 states and 604 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-05 04:11:01,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:01,915 INFO L93 Difference]: Finished difference Result 590 states and 807 transitions. [2022-04-05 04:11:01,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-05 04:11:01,915 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2022-04-05 04:11:01,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:01,917 INFO L225 Difference]: With dead ends: 590 [2022-04-05 04:11:01,917 INFO L226 Difference]: Without dead ends: 575 [2022-04-05 04:11:01,918 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2022-04-05 04:11:01,918 INFO L913 BasicCegarLoop]: 317 mSDtfsCounter, 846 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:01,918 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [860 Valid, 801 Invalid, 1769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-05 04:11:01,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2022-04-05 04:11:01,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 444. [2022-04-05 04:11:01,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 332 states have (on average 1.2771084337349397) internal successors, (424), 343 states have internal predecessors, (424), 68 states have call successors, (68), 38 states have call predecessors, (68), 43 states have return successors, (91), 66 states have call predecessors, (91), 60 states have call successors, (91) [2022-04-05 04:11:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 583 transitions. [2022-04-05 04:11:01,950 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 583 transitions. Word has length 48 [2022-04-05 04:11:01,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:01,950 INFO L478 AbstractCegarLoop]: Abstraction has 444 states and 583 transitions. [2022-04-05 04:11:01,950 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (7), 7 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-05 04:11:01,950 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 583 transitions. [2022-04-05 04:11:01,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-05 04:11:01,950 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:01,951 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:01,951 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-05 04:11:01,951 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:01,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:01,951 INFO L85 PathProgramCache]: Analyzing trace with hash 328516868, now seen corresponding path program 1 times [2022-04-05 04:11:01,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:01,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573625583] [2022-04-05 04:11:01,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:01,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:02,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:02,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:02,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:02,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-05 04:11:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:02,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:02,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:02,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:02,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573625583] [2022-04-05 04:11:02,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573625583] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:02,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:02,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 04:11:02,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183703154] [2022-04-05 04:11:02,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:02,088 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 04:11:02,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:02,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 04:11:02,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:11:02,088 INFO L87 Difference]: Start difference. First operand 444 states and 583 transitions. Second operand has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 6 states have internal predecessors, (37), 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-04-05 04:11:02,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:02,579 INFO L93 Difference]: Finished difference Result 455 states and 596 transitions. [2022-04-05 04:11:02,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-05 04:11:02,580 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 6 states have internal predecessors, (37), 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 49 [2022-04-05 04:11:02,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:02,597 INFO L225 Difference]: With dead ends: 455 [2022-04-05 04:11:02,597 INFO L226 Difference]: Without dead ends: 427 [2022-04-05 04:11:02,597 INFO L912 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-04-05 04:11:02,597 INFO L913 BasicCegarLoop]: 289 mSDtfsCounter, 160 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:02,597 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 1515 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-05 04:11:02,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2022-04-05 04:11:02,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2022-04-05 04:11:02,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 318 states have (on average 1.279874213836478) internal successors, (407), 330 states have internal predecessors, (407), 66 states have call successors, (66), 36 states have call predecessors, (66), 42 states have return successors, (89), 64 states have call predecessors, (89), 58 states have call successors, (89) [2022-04-05 04:11:02,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 562 transitions. [2022-04-05 04:11:02,605 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 562 transitions. Word has length 49 [2022-04-05 04:11:02,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:02,605 INFO L478 AbstractCegarLoop]: Abstraction has 427 states and 562 transitions. [2022-04-05 04:11:02,605 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 6 states have internal predecessors, (37), 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-04-05 04:11:02,605 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 562 transitions. [2022-04-05 04:11:02,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-05 04:11:02,606 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:02,606 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:02,606 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-05 04:11:02,606 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:02,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:02,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1720991068, now seen corresponding path program 1 times [2022-04-05 04:11:02,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:02,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435589954] [2022-04-05 04:11:02,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:02,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:02,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:02,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:02,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:02,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-04-05 04:11:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:02,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-05 04:11:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:02,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:02,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:02,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435589954] [2022-04-05 04:11:02,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435589954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:02,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:02,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-05 04:11:02,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962068401] [2022-04-05 04:11:02,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:02,740 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-05 04:11:02,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:02,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-05 04:11:02,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-05 04:11:02,741 INFO L87 Difference]: Start difference. First operand 427 states and 562 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-05 04:11:03,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:03,183 INFO L93 Difference]: Finished difference Result 453 states and 597 transitions. [2022-04-05 04:11:03,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-05 04:11:03,183 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2022-04-05 04:11:03,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:03,185 INFO L225 Difference]: With dead ends: 453 [2022-04-05 04:11:03,185 INFO L226 Difference]: Without dead ends: 423 [2022-04-05 04:11:03,185 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-05 04:11:03,186 INFO L913 BasicCegarLoop]: 271 mSDtfsCounter, 115 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:03,186 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 1069 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-05 04:11:03,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-04-05 04:11:03,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 409. [2022-04-05 04:11:03,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 304 states have (on average 1.2861842105263157) internal successors, (391), 316 states have internal predecessors, (391), 64 states have call successors, (64), 34 states have call predecessors, (64), 40 states have return successors, (87), 62 states have call predecessors, (87), 56 states have call successors, (87) [2022-04-05 04:11:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 542 transitions. [2022-04-05 04:11:03,192 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 542 transitions. Word has length 50 [2022-04-05 04:11:03,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:03,193 INFO L478 AbstractCegarLoop]: Abstraction has 409 states and 542 transitions. [2022-04-05 04:11:03,193 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 5 states have internal predecessors, (38), 3 states have call successors, (7), 7 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-05 04:11:03,193 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 542 transitions. [2022-04-05 04:11:03,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-05 04:11:03,195 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:03,195 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:03,196 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-05 04:11:03,196 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:03,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:03,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1090499838, now seen corresponding path program 1 times [2022-04-05 04:11:03,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:03,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320128297] [2022-04-05 04:11:03,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:03,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:03,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:03,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:03,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:03,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:03,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:11:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:03,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:03,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:03,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:03,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320128297] [2022-04-05 04:11:03,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320128297] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:03,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:03,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-05 04:11:03,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62631816] [2022-04-05 04:11:03,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:03,312 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-05 04:11:03,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:03,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-05 04:11:03,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-05 04:11:03,313 INFO L87 Difference]: Start difference. First operand 409 states and 542 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 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-04-05 04:11:04,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:04,796 INFO L93 Difference]: Finished difference Result 600 states and 867 transitions. [2022-04-05 04:11:04,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-05 04:11:04,797 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 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-04-05 04:11:04,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:04,799 INFO L225 Difference]: With dead ends: 600 [2022-04-05 04:11:04,799 INFO L226 Difference]: Without dead ends: 600 [2022-04-05 04:11:04,799 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2022-04-05 04:11:04,799 INFO L913 BasicCegarLoop]: 423 mSDtfsCounter, 627 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 1922 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 1922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:04,800 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [637 Valid, 1247 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 1922 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-05 04:11:04,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2022-04-05 04:11:04,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 534. [2022-04-05 04:11:04,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 399 states have (on average 1.3433583959899749) internal successors, (536), 410 states have internal predecessors, (536), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2022-04-05 04:11:04,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 769 transitions. [2022-04-05 04:11:04,809 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 769 transitions. Word has length 50 [2022-04-05 04:11:04,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:04,809 INFO L478 AbstractCegarLoop]: Abstraction has 534 states and 769 transitions. [2022-04-05 04:11:04,809 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 7 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-04-05 04:11:04,809 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 769 transitions. [2022-04-05 04:11:04,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-05 04:11:04,810 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:04,810 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:04,810 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-05 04:11:04,810 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:04,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:04,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1506717387, now seen corresponding path program 1 times [2022-04-05 04:11:04,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:04,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527096822] [2022-04-05 04:11:04,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:04,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:04,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:04,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:04,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:04,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:11:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:04,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:04,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:04,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:04,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527096822] [2022-04-05 04:11:04,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527096822] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:04,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:04,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-05 04:11:04,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886789095] [2022-04-05 04:11:04,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:04,942 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-05 04:11:04,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:04,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-05 04:11:04,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-05 04:11:04,942 INFO L87 Difference]: Start difference. First operand 534 states and 769 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-05 04:11:05,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:05,498 INFO L93 Difference]: Finished difference Result 555 states and 796 transitions. [2022-04-05 04:11:05,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-05 04:11:05,498 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-04-05 04:11:05,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:05,500 INFO L225 Difference]: With dead ends: 555 [2022-04-05 04:11:05,500 INFO L226 Difference]: Without dead ends: 555 [2022-04-05 04:11:05,500 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-04-05 04:11:05,501 INFO L913 BasicCegarLoop]: 240 mSDtfsCounter, 616 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:05,501 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [625 Valid, 735 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-05 04:11:05,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-04-05 04:11:05,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 537. [2022-04-05 04:11:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 402 states have (on average 1.3432835820895523) internal successors, (540), 413 states have internal predecessors, (540), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2022-04-05 04:11:05,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 773 transitions. [2022-04-05 04:11:05,511 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 773 transitions. Word has length 51 [2022-04-05 04:11:05,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:05,512 INFO L478 AbstractCegarLoop]: Abstraction has 537 states and 773 transitions. [2022-04-05 04:11:05,512 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-05 04:11:05,512 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 773 transitions. [2022-04-05 04:11:05,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-05 04:11:05,512 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:05,512 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:05,512 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-05 04:11:05,513 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:05,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:05,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1791177556, now seen corresponding path program 1 times [2022-04-05 04:11:05,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:05,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001728759] [2022-04-05 04:11:05,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:05,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:05,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:05,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:05,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:05,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:11:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:05,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:05,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:05,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:05,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001728759] [2022-04-05 04:11:05,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001728759] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:05,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:05,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 04:11:05,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695050352] [2022-04-05 04:11:05,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:05,694 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 04:11:05,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:05,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 04:11:05,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:11:05,695 INFO L87 Difference]: Start difference. First operand 537 states and 773 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 8 states have internal predecessors, (39), 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-04-05 04:11:06,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:06,553 INFO L93 Difference]: Finished difference Result 624 states and 937 transitions. [2022-04-05 04:11:06,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 04:11:06,562 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 8 states have internal predecessors, (39), 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 51 [2022-04-05 04:11:06,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:06,564 INFO L225 Difference]: With dead ends: 624 [2022-04-05 04:11:06,564 INFO L226 Difference]: Without dead ends: 624 [2022-04-05 04:11:06,564 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2022-04-05 04:11:06,565 INFO L913 BasicCegarLoop]: 253 mSDtfsCounter, 491 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:06,565 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 772 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-05 04:11:06,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2022-04-05 04:11:06,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 529. [2022-04-05 04:11:06,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 394 states have (on average 1.3350253807106598) internal successors, (526), 405 states have internal predecessors, (526), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2022-04-05 04:11:06,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 759 transitions. [2022-04-05 04:11:06,577 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 759 transitions. Word has length 51 [2022-04-05 04:11:06,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:06,577 INFO L478 AbstractCegarLoop]: Abstraction has 529 states and 759 transitions. [2022-04-05 04:11:06,577 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 8 states have internal predecessors, (39), 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-04-05 04:11:06,577 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 759 transitions. [2022-04-05 04:11:06,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-05 04:11:06,577 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:06,577 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:06,577 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-05 04:11:06,578 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:06,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:06,578 INFO L85 PathProgramCache]: Analyzing trace with hash -50366668, now seen corresponding path program 1 times [2022-04-05 04:11:06,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:06,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792412972] [2022-04-05 04:11:06,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:06,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:06,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:06,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:06,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:06,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:06,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:06,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:11:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:06,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:06,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:06,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:06,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792412972] [2022-04-05 04:11:06,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792412972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:06,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:06,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-05 04:11:06,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753272455] [2022-04-05 04:11:06,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:06,755 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-05 04:11:06,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:06,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-05 04:11:06,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-05 04:11:06,755 INFO L87 Difference]: Start difference. First operand 529 states and 759 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 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-04-05 04:11:07,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:07,196 INFO L93 Difference]: Finished difference Result 701 states and 1080 transitions. [2022-04-05 04:11:07,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-05 04:11:07,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 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 51 [2022-04-05 04:11:07,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:07,199 INFO L225 Difference]: With dead ends: 701 [2022-04-05 04:11:07,199 INFO L226 Difference]: Without dead ends: 701 [2022-04-05 04:11:07,200 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-05 04:11:07,201 INFO L913 BasicCegarLoop]: 392 mSDtfsCounter, 304 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:07,201 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 728 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-05 04:11:07,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2022-04-05 04:11:07,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 524. [2022-04-05 04:11:07,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 390 states have (on average 1.3307692307692307) internal successors, (519), 400 states have internal predecessors, (519), 91 states have call successors, (91), 37 states have call predecessors, (91), 42 states have return successors, (141), 88 states have call predecessors, (141), 84 states have call successors, (141) [2022-04-05 04:11:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 751 transitions. [2022-04-05 04:11:07,213 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 751 transitions. Word has length 51 [2022-04-05 04:11:07,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:07,213 INFO L478 AbstractCegarLoop]: Abstraction has 524 states and 751 transitions. [2022-04-05 04:11:07,213 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 3 states have internal predecessors, (39), 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-04-05 04:11:07,213 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 751 transitions. [2022-04-05 04:11:07,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-05 04:11:07,213 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:07,213 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:07,213 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-05 04:11:07,214 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:07,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:07,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1529813192, now seen corresponding path program 1 times [2022-04-05 04:11:07,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:07,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316073999] [2022-04-05 04:11:07,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:07,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:07,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:07,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:07,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:07,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:07,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:11:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:07,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:07,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-04-05 04:11:07,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:07,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316073999] [2022-04-05 04:11:07,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316073999] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:07,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:07,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 04:11:07,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494314970] [2022-04-05 04:11:07,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:07,338 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 04:11:07,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:07,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 04:11:07,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:11:07,339 INFO L87 Difference]: Start difference. First operand 524 states and 751 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 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-04-05 04:11:07,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:07,886 INFO L93 Difference]: Finished difference Result 544 states and 778 transitions. [2022-04-05 04:11:07,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 04:11:07,887 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 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 52 [2022-04-05 04:11:07,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:07,889 INFO L225 Difference]: With dead ends: 544 [2022-04-05 04:11:07,889 INFO L226 Difference]: Without dead ends: 543 [2022-04-05 04:11:07,889 INFO L912 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-04-05 04:11:07,890 INFO L913 BasicCegarLoop]: 253 mSDtfsCounter, 196 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:07,890 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [197 Valid, 1339 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-05 04:11:07,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2022-04-05 04:11:07,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 531. [2022-04-05 04:11:07,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 396 states have (on average 1.3282828282828283) internal successors, (526), 407 states have internal predecessors, (526), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (142), 89 states have call predecessors, (142), 85 states have call successors, (142) [2022-04-05 04:11:07,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 760 transitions. [2022-04-05 04:11:07,900 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 760 transitions. Word has length 52 [2022-04-05 04:11:07,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:07,901 INFO L478 AbstractCegarLoop]: Abstraction has 531 states and 760 transitions. [2022-04-05 04:11:07,901 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 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-04-05 04:11:07,901 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 760 transitions. [2022-04-05 04:11:07,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-05 04:11:07,901 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:07,901 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:07,902 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-05 04:11:07,902 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:07,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:07,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1529844936, now seen corresponding path program 1 times [2022-04-05 04:11:07,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:07,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254927889] [2022-04-05 04:11:07,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:07,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:07,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:07,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:07,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:07,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:08,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:11:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:08,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:08,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:08,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:08,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254927889] [2022-04-05 04:11:08,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254927889] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:08,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:08,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 04:11:08,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879169348] [2022-04-05 04:11:08,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:08,058 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 04:11:08,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:08,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 04:11:08,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:11:08,059 INFO L87 Difference]: Start difference. First operand 531 states and 760 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 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-04-05 04:11:08,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:08,636 INFO L93 Difference]: Finished difference Result 559 states and 794 transitions. [2022-04-05 04:11:08,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-05 04:11:08,640 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 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 52 [2022-04-05 04:11:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:08,642 INFO L225 Difference]: With dead ends: 559 [2022-04-05 04:11:08,642 INFO L226 Difference]: Without dead ends: 538 [2022-04-05 04:11:08,643 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-04-05 04:11:08,644 INFO L913 BasicCegarLoop]: 255 mSDtfsCounter, 138 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:08,644 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 1447 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-05 04:11:08,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-04-05 04:11:08,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 530. [2022-04-05 04:11:08,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 395 states have (on average 1.3265822784810126) internal successors, (524), 406 states have internal predecessors, (524), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (142), 89 states have call predecessors, (142), 85 states have call successors, (142) [2022-04-05 04:11:08,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 758 transitions. [2022-04-05 04:11:08,654 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 758 transitions. Word has length 52 [2022-04-05 04:11:08,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:08,654 INFO L478 AbstractCegarLoop]: Abstraction has 530 states and 758 transitions. [2022-04-05 04:11:08,654 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 6 states have internal predecessors, (40), 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-04-05 04:11:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 758 transitions. [2022-04-05 04:11:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-05 04:11:08,655 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:08,655 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:08,655 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-05 04:11:08,655 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:08,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:08,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1874017512, now seen corresponding path program 1 times [2022-04-05 04:11:08,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:08,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777034838] [2022-04-05 04:11:08,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:08,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:08,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:08,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:08,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:08,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-04-05 04:11:08,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:08,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:08,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-05 04:11:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:08,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:08,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:08,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777034838] [2022-04-05 04:11:08,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777034838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:08,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:08,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-05 04:11:08,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939590874] [2022-04-05 04:11:08,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:08,794 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-05 04:11:08,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:08,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-05 04:11:08,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-04-05 04:11:08,795 INFO L87 Difference]: Start difference. First operand 530 states and 758 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-05 04:11:09,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:09,273 INFO L93 Difference]: Finished difference Result 549 states and 800 transitions. [2022-04-05 04:11:09,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 04:11:09,274 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 7 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 58 [2022-04-05 04:11:09,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:09,276 INFO L225 Difference]: With dead ends: 549 [2022-04-05 04:11:09,276 INFO L226 Difference]: Without dead ends: 549 [2022-04-05 04:11:09,277 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:11:09,277 INFO L913 BasicCegarLoop]: 268 mSDtfsCounter, 188 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:09,278 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 723 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-05 04:11:09,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2022-04-05 04:11:09,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 529. [2022-04-05 04:11:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 394 states have (on average 1.3197969543147208) internal successors, (520), 405 states have internal predecessors, (520), 92 states have call successors, (92), 37 states have call predecessors, (92), 42 states have return successors, (142), 89 states have call predecessors, (142), 85 states have call successors, (142) [2022-04-05 04:11:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 754 transitions. [2022-04-05 04:11:09,296 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 754 transitions. Word has length 58 [2022-04-05 04:11:09,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:09,296 INFO L478 AbstractCegarLoop]: Abstraction has 529 states and 754 transitions. [2022-04-05 04:11:09,296 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (12), 7 states have call predecessors, (12), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-05 04:11:09,297 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 754 transitions. [2022-04-05 04:11:09,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-05 04:11:09,297 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:09,297 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:09,297 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-05 04:11:09,297 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:09,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:09,298 INFO L85 PathProgramCache]: Analyzing trace with hash 2132872221, now seen corresponding path program 1 times [2022-04-05 04:11:09,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:09,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78011277] [2022-04-05 04:11:09,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:09,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:09,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:09,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:09,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:09,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:09,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-05 04:11:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:09,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:09,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:09,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78011277] [2022-04-05 04:11:09,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78011277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:09,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:09,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-05 04:11:09,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122727549] [2022-04-05 04:11:09,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:09,500 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-05 04:11:09,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:09,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-05 04:11:09,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-04-05 04:11:09,501 INFO L87 Difference]: Start difference. First operand 529 states and 754 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 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-04-05 04:11:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:10,550 INFO L93 Difference]: Finished difference Result 671 states and 995 transitions. [2022-04-05 04:11:10,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-05 04:11:10,551 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 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 53 [2022-04-05 04:11:10,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:10,554 INFO L225 Difference]: With dead ends: 671 [2022-04-05 04:11:10,554 INFO L226 Difference]: Without dead ends: 639 [2022-04-05 04:11:10,554 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-04-05 04:11:10,555 INFO L913 BasicCegarLoop]: 336 mSDtfsCounter, 561 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:10,555 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [572 Valid, 737 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-05 04:11:10,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2022-04-05 04:11:10,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 560. [2022-04-05 04:11:10,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 415 states have (on average 1.344578313253012) internal successors, (558), 426 states have internal predecessors, (558), 101 states have call successors, (101), 37 states have call predecessors, (101), 43 states have return successors, (165), 98 states have call predecessors, (165), 94 states have call successors, (165) [2022-04-05 04:11:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 824 transitions. [2022-04-05 04:11:10,566 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 824 transitions. Word has length 53 [2022-04-05 04:11:10,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:10,566 INFO L478 AbstractCegarLoop]: Abstraction has 560 states and 824 transitions. [2022-04-05 04:11:10,566 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 5 states have internal predecessors, (41), 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-04-05 04:11:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 824 transitions. [2022-04-05 04:11:10,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-05 04:11:10,567 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:10,567 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:10,567 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-05 04:11:10,567 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:10,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:10,567 INFO L85 PathProgramCache]: Analyzing trace with hash 983025775, now seen corresponding path program 1 times [2022-04-05 04:11:10,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:10,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089184479] [2022-04-05 04:11:10,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:10,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:10,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:10,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:10,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:10,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-05 04:11:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:10,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:10,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:10,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:10,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089184479] [2022-04-05 04:11:10,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089184479] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:10,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:10,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-05 04:11:10,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28973035] [2022-04-05 04:11:10,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:10,751 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-05 04:11:10,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:10,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-05 04:11:10,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-05 04:11:10,752 INFO L87 Difference]: Start difference. First operand 560 states and 824 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-05 04:11:11,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:11,328 INFO L93 Difference]: Finished difference Result 390 states and 522 transitions. [2022-04-05 04:11:11,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-05 04:11:11,328 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) Word has length 62 [2022-04-05 04:11:11,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:11,329 INFO L225 Difference]: With dead ends: 390 [2022-04-05 04:11:11,330 INFO L226 Difference]: Without dead ends: 390 [2022-04-05 04:11:11,330 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-05 04:11:11,330 INFO L913 BasicCegarLoop]: 251 mSDtfsCounter, 153 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:11,330 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 1520 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-05 04:11:11,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-04-05 04:11:11,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 338. [2022-04-05 04:11:11,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 246 states have (on average 1.2560975609756098) internal successors, (309), 254 states have internal predecessors, (309), 59 states have call successors, (59), 31 states have call predecessors, (59), 32 states have return successors, (74), 54 states have call predecessors, (74), 53 states have call successors, (74) [2022-04-05 04:11:11,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 442 transitions. [2022-04-05 04:11:11,337 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 442 transitions. Word has length 62 [2022-04-05 04:11:11,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:11,337 INFO L478 AbstractCegarLoop]: Abstraction has 338 states and 442 transitions. [2022-04-05 04:11:11,337 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (12), 7 states have call predecessors, (12), 3 states have return successors, (6), 3 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-05 04:11:11,337 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 442 transitions. [2022-04-05 04:11:11,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-05 04:11:11,337 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:11,337 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:11,337 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-05 04:11:11,338 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:11,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:11,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1006609107, now seen corresponding path program 1 times [2022-04-05 04:11:11,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:11,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645060849] [2022-04-05 04:11:11,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:11,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:11,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:11,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:11,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:11,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:11:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:11,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:11,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:11,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:11,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:11,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645060849] [2022-04-05 04:11:11,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645060849] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:11,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:11,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-05 04:11:11,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622027020] [2022-04-05 04:11:11,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:11,527 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-05 04:11:11,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:11,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-05 04:11:11,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-04-05 04:11:11,527 INFO L87 Difference]: Start difference. First operand 338 states and 442 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 7 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-04-05 04:11:12,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:12,180 INFO L93 Difference]: Finished difference Result 343 states and 451 transitions. [2022-04-05 04:11:12,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-05 04:11:12,181 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 7 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-04-05 04:11:12,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:12,182 INFO L225 Difference]: With dead ends: 343 [2022-04-05 04:11:12,182 INFO L226 Difference]: Without dead ends: 304 [2022-04-05 04:11:12,182 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-04-05 04:11:12,183 INFO L913 BasicCegarLoop]: 227 mSDtfsCounter, 155 mSDsluCounter, 1258 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:12,183 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 1485 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1347 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-05 04:11:12,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-04-05 04:11:12,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 298. [2022-04-05 04:11:12,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 214 states have (on average 1.2757009345794392) internal successors, (273), 220 states have internal predecessors, (273), 55 states have call successors, (55), 28 states have call predecessors, (55), 28 states have return successors, (70), 50 states have call predecessors, (70), 50 states have call successors, (70) [2022-04-05 04:11:12,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 398 transitions. [2022-04-05 04:11:12,188 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 398 transitions. Word has length 58 [2022-04-05 04:11:12,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:12,188 INFO L478 AbstractCegarLoop]: Abstraction has 298 states and 398 transitions. [2022-04-05 04:11:12,188 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 7 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-04-05 04:11:12,188 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 398 transitions. [2022-04-05 04:11:12,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-05 04:11:12,188 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:12,188 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:12,189 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-05 04:11:12,189 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:12,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:12,189 INFO L85 PathProgramCache]: Analyzing trace with hash -763479135, now seen corresponding path program 1 times [2022-04-05 04:11:12,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:12,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600952352] [2022-04-05 04:11:12,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:12,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:12,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:12,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:12,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:12,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-05 04:11:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:12,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:12,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:12,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:12,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:12,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:12,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600952352] [2022-04-05 04:11:12,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600952352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:12,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:12,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 04:11:12,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650742061] [2022-04-05 04:11:12,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:12,340 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 04:11:12,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:12,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 04:11:12,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:11:12,341 INFO L87 Difference]: Start difference. First operand 298 states and 398 transitions. Second operand has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-05 04:11:12,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:12,964 INFO L93 Difference]: Finished difference Result 316 states and 429 transitions. [2022-04-05 04:11:12,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-05 04:11:12,964 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-04-05 04:11:12,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:12,967 INFO L225 Difference]: With dead ends: 316 [2022-04-05 04:11:12,967 INFO L226 Difference]: Without dead ends: 316 [2022-04-05 04:11:12,967 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2022-04-05 04:11:12,968 INFO L913 BasicCegarLoop]: 211 mSDtfsCounter, 246 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:12,968 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 867 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-05 04:11:12,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-04-05 04:11:12,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 298. [2022-04-05 04:11:12,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 214 states have (on average 1.266355140186916) internal successors, (271), 220 states have internal predecessors, (271), 55 states have call successors, (55), 28 states have call predecessors, (55), 28 states have return successors, (70), 50 states have call predecessors, (70), 50 states have call successors, (70) [2022-04-05 04:11:12,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 396 transitions. [2022-04-05 04:11:12,973 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 396 transitions. Word has length 66 [2022-04-05 04:11:12,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:12,973 INFO L478 AbstractCegarLoop]: Abstraction has 298 states and 396 transitions. [2022-04-05 04:11:12,973 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 6 states have internal predecessors, (46), 3 states have call successors, (13), 9 states have call predecessors, (13), 4 states have return successors, (7), 4 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-05 04:11:12,973 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 396 transitions. [2022-04-05 04:11:12,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-05 04:11:12,973 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:12,973 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:12,974 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-05 04:11:12,974 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:12,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:12,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1216763617, now seen corresponding path program 1 times [2022-04-05 04:11:12,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:12,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454126577] [2022-04-05 04:11:12,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:12,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:13,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:13,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:13,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:13,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-05 04:11:13,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:13,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:13,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:13,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:13,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:13,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454126577] [2022-04-05 04:11:13,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454126577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:13,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:13,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 04:11:13,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743970874] [2022-04-05 04:11:13,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:13,119 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 04:11:13,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:13,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 04:11:13,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:11:13,120 INFO L87 Difference]: Start difference. First operand 298 states and 396 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-05 04:11:13,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:13,465 INFO L93 Difference]: Finished difference Result 330 states and 453 transitions. [2022-04-05 04:11:13,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 04:11:13,465 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2022-04-05 04:11:13,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:13,467 INFO L225 Difference]: With dead ends: 330 [2022-04-05 04:11:13,467 INFO L226 Difference]: Without dead ends: 330 [2022-04-05 04:11:13,467 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-05 04:11:13,467 INFO L913 BasicCegarLoop]: 225 mSDtfsCounter, 133 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:13,468 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 1190 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-05 04:11:13,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-04-05 04:11:13,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 303. [2022-04-05 04:11:13,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 218 states have (on average 1.261467889908257) internal successors, (275), 224 states have internal predecessors, (275), 55 states have call successors, (55), 28 states have call predecessors, (55), 29 states have return successors, (79), 51 states have call predecessors, (79), 50 states have call successors, (79) [2022-04-05 04:11:13,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 409 transitions. [2022-04-05 04:11:13,473 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 409 transitions. Word has length 68 [2022-04-05 04:11:13,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:13,474 INFO L478 AbstractCegarLoop]: Abstraction has 303 states and 409 transitions. [2022-04-05 04:11:13,474 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (13), 8 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-05 04:11:13,474 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 409 transitions. [2022-04-05 04:11:13,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-05 04:11:13,474 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:13,474 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:13,474 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-05 04:11:13,474 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:13,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:13,475 INFO L85 PathProgramCache]: Analyzing trace with hash 107043316, now seen corresponding path program 1 times [2022-04-05 04:11:13,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:13,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645336131] [2022-04-05 04:11:13,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:13,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:13,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:13,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:13,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:13,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-05 04:11:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:13,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:13,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:13,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:13,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:13,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:13,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:13,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645336131] [2022-04-05 04:11:13,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645336131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:13,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:13,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-05 04:11:13,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444615748] [2022-04-05 04:11:13,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:13,693 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-05 04:11:13,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:13,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-05 04:11:13,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-05 04:11:13,694 INFO L87 Difference]: Start difference. First operand 303 states and 409 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-05 04:11:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:14,056 INFO L93 Difference]: Finished difference Result 474 states and 674 transitions. [2022-04-05 04:11:14,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 04:11:14,057 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 69 [2022-04-05 04:11:14,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:14,058 INFO L225 Difference]: With dead ends: 474 [2022-04-05 04:11:14,058 INFO L226 Difference]: Without dead ends: 474 [2022-04-05 04:11:14,058 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:11:14,059 INFO L913 BasicCegarLoop]: 317 mSDtfsCounter, 230 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:14,059 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 793 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-05 04:11:14,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2022-04-05 04:11:14,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 307. [2022-04-05 04:11:14,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 222 states have (on average 1.2657657657657657) internal successors, (281), 228 states have internal predecessors, (281), 55 states have call successors, (55), 28 states have call predecessors, (55), 29 states have return successors, (79), 51 states have call predecessors, (79), 50 states have call successors, (79) [2022-04-05 04:11:14,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 415 transitions. [2022-04-05 04:11:14,065 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 415 transitions. Word has length 69 [2022-04-05 04:11:14,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:14,065 INFO L478 AbstractCegarLoop]: Abstraction has 307 states and 415 transitions. [2022-04-05 04:11:14,065 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (13), 8 states have call predecessors, (13), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-05 04:11:14,066 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 415 transitions. [2022-04-05 04:11:14,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-05 04:11:14,066 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:14,066 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:14,066 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-05 04:11:14,066 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:14,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:14,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1007458050, now seen corresponding path program 1 times [2022-04-05 04:11:14,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:14,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035103590] [2022-04-05 04:11:14,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:14,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:14,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:14,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:14,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:14,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-04-05 04:11:14,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:14,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:14,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:14,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:14,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:14,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:14,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035103590] [2022-04-05 04:11:14,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035103590] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:14,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:14,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-05 04:11:14,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947018392] [2022-04-05 04:11:14,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:14,197 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-05 04:11:14,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:14,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-05 04:11:14,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-04-05 04:11:14,198 INFO L87 Difference]: Start difference. First operand 307 states and 415 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-05 04:11:15,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:15,044 INFO L93 Difference]: Finished difference Result 529 states and 764 transitions. [2022-04-05 04:11:15,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 04:11:15,044 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2022-04-05 04:11:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:15,046 INFO L225 Difference]: With dead ends: 529 [2022-04-05 04:11:15,046 INFO L226 Difference]: Without dead ends: 529 [2022-04-05 04:11:15,046 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-05 04:11:15,047 INFO L913 BasicCegarLoop]: 253 mSDtfsCounter, 328 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 761 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:15,047 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 761 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-05 04:11:15,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2022-04-05 04:11:15,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 490. [2022-04-05 04:11:15,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 357 states have (on average 1.2913165266106443) internal successors, (461), 366 states have internal predecessors, (461), 89 states have call successors, (89), 35 states have call predecessors, (89), 43 states have return successors, (153), 89 states have call predecessors, (153), 85 states have call successors, (153) [2022-04-05 04:11:15,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 703 transitions. [2022-04-05 04:11:15,055 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 703 transitions. Word has length 70 [2022-04-05 04:11:15,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:15,055 INFO L478 AbstractCegarLoop]: Abstraction has 490 states and 703 transitions. [2022-04-05 04:11:15,055 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (13), 9 states have call predecessors, (13), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-05 04:11:15,056 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 703 transitions. [2022-04-05 04:11:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-05 04:11:15,056 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:15,056 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:15,056 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-05 04:11:15,056 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:15,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:15,056 INFO L85 PathProgramCache]: Analyzing trace with hash -2035760571, now seen corresponding path program 1 times [2022-04-05 04:11:15,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:15,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820743840] [2022-04-05 04:11:15,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:15,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:15,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:15,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:15,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:15,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:15,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:15,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-05 04:11:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:15,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:11:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:15,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:15,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:15,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:15,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:15,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:15,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820743840] [2022-04-05 04:11:15,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820743840] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:15,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:15,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-05 04:11:15,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670111376] [2022-04-05 04:11:15,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:15,249 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-05 04:11:15,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:15,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-05 04:11:15,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-05 04:11:15,250 INFO L87 Difference]: Start difference. First operand 490 states and 703 transitions. Second operand has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-05 04:11:15,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:15,587 INFO L93 Difference]: Finished difference Result 493 states and 705 transitions. [2022-04-05 04:11:15,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-05 04:11:15,587 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) Word has length 72 [2022-04-05 04:11:15,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:15,589 INFO L225 Difference]: With dead ends: 493 [2022-04-05 04:11:15,589 INFO L226 Difference]: Without dead ends: 493 [2022-04-05 04:11:15,589 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-05 04:11:15,592 INFO L913 BasicCegarLoop]: 238 mSDtfsCounter, 208 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:15,592 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 1157 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-05 04:11:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-04-05 04:11:15,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 484. [2022-04-05 04:11:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 353 states have (on average 1.2832861189801699) internal successors, (453), 361 states have internal predecessors, (453), 88 states have call successors, (88), 35 states have call predecessors, (88), 42 states have return successors, (146), 88 states have call predecessors, (146), 84 states have call successors, (146) [2022-04-05 04:11:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 687 transitions. [2022-04-05 04:11:15,600 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 687 transitions. Word has length 72 [2022-04-05 04:11:15,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:15,600 INFO L478 AbstractCegarLoop]: Abstraction has 484 states and 687 transitions. [2022-04-05 04:11:15,600 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.923076923076923) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (13), 9 states have call predecessors, (13), 3 states have return successors, (8), 3 states have call predecessors, (8), 1 states have call successors, (8) [2022-04-05 04:11:15,600 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 687 transitions. [2022-04-05 04:11:15,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-05 04:11:15,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:15,601 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:15,601 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-05 04:11:15,601 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:15,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:15,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1777696599, now seen corresponding path program 1 times [2022-04-05 04:11:15,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:15,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975614943] [2022-04-05 04:11:15,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:15,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:15,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:15,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:15,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:15,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-04-05 04:11:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:15,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:11:15,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:15,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:15,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:15,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:15,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:15,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:15,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-05 04:11:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:15,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:15,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:15,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975614943] [2022-04-05 04:11:15,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975614943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:15,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:15,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-05 04:11:15,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086198621] [2022-04-05 04:11:15,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:15,763 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-05 04:11:15,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:15,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-05 04:11:15,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-04-05 04:11:15,763 INFO L87 Difference]: Start difference. First operand 484 states and 687 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-05 04:11:16,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:16,485 INFO L93 Difference]: Finished difference Result 450 states and 629 transitions. [2022-04-05 04:11:16,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 04:11:16,486 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 83 [2022-04-05 04:11:16,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:16,487 INFO L225 Difference]: With dead ends: 450 [2022-04-05 04:11:16,487 INFO L226 Difference]: Without dead ends: 450 [2022-04-05 04:11:16,488 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2022-04-05 04:11:16,488 INFO L913 BasicCegarLoop]: 317 mSDtfsCounter, 232 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1033 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:16,488 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 1033 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-05 04:11:16,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-04-05 04:11:16,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 436. [2022-04-05 04:11:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 320 states have (on average 1.296875) internal successors, (415), 329 states have internal predecessors, (415), 79 states have call successors, (79), 33 states have call predecessors, (79), 36 states have return successors, (110), 74 states have call predecessors, (110), 75 states have call successors, (110) [2022-04-05 04:11:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 604 transitions. [2022-04-05 04:11:16,496 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 604 transitions. Word has length 83 [2022-04-05 04:11:16,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:16,496 INFO L478 AbstractCegarLoop]: Abstraction has 436 states and 604 transitions. [2022-04-05 04:11:16,496 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (14), 10 states have call predecessors, (14), 4 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-04-05 04:11:16,496 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 604 transitions. [2022-04-05 04:11:16,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-05 04:11:16,497 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:16,497 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:16,497 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-05 04:11:16,497 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:16,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:16,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1836701912, now seen corresponding path program 1 times [2022-04-05 04:11:16,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:16,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378170637] [2022-04-05 04:11:16,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:16,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:16,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:16,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:16,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:16,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:11:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:16,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:16,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:16,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:11:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:16,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:16,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:16,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:16,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-05 04:11:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:16,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:16,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378170637] [2022-04-05 04:11:16,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378170637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:16,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:16,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-05 04:11:16,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230538436] [2022-04-05 04:11:16,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:16,843 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-05 04:11:16,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:16,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-05 04:11:16,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-04-05 04:11:16,843 INFO L87 Difference]: Start difference. First operand 436 states and 604 transitions. Second operand has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-05 04:11:17,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:17,454 INFO L93 Difference]: Finished difference Result 483 states and 678 transitions. [2022-04-05 04:11:17,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-05 04:11:17,454 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) Word has length 92 [2022-04-05 04:11:17,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:17,456 INFO L225 Difference]: With dead ends: 483 [2022-04-05 04:11:17,456 INFO L226 Difference]: Without dead ends: 461 [2022-04-05 04:11:17,456 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-04-05 04:11:17,457 INFO L913 BasicCegarLoop]: 234 mSDtfsCounter, 211 mSDsluCounter, 2422 mSDsCounter, 0 mSdLazyCounter, 1390 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 2656 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 1390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:17,457 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 2656 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 1390 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-05 04:11:17,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-04-05 04:11:17,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 447. [2022-04-05 04:11:17,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 329 states have (on average 1.2887537993920972) internal successors, (424), 339 states have internal predecessors, (424), 79 states have call successors, (79), 33 states have call predecessors, (79), 38 states have return successors, (116), 75 states have call predecessors, (116), 75 states have call successors, (116) [2022-04-05 04:11:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 619 transitions. [2022-04-05 04:11:17,463 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 619 transitions. Word has length 92 [2022-04-05 04:11:17,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:17,464 INFO L478 AbstractCegarLoop]: Abstraction has 447 states and 619 transitions. [2022-04-05 04:11:17,464 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.9565217391304346) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-05 04:11:17,464 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 619 transitions. [2022-04-05 04:11:17,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-05 04:11:17,464 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:17,465 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:17,465 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-05 04:11:17,465 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:17,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:17,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1857542518, now seen corresponding path program 1 times [2022-04-05 04:11:17,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:17,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338718232] [2022-04-05 04:11:17,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:17,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:17,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:17,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:17,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:17,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:17,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:11:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:17,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:17,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:17,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:17,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:11:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:17,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:17,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:17,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:17,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:17,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-05 04:11:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:17,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:17,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338718232] [2022-04-05 04:11:17,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338718232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:17,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:17,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-05 04:11:17,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088562560] [2022-04-05 04:11:17,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:17,789 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-05 04:11:17,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:17,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-05 04:11:17,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2022-04-05 04:11:17,789 INFO L87 Difference]: Start difference. First operand 447 states and 619 transitions. Second operand has 23 states, 23 states have (on average 3.0) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-05 04:11:18,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:18,555 INFO L93 Difference]: Finished difference Result 481 states and 674 transitions. [2022-04-05 04:11:18,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-05 04:11:18,555 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) Word has length 93 [2022-04-05 04:11:18,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:18,572 INFO L225 Difference]: With dead ends: 481 [2022-04-05 04:11:18,572 INFO L226 Difference]: Without dead ends: 459 [2022-04-05 04:11:18,573 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-04-05 04:11:18,573 INFO L913 BasicCegarLoop]: 249 mSDtfsCounter, 131 mSDsluCounter, 2802 mSDsCounter, 0 mSdLazyCounter, 2010 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 3051 SdHoareTripleChecker+Invalid, 2120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:18,573 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 3051 Invalid, 2120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2010 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-05 04:11:18,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2022-04-05 04:11:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 434. [2022-04-05 04:11:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 319 states have (on average 1.297805642633229) internal successors, (414), 328 states have internal predecessors, (414), 78 states have call successors, (78), 33 states have call predecessors, (78), 36 states have return successors, (108), 73 states have call predecessors, (108), 74 states have call successors, (108) [2022-04-05 04:11:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 600 transitions. [2022-04-05 04:11:18,580 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 600 transitions. Word has length 93 [2022-04-05 04:11:18,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:18,580 INFO L478 AbstractCegarLoop]: Abstraction has 434 states and 600 transitions. [2022-04-05 04:11:18,581 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.0) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (13), 10 states have call predecessors, (13), 5 states have return successors, (11), 6 states have call predecessors, (11), 2 states have call successors, (11) [2022-04-05 04:11:18,581 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 600 transitions. [2022-04-05 04:11:18,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-05 04:11:18,581 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:18,581 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:18,581 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-05 04:11:18,581 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:18,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:18,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1054192149, now seen corresponding path program 1 times [2022-04-05 04:11:18,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:18,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312498630] [2022-04-05 04:11:18,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:18,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:18,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:18,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:18,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:18,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:18,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:18,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:18,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:11:18,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:18,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:18,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:18,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:11:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:18,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:18,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:18,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:18,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:18,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-05 04:11:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:18,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-05 04:11:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:18,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:18,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:18,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312498630] [2022-04-05 04:11:18,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312498630] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:18,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:18,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-05 04:11:18,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123616874] [2022-04-05 04:11:18,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:18,965 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-05 04:11:18,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:18,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-05 04:11:18,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=431, Unknown=0, NotChecked=0, Total=506 [2022-04-05 04:11:18,966 INFO L87 Difference]: Start difference. First operand 434 states and 600 transitions. Second operand has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-05 04:11:20,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:20,322 INFO L93 Difference]: Finished difference Result 467 states and 639 transitions. [2022-04-05 04:11:20,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-05 04:11:20,322 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2022-04-05 04:11:20,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:20,324 INFO L225 Difference]: With dead ends: 467 [2022-04-05 04:11:20,324 INFO L226 Difference]: Without dead ends: 434 [2022-04-05 04:11:20,324 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2022-04-05 04:11:20,324 INFO L913 BasicCegarLoop]: 210 mSDtfsCounter, 405 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 2942 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 3183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 2942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:20,325 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [406 Valid, 825 Invalid, 3183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 2942 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-05 04:11:20,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-04-05 04:11:20,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 424. [2022-04-05 04:11:20,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 313 states have (on average 1.3003194888178913) internal successors, (407), 322 states have internal predecessors, (407), 75 states have call successors, (75), 32 states have call predecessors, (75), 35 states have return successors, (105), 70 states have call predecessors, (105), 71 states have call successors, (105) [2022-04-05 04:11:20,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 587 transitions. [2022-04-05 04:11:20,331 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 587 transitions. Word has length 103 [2022-04-05 04:11:20,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:20,331 INFO L478 AbstractCegarLoop]: Abstraction has 424 states and 587 transitions. [2022-04-05 04:11:20,332 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.347826086956522) internal successors, (77), 11 states have internal predecessors, (77), 5 states have call successors, (14), 11 states have call predecessors, (14), 4 states have return successors, (12), 6 states have call predecessors, (12), 4 states have call successors, (12) [2022-04-05 04:11:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 587 transitions. [2022-04-05 04:11:20,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-05 04:11:20,332 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:20,332 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:20,332 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-05 04:11:20,333 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:20,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:20,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1385513232, now seen corresponding path program 1 times [2022-04-05 04:11:20,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:20,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116112809] [2022-04-05 04:11:20,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:20,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:20,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:20,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:20,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:20,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:20,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:11:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:20,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:11:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:20,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:20,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:11:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:20,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:20,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:20,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:20,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-04-05 04:11:20,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:20,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-04-05 04:11:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:20,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:20,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-04-05 04:11:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:20,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:20,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:20,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116112809] [2022-04-05 04:11:20,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116112809] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:20,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:20,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-05 04:11:20,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546241239] [2022-04-05 04:11:20,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:20,734 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-05 04:11:20,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:20,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-05 04:11:20,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-04-05 04:11:20,735 INFO L87 Difference]: Start difference. First operand 424 states and 587 transitions. Second operand has 25 states, 25 states have (on average 3.12) internal successors, (78), 11 states have internal predecessors, (78), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-05 04:11:21,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:21,540 INFO L93 Difference]: Finished difference Result 478 states and 676 transitions. [2022-04-05 04:11:21,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-05 04:11:21,540 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 11 states have internal predecessors, (78), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 108 [2022-04-05 04:11:21,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:21,543 INFO L225 Difference]: With dead ends: 478 [2022-04-05 04:11:21,543 INFO L226 Difference]: Without dead ends: 454 [2022-04-05 04:11:21,543 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2022-04-05 04:11:21,543 INFO L913 BasicCegarLoop]: 200 mSDtfsCounter, 137 mSDsluCounter, 2051 mSDsCounter, 0 mSdLazyCounter, 1810 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 2251 SdHoareTripleChecker+Invalid, 1903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:21,544 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 2251 Invalid, 1903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1810 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-05 04:11:21,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-04-05 04:11:21,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 440. [2022-04-05 04:11:21,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 324 states have (on average 1.2901234567901234) internal successors, (418), 334 states have internal predecessors, (418), 78 states have call successors, (78), 32 states have call predecessors, (78), 37 states have return successors, (114), 74 states have call predecessors, (114), 73 states have call successors, (114) [2022-04-05 04:11:21,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 610 transitions. [2022-04-05 04:11:21,550 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 610 transitions. Word has length 108 [2022-04-05 04:11:21,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:21,550 INFO L478 AbstractCegarLoop]: Abstraction has 440 states and 610 transitions. [2022-04-05 04:11:21,551 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.12) internal successors, (78), 11 states have internal predecessors, (78), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-05 04:11:21,551 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 610 transitions. [2022-04-05 04:11:21,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-05 04:11:21,551 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:21,551 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:21,551 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-05 04:11:21,552 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:21,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:21,552 INFO L85 PathProgramCache]: Analyzing trace with hash -205451642, now seen corresponding path program 1 times [2022-04-05 04:11:21,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:21,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395448037] [2022-04-05 04:11:21,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:21,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:21,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:21,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:21,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:21,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:21,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:21,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:11:21,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:21,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:11:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:21,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:21,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:11:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:21,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:21,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:21,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:21,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-05 04:11:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:21,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-04-05 04:11:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:21,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:21,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:21,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-04-05 04:11:21,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:21,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:21,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395448037] [2022-04-05 04:11:21,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395448037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:21,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:21,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-05 04:11:21,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398306746] [2022-04-05 04:11:21,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:21,941 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-05 04:11:21,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:21,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-05 04:11:21,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=516, Unknown=0, NotChecked=0, Total=600 [2022-04-05 04:11:21,941 INFO L87 Difference]: Start difference. First operand 440 states and 610 transitions. Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-05 04:11:22,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:22,994 INFO L93 Difference]: Finished difference Result 480 states and 674 transitions. [2022-04-05 04:11:22,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-05 04:11:22,994 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2022-04-05 04:11:22,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:22,996 INFO L225 Difference]: With dead ends: 480 [2022-04-05 04:11:22,996 INFO L226 Difference]: Without dead ends: 443 [2022-04-05 04:11:22,996 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=144, Invalid=1116, Unknown=0, NotChecked=0, Total=1260 [2022-04-05 04:11:22,997 INFO L913 BasicCegarLoop]: 238 mSDtfsCounter, 120 mSDsluCounter, 2389 mSDsCounter, 0 mSdLazyCounter, 2130 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 2627 SdHoareTripleChecker+Invalid, 2184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:22,997 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 2627 Invalid, 2184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2130 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-05 04:11:22,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-04-05 04:11:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 413. [2022-04-05 04:11:23,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 304 states have (on average 1.2664473684210527) internal successors, (385), 312 states have internal predecessors, (385), 75 states have call successors, (75), 32 states have call predecessors, (75), 33 states have return successors, (97), 69 states have call predecessors, (97), 70 states have call successors, (97) [2022-04-05 04:11:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 557 transitions. [2022-04-05 04:11:23,003 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 557 transitions. Word has length 109 [2022-04-05 04:11:23,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:23,004 INFO L478 AbstractCegarLoop]: Abstraction has 413 states and 557 transitions. [2022-04-05 04:11:23,004 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (16), 12 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-05 04:11:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 557 transitions. [2022-04-05 04:11:23,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-05 04:11:23,004 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:23,005 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:23,005 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-05 04:11:23,005 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:23,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:23,005 INFO L85 PathProgramCache]: Analyzing trace with hash -790809002, now seen corresponding path program 1 times [2022-04-05 04:11:23,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:23,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445208635] [2022-04-05 04:11:23,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:23,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-05 04:11:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:11:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-05 04:11:23,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-04-05 04:11:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-05 04:11:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,203 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-05 04:11:23,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:23,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445208635] [2022-04-05 04:11:23,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445208635] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:23,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:23,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-05 04:11:23,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504149075] [2022-04-05 04:11:23,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:23,203 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-05 04:11:23,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:23,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-05 04:11:23,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-04-05 04:11:23,204 INFO L87 Difference]: Start difference. First operand 413 states and 557 transitions. Second operand has 15 states, 15 states have (on average 4.8) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-04-05 04:11:23,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:23,776 INFO L93 Difference]: Finished difference Result 420 states and 559 transitions. [2022-04-05 04:11:23,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 04:11:23,776 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2022-04-05 04:11:23,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:23,779 INFO L225 Difference]: With dead ends: 420 [2022-04-05 04:11:23,779 INFO L226 Difference]: Without dead ends: 420 [2022-04-05 04:11:23,779 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-04-05 04:11:23,779 INFO L913 BasicCegarLoop]: 217 mSDtfsCounter, 156 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 1156 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:23,780 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 1253 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1156 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-05 04:11:23,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-04-05 04:11:23,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 408. [2022-04-05 04:11:23,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 302 states have (on average 1.2483443708609272) internal successors, (377), 309 states have internal predecessors, (377), 71 states have call successors, (71), 32 states have call predecessors, (71), 34 states have return successors, (92), 67 states have call predecessors, (92), 66 states have call successors, (92) [2022-04-05 04:11:23,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 540 transitions. [2022-04-05 04:11:23,787 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 540 transitions. Word has length 121 [2022-04-05 04:11:23,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:23,787 INFO L478 AbstractCegarLoop]: Abstraction has 408 states and 540 transitions. [2022-04-05 04:11:23,787 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.8) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-04-05 04:11:23,788 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 540 transitions. [2022-04-05 04:11:23,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-05 04:11:23,789 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:23,789 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:23,789 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-05 04:11:23,789 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:23,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:23,789 INFO L85 PathProgramCache]: Analyzing trace with hash -474317813, now seen corresponding path program 1 times [2022-04-05 04:11:23,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:23,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918225362] [2022-04-05 04:11:23,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:23,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:23,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-05 04:11:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:11:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:23,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-05 04:11:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-04-05 04:11:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:23,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-05 04:11:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:24,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:24,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:24,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:24,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-05 04:11:24,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:24,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918225362] [2022-04-05 04:11:24,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918225362] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:24,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:24,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-05 04:11:24,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128865929] [2022-04-05 04:11:24,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:24,012 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-05 04:11:24,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:24,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-05 04:11:24,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-04-05 04:11:24,014 INFO L87 Difference]: Start difference. First operand 408 states and 540 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-04-05 04:11:24,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:24,573 INFO L93 Difference]: Finished difference Result 547 states and 788 transitions. [2022-04-05 04:11:24,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 04:11:24,573 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) Word has length 122 [2022-04-05 04:11:24,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:24,575 INFO L225 Difference]: With dead ends: 547 [2022-04-05 04:11:24,575 INFO L226 Difference]: Without dead ends: 547 [2022-04-05 04:11:24,576 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-04-05 04:11:24,577 INFO L913 BasicCegarLoop]: 273 mSDtfsCounter, 196 mSDsluCounter, 1234 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 1507 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:24,577 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 1507 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-05 04:11:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-04-05 04:11:24,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 399. [2022-04-05 04:11:24,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 294 states have (on average 1.248299319727891) internal successors, (367), 301 states have internal predecessors, (367), 71 states have call successors, (71), 32 states have call predecessors, (71), 33 states have return successors, (91), 66 states have call predecessors, (91), 66 states have call successors, (91) [2022-04-05 04:11:24,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 529 transitions. [2022-04-05 04:11:24,586 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 529 transitions. Word has length 122 [2022-04-05 04:11:24,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:24,586 INFO L478 AbstractCegarLoop]: Abstraction has 399 states and 529 transitions. [2022-04-05 04:11:24,586 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (17), 11 states have call predecessors, (17), 3 states have return successors, (12), 3 states have call predecessors, (12), 1 states have call successors, (12) [2022-04-05 04:11:24,586 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 529 transitions. [2022-04-05 04:11:24,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-05 04:11:24,587 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:24,587 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:24,587 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-05 04:11:24,587 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:24,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:24,588 INFO L85 PathProgramCache]: Analyzing trace with hash -286096315, now seen corresponding path program 1 times [2022-04-05 04:11:24,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:24,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365145058] [2022-04-05 04:11:24,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:24,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:24,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:24,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:24,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:24,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:24,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-04-05 04:11:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:24,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-04-05 04:11:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:24,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:24,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:11:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:24,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:24,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:24,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:24,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:24,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-04-05 04:11:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:24,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-04-05 04:11:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:24,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-04-05 04:11:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:24,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:24,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-04-05 04:11:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:24,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-05 04:11:24,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:24,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365145058] [2022-04-05 04:11:24,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365145058] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:24,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:24,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-05 04:11:24,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778262114] [2022-04-05 04:11:24,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:24,984 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-05 04:11:24,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:24,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-05 04:11:24,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2022-04-05 04:11:24,984 INFO L87 Difference]: Start difference. First operand 399 states and 529 transitions. Second operand has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-05 04:11:26,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:26,061 INFO L93 Difference]: Finished difference Result 413 states and 548 transitions. [2022-04-05 04:11:26,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-05 04:11:26,062 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) Word has length 119 [2022-04-05 04:11:26,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:26,080 INFO L225 Difference]: With dead ends: 413 [2022-04-05 04:11:26,080 INFO L226 Difference]: Without dead ends: 354 [2022-04-05 04:11:26,081 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=262, Invalid=1718, Unknown=0, NotChecked=0, Total=1980 [2022-04-05 04:11:26,081 INFO L913 BasicCegarLoop]: 178 mSDtfsCounter, 398 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 2771 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 2963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 2771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:26,082 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [399 Valid, 492 Invalid, 2963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 2771 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-05 04:11:26,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-04-05 04:11:26,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 341. [2022-04-05 04:11:26,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 250 states have (on average 1.18) internal successors, (295), 255 states have internal predecessors, (295), 64 states have call successors, (64), 29 states have call predecessors, (64), 26 states have return successors, (77), 56 states have call predecessors, (77), 58 states have call successors, (77) [2022-04-05 04:11:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 436 transitions. [2022-04-05 04:11:26,115 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 436 transitions. Word has length 119 [2022-04-05 04:11:26,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:26,115 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 436 transitions. [2022-04-05 04:11:26,115 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.48) internal successors, (87), 11 states have internal predecessors, (87), 5 states have call successors, (17), 13 states have call predecessors, (17), 4 states have return successors, (15), 6 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-05 04:11:26,115 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 436 transitions. [2022-04-05 04:11:26,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-05 04:11:26,116 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:26,116 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-05 04:11:26,116 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-05 04:11:26,116 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:26,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:26,117 INFO L85 PathProgramCache]: Analyzing trace with hash 762913287, now seen corresponding path program 1 times [2022-04-05 04:11:26,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:26,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965518503] [2022-04-05 04:11:26,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:26,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:26,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-05 04:11:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:11:26,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:26,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-05 04:11:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-04-05 04:11:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-05 04:11:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:26,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-05 04:11:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-05 04:11:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-04-05 04:11:26,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:26,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965518503] [2022-04-05 04:11:26,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965518503] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 04:11:26,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656109279] [2022-04-05 04:11:26,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:26,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 04:11:26,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 04:11:26,412 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 04:11:26,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-05 04:11:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:26,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 1329 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-05 04:11:26,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 04:11:26,823 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-04-05 04:11:26,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-05 04:11:26,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656109279] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:26,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-05 04:11:26,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [15] total 16 [2022-04-05 04:11:26,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054774564] [2022-04-05 04:11:26,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:26,824 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-05 04:11:26,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:26,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-05 04:11:26,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-04-05 04:11:26,825 INFO L87 Difference]: Start difference. First operand 341 states and 436 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-05 04:11:26,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:26,830 INFO L93 Difference]: Finished difference Result 341 states and 434 transitions. [2022-04-05 04:11:26,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-05 04:11:26,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 163 [2022-04-05 04:11:26,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:26,832 INFO L225 Difference]: With dead ends: 341 [2022-04-05 04:11:26,832 INFO L226 Difference]: Without dead ends: 341 [2022-04-05 04:11:26,832 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-04-05 04:11:26,833 INFO L913 BasicCegarLoop]: 173 mSDtfsCounter, 28 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:26,833 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 301 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 04:11:26,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-04-05 04:11:26,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2022-04-05 04:11:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 250 states have (on average 1.172) internal successors, (293), 255 states have internal predecessors, (293), 64 states have call successors, (64), 29 states have call predecessors, (64), 26 states have return successors, (77), 56 states have call predecessors, (77), 58 states have call successors, (77) [2022-04-05 04:11:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 434 transitions. [2022-04-05 04:11:26,837 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 434 transitions. Word has length 163 [2022-04-05 04:11:26,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:26,838 INFO L478 AbstractCegarLoop]: Abstraction has 341 states and 434 transitions. [2022-04-05 04:11:26,838 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-04-05 04:11:26,838 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 434 transitions. [2022-04-05 04:11:26,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-05 04:11:26,839 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:26,839 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-05 04:11:26,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-05 04:11:27,039 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-05 04:11:27,040 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:27,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:27,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1424868086, now seen corresponding path program 1 times [2022-04-05 04:11:27,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:27,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049371449] [2022-04-05 04:11:27,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:27,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:27,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-05 04:11:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:11:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:27,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-05 04:11:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-04-05 04:11:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-05 04:11:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:27,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:27,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-04-05 04:11:27,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-04-05 04:11:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,269 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-04-05 04:11:27,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:27,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049371449] [2022-04-05 04:11:27,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049371449] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-05 04:11:27,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641325477] [2022-04-05 04:11:27,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:27,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-05 04:11:27,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-05 04:11:27,271 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-05 04:11:27,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-05 04:11:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:27,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 1325 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-05 04:11:27,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-05 04:11:27,673 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-05 04:11:27,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-05 04:11:27,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641325477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:27,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-05 04:11:27,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 15 [2022-04-05 04:11:27,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003152664] [2022-04-05 04:11:27,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:27,674 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-05 04:11:27,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:27,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-05 04:11:27,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-04-05 04:11:27,674 INFO L87 Difference]: Start difference. First operand 341 states and 434 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-04-05 04:11:27,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:27,712 INFO L93 Difference]: Finished difference Result 374 states and 481 transitions. [2022-04-05 04:11:27,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-05 04:11:27,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 163 [2022-04-05 04:11:27,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:27,713 INFO L225 Difference]: With dead ends: 374 [2022-04-05 04:11:27,713 INFO L226 Difference]: Without dead ends: 372 [2022-04-05 04:11:27,714 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-04-05 04:11:27,714 INFO L913 BasicCegarLoop]: 171 mSDtfsCounter, 12 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:27,714 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 821 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-05 04:11:27,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-04-05 04:11:27,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 361. [2022-04-05 04:11:27,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 268 states have (on average 1.1604477611940298) internal successors, (311), 273 states have internal predecessors, (311), 64 states have call successors, (64), 29 states have call predecessors, (64), 28 states have return successors, (88), 58 states have call predecessors, (88), 58 states have call successors, (88) [2022-04-05 04:11:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 463 transitions. [2022-04-05 04:11:27,719 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 463 transitions. Word has length 163 [2022-04-05 04:11:27,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:27,719 INFO L478 AbstractCegarLoop]: Abstraction has 361 states and 463 transitions. [2022-04-05 04:11:27,720 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2022-04-05 04:11:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 463 transitions. [2022-04-05 04:11:27,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-04-05 04:11:27,721 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:27,721 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-04-05 04:11:27,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-05 04:11:27,941 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2022-04-05 04:11:27,941 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:27,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:27,941 INFO L85 PathProgramCache]: Analyzing trace with hash -589316084, now seen corresponding path program 1 times [2022-04-05 04:11:27,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:27,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54470610] [2022-04-05 04:11:27,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:27,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:28,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:28,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-05 04:11:28,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:11:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:28,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-05 04:11:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-04-05 04:11:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-05 04:11:28,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-05 04:11:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-05 04:11:28,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:28,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,199 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-04-05 04:11:28,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:28,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54470610] [2022-04-05 04:11:28,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54470610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:28,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:28,200 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-05 04:11:28,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337340483] [2022-04-05 04:11:28,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:28,200 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-05 04:11:28,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:28,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-05 04:11:28,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-04-05 04:11:28,200 INFO L87 Difference]: Start difference. First operand 361 states and 463 transitions. Second operand has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-05 04:11:28,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:28,693 INFO L93 Difference]: Finished difference Result 428 states and 566 transitions. [2022-04-05 04:11:28,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 04:11:28,694 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) Word has length 164 [2022-04-05 04:11:28,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:28,695 INFO L225 Difference]: With dead ends: 428 [2022-04-05 04:11:28,695 INFO L226 Difference]: Without dead ends: 428 [2022-04-05 04:11:28,696 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-04-05 04:11:28,696 INFO L913 BasicCegarLoop]: 215 mSDtfsCounter, 150 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:28,696 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 1135 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-05 04:11:28,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-04-05 04:11:28,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 345. [2022-04-05 04:11:28,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 256 states have (on average 1.14453125) internal successors, (293), 260 states have internal predecessors, (293), 60 states have call successors, (60), 29 states have call predecessors, (60), 28 states have return successors, (80), 55 states have call predecessors, (80), 54 states have call successors, (80) [2022-04-05 04:11:28,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 433 transitions. [2022-04-05 04:11:28,702 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 433 transitions. Word has length 164 [2022-04-05 04:11:28,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:28,702 INFO L478 AbstractCegarLoop]: Abstraction has 345 states and 433 transitions. [2022-04-05 04:11:28,702 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.4) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (19), 11 states have call predecessors, (19), 3 states have return successors, (14), 3 states have call predecessors, (14), 1 states have call successors, (14) [2022-04-05 04:11:28,702 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 433 transitions. [2022-04-05 04:11:28,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2022-04-05 04:11:28,704 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:28,704 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-04-05 04:11:28,704 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-04-05 04:11:28,705 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:28,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:28,705 INFO L85 PathProgramCache]: Analyzing trace with hash -158276280, now seen corresponding path program 1 times [2022-04-05 04:11:28,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:28,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228477723] [2022-04-05 04:11:28,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:28,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:28,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-05 04:11:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:11:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:28,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:28,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-05 04:11:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-04-05 04:11:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-05 04:11:28,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:28,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-05 04:11:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-05 04:11:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:28,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:28,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-04-05 04:11:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-04-05 04:11:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:28,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:28,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:28,954 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-04-05 04:11:28,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:28,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228477723] [2022-04-05 04:11:28,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228477723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:28,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:28,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-05 04:11:28,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828008542] [2022-04-05 04:11:28,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:28,955 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-05 04:11:28,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:28,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-05 04:11:28,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-04-05 04:11:28,956 INFO L87 Difference]: Start difference. First operand 345 states and 433 transitions. Second operand has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2022-04-05 04:11:29,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:29,368 INFO L93 Difference]: Finished difference Result 354 states and 451 transitions. [2022-04-05 04:11:29,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 04:11:29,369 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) Word has length 204 [2022-04-05 04:11:29,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:29,370 INFO L225 Difference]: With dead ends: 354 [2022-04-05 04:11:29,370 INFO L226 Difference]: Without dead ends: 354 [2022-04-05 04:11:29,370 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-04-05 04:11:29,371 INFO L913 BasicCegarLoop]: 191 mSDtfsCounter, 148 mSDsluCounter, 724 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:29,371 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 915 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-05 04:11:29,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-04-05 04:11:29,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 309. [2022-04-05 04:11:29,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 231 states have (on average 1.1255411255411256) internal successors, (260), 234 states have internal predecessors, (260), 52 states have call successors, (52), 24 states have call predecessors, (52), 25 states have return successors, (73), 50 states have call predecessors, (73), 47 states have call successors, (73) [2022-04-05 04:11:29,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 385 transitions. [2022-04-05 04:11:29,376 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 385 transitions. Word has length 204 [2022-04-05 04:11:29,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:29,376 INFO L478 AbstractCegarLoop]: Abstraction has 309 states and 385 transitions. [2022-04-05 04:11:29,376 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.733333333333333) internal successors, (86), 5 states have internal predecessors, (86), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2022-04-05 04:11:29,376 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 385 transitions. [2022-04-05 04:11:29,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2022-04-05 04:11:29,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-05 04:11:29,378 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2022-04-05 04:11:29,378 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-04-05 04:11:29,378 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-05 04:11:29,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-05 04:11:29,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1341132510, now seen corresponding path program 1 times [2022-04-05 04:11:29,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-05 04:11:29,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015805395] [2022-04-05 04:11:29,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-05 04:11:29,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-05 04:11:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-05 04:11:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-05 04:11:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-05 04:11:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-05 04:11:29,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-04-05 04:11:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-04-05 04:11:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-04-05 04:11:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-05 04:11:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:29,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-04-05 04:11:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-04-05 04:11:29,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-04-05 04:11:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-04-05 04:11:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-04-05 04:11:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-04-05 04:11:29,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-04-05 04:11:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-05 04:11:29,679 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-04-05 04:11:29,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-05 04:11:29,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015805395] [2022-04-05 04:11:29,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015805395] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-05 04:11:29,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-05 04:11:29,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-05 04:11:29,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561893291] [2022-04-05 04:11:29,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-05 04:11:29,679 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-05 04:11:29,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-05 04:11:29,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-05 04:11:29,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-04-05 04:11:29,680 INFO L87 Difference]: Start difference. First operand 309 states and 385 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2022-04-05 04:11:29,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-05 04:11:29,983 INFO L93 Difference]: Finished difference Result 290 states and 362 transitions. [2022-04-05 04:11:29,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-05 04:11:29,983 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) Word has length 207 [2022-04-05 04:11:29,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-05 04:11:29,984 INFO L225 Difference]: With dead ends: 290 [2022-04-05 04:11:29,984 INFO L226 Difference]: Without dead ends: 0 [2022-04-05 04:11:29,984 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2022-04-05 04:11:29,984 INFO L913 BasicCegarLoop]: 153 mSDtfsCounter, 146 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-05 04:11:29,984 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 663 Invalid, 625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-05 04:11:29,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-05 04:11:29,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-05 04:11:29,985 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-04-05 04:11:29,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-05 04:11:29,985 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 207 [2022-04-05 04:11:29,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-05 04:11:29,985 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-05 04:11:29,985 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 5 states have internal predecessors, (89), 2 states have call successors, (21), 11 states have call predecessors, (21), 3 states have return successors, (16), 3 states have call predecessors, (16), 1 states have call successors, (16) [2022-04-05 04:11:29,985 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-05 04:11:29,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-05 04:11:29,987 INFO L788 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-05 04:11:29,987 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-04-05 04:11:29,989 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-05 04:11:29,990 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-05 04:11:29,993 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.04 04:11:29 BasicIcfg [2022-04-05 04:11:29,993 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-05 04:11:29,993 INFO L158 Benchmark]: Toolchain (without parser) took 44255.13ms. Allocated memory was 192.9MB in the beginning and 407.9MB in the end (delta: 215.0MB). Free memory was 138.4MB in the beginning and 289.8MB in the end (delta: -151.4MB). Peak memory consumption was 64.6MB. Max. memory is 8.0GB. [2022-04-05 04:11:29,994 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 192.9MB. Free memory was 156.0MB in the beginning and 155.9MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-05 04:11:29,994 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.24ms. Allocated memory is still 192.9MB. Free memory was 138.3MB in the beginning and 156.1MB in the end (delta: -17.8MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. [2022-04-05 04:11:29,994 INFO L158 Benchmark]: Boogie Preprocessor took 77.45ms. Allocated memory is still 192.9MB. Free memory was 156.1MB in the beginning and 152.7MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-05 04:11:29,994 INFO L158 Benchmark]: RCFGBuilder took 1042.76ms. Allocated memory is still 192.9MB. Free memory was 152.7MB in the beginning and 160.5MB in the end (delta: -7.8MB). Peak memory consumption was 40.6MB. Max. memory is 8.0GB. [2022-04-05 04:11:29,994 INFO L158 Benchmark]: IcfgTransformer took 52.01ms. Allocated memory is still 192.9MB. Free memory was 160.5MB in the beginning and 155.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2022-04-05 04:11:29,995 INFO L158 Benchmark]: TraceAbstraction took 42718.53ms. Allocated memory was 192.9MB in the beginning and 407.9MB in the end (delta: 215.0MB). Free memory was 154.8MB in the beginning and 289.8MB in the end (delta: -135.0MB). Peak memory consumption was 80.4MB. Max. memory is 8.0GB. [2022-04-05 04:11:30,001 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 192.9MB. Free memory was 156.0MB in the beginning and 155.9MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 358.24ms. Allocated memory is still 192.9MB. Free memory was 138.3MB in the beginning and 156.1MB in the end (delta: -17.8MB). Peak memory consumption was 13.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 77.45ms. Allocated memory is still 192.9MB. Free memory was 156.1MB in the beginning and 152.7MB in the end (delta: 3.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1042.76ms. Allocated memory is still 192.9MB. Free memory was 152.7MB in the beginning and 160.5MB in the end (delta: -7.8MB). Peak memory consumption was 40.6MB. Max. memory is 8.0GB. * IcfgTransformer took 52.01ms. Allocated memory is still 192.9MB. Free memory was 160.5MB in the beginning and 155.3MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * TraceAbstraction took 42718.53ms. Allocated memory was 192.9MB in the beginning and 407.9MB in the end (delta: 215.0MB). Free memory was 154.8MB in the beginning and 289.8MB in the end (delta: -135.0MB). Peak memory consumption was 80.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 56]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 27 procedures, 295 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.7s, OverallIterations: 47, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 31.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14843 SdHoareTripleChecker+Valid, 26.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14663 mSDsluCounter, 50814 SdHoareTripleChecker+Invalid, 22.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 37763 mSDsCounter, 6499 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 48280 IncrementalHoareTripleChecker+Invalid, 54779 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6499 mSolverCounterUnsat, 13051 mSDtfsCounter, 48280 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1716 GetRequests, 1005 SyntacticMatches, 9 SemanticMatches, 702 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 8.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1085occurred in iteration=8, InterpolantAutomatonStates: 542, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 47 MinimizatonAttempts, 2092 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 3800 NumberOfCodeBlocks, 3800 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3751 ConstructedInterpolants, 0 QuantifiedInterpolants, 14828 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2654 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 49 InterpolantComputations, 47 PerfectInterpolantSequences, 835/847 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-05 04:11:30,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...