./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:54:07,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:54:07,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:54:07,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:54:07,060 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:54:07,061 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:54:07,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:54:07,069 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:54:07,071 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:54:07,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:54:07,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:54:07,077 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:54:07,078 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:54:07,079 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:54:07,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:54:07,082 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:54:07,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:54:07,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:54:07,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:54:07,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:54:07,091 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:54:07,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:54:07,093 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:54:07,094 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:54:07,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:54:07,099 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:54:07,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:54:07,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:54:07,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:54:07,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:54:07,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:54:07,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:54:07,103 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:54:07,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:54:07,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:54:07,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:54:07,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:54:07,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:54:07,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:54:07,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:54:07,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:54:07,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:54:07,108 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:54:07,125 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:54:07,126 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:54:07,127 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:54:07,127 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:54:07,127 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:54:07,127 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:54:07,128 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:54:07,128 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:54:07,128 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:54:07,129 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:54:07,129 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:54:07,129 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:54:07,129 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:54:07,130 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:54:07,130 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:54:07,130 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:54:07,130 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:54:07,130 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:54:07,130 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:54:07,130 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:54:07,131 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:54:07,131 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:54:07,131 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:54:07,131 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:54:07,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:54:07,132 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:54:07,132 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:54:07,132 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:54:07,132 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:54:07,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:54:07,132 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:54:07,133 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:54:07,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:54:07,133 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c [2022-07-19 10:54:07,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:54:07,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:54:07,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:54:07,358 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:54:07,359 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:54:07,360 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2022-07-19 10:54:07,402 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15c4eda27/6239e05a0b1d47aba7f14cda6506cbb7/FLAGb8ad4ebd9 [2022-07-19 10:54:07,822 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:54:07,830 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2022-07-19 10:54:07,855 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15c4eda27/6239e05a0b1d47aba7f14cda6506cbb7/FLAGb8ad4ebd9 [2022-07-19 10:54:07,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15c4eda27/6239e05a0b1d47aba7f14cda6506cbb7 [2022-07-19 10:54:07,872 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:54:07,873 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:54:07,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:54:07,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:54:07,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:54:07,877 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:54:07" (1/1) ... [2022-07-19 10:54:07,878 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3476e3ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:54:07, skipping insertion in model container [2022-07-19 10:54:07,878 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:54:07" (1/1) ... [2022-07-19 10:54:07,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:54:07,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:54:08,074 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2022-07-19 10:54:08,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:54:08,147 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:54:08,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2022-07-19 10:54:08,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:54:08,209 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:54:08,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:54:08 WrapperNode [2022-07-19 10:54:08,210 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:54:08,211 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:54:08,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:54:08,211 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:54:08,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:54:08" (1/1) ... [2022-07-19 10:54:08,225 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:54:08" (1/1) ... [2022-07-19 10:54:08,250 INFO L137 Inliner]: procedures = 38, calls = 66, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 755 [2022-07-19 10:54:08,250 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:54:08,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:54:08,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:54:08,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:54:08,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:54:08" (1/1) ... [2022-07-19 10:54:08,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:54:08" (1/1) ... [2022-07-19 10:54:08,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:54:08" (1/1) ... [2022-07-19 10:54:08,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:54:08" (1/1) ... [2022-07-19 10:54:08,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:54:08" (1/1) ... [2022-07-19 10:54:08,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:54:08" (1/1) ... [2022-07-19 10:54:08,296 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:54:08" (1/1) ... [2022-07-19 10:54:08,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:54:08,304 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:54:08,304 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:54:08,304 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:54:08,305 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:54:08" (1/1) ... [2022-07-19 10:54:08,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:54:08,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:54:08,330 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-07-19 10:54:08,347 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-07-19 10:54:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:54:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-19 10:54:08,368 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-19 10:54:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-07-19 10:54:08,369 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-07-19 10:54:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-19 10:54:08,369 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-19 10:54:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-07-19 10:54:08,369 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-07-19 10:54:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2022-07-19 10:54:08,369 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2022-07-19 10:54:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-19 10:54:08,370 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-19 10:54:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:54:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-19 10:54:08,370 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-19 10:54:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2022-07-19 10:54:08,370 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2022-07-19 10:54:08,371 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2022-07-19 10:54:08,371 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2022-07-19 10:54:08,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:54:08,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:54:08,488 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:54:08,491 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:54:08,495 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:54:08,581 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-07-19 10:54:08,582 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-07-19 10:54:08,583 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:54:08,596 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-07-19 10:54:08,596 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-07-19 10:54:08,621 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:54:08,633 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:54:08,645 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:54:08,872 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume !false; [2022-07-19 10:54:08,872 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume false; [2022-07-19 10:54:08,873 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-07-19 10:54:08,873 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-07-19 10:54:08,873 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2022-07-19 10:54:08,873 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2022-07-19 10:54:08,874 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-19 10:54:08,896 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-07-19 10:54:08,896 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-07-19 10:54:08,936 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:54:08,946 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:54:08,948 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 10:54:08,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:54:08 BoogieIcfgContainer [2022-07-19 10:54:08,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:54:08,951 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:54:08,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:54:08,954 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:54:08,954 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:54:07" (1/3) ... [2022-07-19 10:54:08,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2234626a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:54:08, skipping insertion in model container [2022-07-19 10:54:08,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:54:08" (2/3) ... [2022-07-19 10:54:08,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2234626a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:54:08, skipping insertion in model container [2022-07-19 10:54:08,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:54:08" (3/3) ... [2022-07-19 10:54:08,957 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2022-07-19 10:54:08,967 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:54:08,967 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:54:09,021 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:54:09,027 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@53c13f41, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1afe8845 [2022-07-19 10:54:09,027 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:54:09,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 243 states, 188 states have (on average 1.4680851063829787) internal successors, (276), 205 states have internal predecessors, (276), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2022-07-19 10:54:09,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-19 10:54:09,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:09,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:09,052 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:09,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:09,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1911400740, now seen corresponding path program 1 times [2022-07-19 10:54:09,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:09,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164044285] [2022-07-19 10:54:09,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:09,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:09,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:09,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:09,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164044285] [2022-07-19 10:54:09,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164044285] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:09,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:09,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:54:09,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647300916] [2022-07-19 10:54:09,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:09,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:54:09,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:09,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:54:09,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:54:09,251 INFO L87 Difference]: Start difference. First operand has 243 states, 188 states have (on average 1.4680851063829787) internal successors, (276), 205 states have internal predecessors, (276), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:09,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:09,385 INFO L93 Difference]: Finished difference Result 449 states and 690 transitions. [2022-07-19 10:54:09,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:54:09,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-19 10:54:09,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:09,396 INFO L225 Difference]: With dead ends: 449 [2022-07-19 10:54:09,396 INFO L226 Difference]: Without dead ends: 236 [2022-07-19 10:54:09,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:54:09,405 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 8 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:09,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 635 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:54:09,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-19 10:54:09,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2022-07-19 10:54:09,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 183 states have (on average 1.4098360655737705) internal successors, (258), 198 states have internal predecessors, (258), 44 states have call successors, (44), 9 states have call predecessors, (44), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-19 10:54:09,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 332 transitions. [2022-07-19 10:54:09,461 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 332 transitions. Word has length 13 [2022-07-19 10:54:09,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:09,462 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 332 transitions. [2022-07-19 10:54:09,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:09,463 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 332 transitions. [2022-07-19 10:54:09,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 10:54:09,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:09,464 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:09,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:54:09,465 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:09,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1078790828, now seen corresponding path program 1 times [2022-07-19 10:54:09,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:09,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398142197] [2022-07-19 10:54:09,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:09,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:09,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:09,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:09,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:09,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398142197] [2022-07-19 10:54:09,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398142197] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:09,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:09,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:54:09,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033323552] [2022-07-19 10:54:09,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:09,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:54:09,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:09,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:54:09,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:54:09,517 INFO L87 Difference]: Start difference. First operand 236 states and 332 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:09,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:09,664 INFO L93 Difference]: Finished difference Result 536 states and 777 transitions. [2022-07-19 10:54:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:54:09,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-19 10:54:09,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:09,670 INFO L225 Difference]: With dead ends: 536 [2022-07-19 10:54:09,671 INFO L226 Difference]: Without dead ends: 377 [2022-07-19 10:54:09,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:54:09,676 INFO L413 NwaCegarLoop]: 455 mSDtfsCounter, 250 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:09,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 680 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:54:09,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-19 10:54:09,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 357. [2022-07-19 10:54:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 283 states have (on average 1.3851590106007068) internal successors, (392), 291 states have internal predecessors, (392), 59 states have call successors, (59), 16 states have call predecessors, (59), 14 states have return successors, (67), 51 states have call predecessors, (67), 48 states have call successors, (67) [2022-07-19 10:54:09,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 518 transitions. [2022-07-19 10:54:09,715 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 518 transitions. Word has length 15 [2022-07-19 10:54:09,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:09,715 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 518 transitions. [2022-07-19 10:54:09,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:09,716 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 518 transitions. [2022-07-19 10:54:09,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 10:54:09,716 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:09,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:09,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:54:09,717 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:09,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:09,717 INFO L85 PathProgramCache]: Analyzing trace with hash -320586800, now seen corresponding path program 1 times [2022-07-19 10:54:09,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:09,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071272800] [2022-07-19 10:54:09,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:09,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:09,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:09,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:09,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:09,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071272800] [2022-07-19 10:54:09,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071272800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:09,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:09,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:54:09,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662998219] [2022-07-19 10:54:09,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:09,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:54:09,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:09,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:54:09,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:54:09,805 INFO L87 Difference]: Start difference. First operand 357 states and 518 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:09,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:09,839 INFO L93 Difference]: Finished difference Result 823 states and 1229 transitions. [2022-07-19 10:54:09,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:54:09,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-19 10:54:09,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:09,847 INFO L225 Difference]: With dead ends: 823 [2022-07-19 10:54:09,847 INFO L226 Difference]: Without dead ends: 550 [2022-07-19 10:54:09,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:54:09,853 INFO L413 NwaCegarLoop]: 365 mSDtfsCounter, 255 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:09,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 578 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:54:09,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-07-19 10:54:09,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 519. [2022-07-19 10:54:09,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 411 states have (on average 1.389294403892944) internal successors, (571), 418 states have internal predecessors, (571), 84 states have call successors, (84), 24 states have call predecessors, (84), 23 states have return successors, (117), 77 states have call predecessors, (117), 74 states have call successors, (117) [2022-07-19 10:54:09,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 772 transitions. [2022-07-19 10:54:09,895 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 772 transitions. Word has length 20 [2022-07-19 10:54:09,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:09,897 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 772 transitions. [2022-07-19 10:54:09,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:09,897 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 772 transitions. [2022-07-19 10:54:09,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-19 10:54:09,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:09,899 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:54:09,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 10:54:09,900 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:09,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:09,900 INFO L85 PathProgramCache]: Analyzing trace with hash -175921138, now seen corresponding path program 1 times [2022-07-19 10:54:09,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:09,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906547367] [2022-07-19 10:54:09,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:09,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:09,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:09,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906547367] [2022-07-19 10:54:09,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906547367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:09,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:09,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:54:09,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456472036] [2022-07-19 10:54:09,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:09,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:54:09,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:09,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:54:09,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:54:09,937 INFO L87 Difference]: Start difference. First operand 519 states and 772 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:09,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:09,985 INFO L93 Difference]: Finished difference Result 534 states and 792 transitions. [2022-07-19 10:54:09,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:54:09,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-19 10:54:09,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:09,990 INFO L225 Difference]: With dead ends: 534 [2022-07-19 10:54:09,990 INFO L226 Difference]: Without dead ends: 530 [2022-07-19 10:54:09,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:54:09,992 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 21 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:09,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 557 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:54:09,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-07-19 10:54:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 529. [2022-07-19 10:54:10,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 422 states have (on average 1.386255924170616) internal successors, (585), 427 states have internal predecessors, (585), 83 states have call successors, (83), 25 states have call predecessors, (83), 23 states have return successors, (117), 77 states have call predecessors, (117), 74 states have call successors, (117) [2022-07-19 10:54:10,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 785 transitions. [2022-07-19 10:54:10,033 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 785 transitions. Word has length 24 [2022-07-19 10:54:10,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:10,034 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 785 transitions. [2022-07-19 10:54:10,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:10,034 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 785 transitions. [2022-07-19 10:54:10,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-19 10:54:10,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:10,039 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:54:10,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 10:54:10,039 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:10,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:10,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1035800982, now seen corresponding path program 1 times [2022-07-19 10:54:10,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:10,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312251435] [2022-07-19 10:54:10,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:10,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:10,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 10:54:10,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:10,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:10,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:10,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312251435] [2022-07-19 10:54:10,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312251435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:10,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:10,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:54:10,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643140045] [2022-07-19 10:54:10,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:10,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:54:10,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:10,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:54:10,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:54:10,126 INFO L87 Difference]: Start difference. First operand 529 states and 785 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:10,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:10,405 INFO L93 Difference]: Finished difference Result 582 states and 861 transitions. [2022-07-19 10:54:10,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:54:10,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-07-19 10:54:10,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:10,409 INFO L225 Difference]: With dead ends: 582 [2022-07-19 10:54:10,409 INFO L226 Difference]: Without dead ends: 571 [2022-07-19 10:54:10,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:54:10,410 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 410 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:10,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 798 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:54:10,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-07-19 10:54:10,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 556. [2022-07-19 10:54:10,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 447 states have (on average 1.3803131991051454) internal successors, (617), 454 states have internal predecessors, (617), 83 states have call successors, (83), 25 states have call predecessors, (83), 25 states have return successors, (126), 77 states have call predecessors, (126), 74 states have call successors, (126) [2022-07-19 10:54:10,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 826 transitions. [2022-07-19 10:54:10,448 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 826 transitions. Word has length 27 [2022-07-19 10:54:10,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:10,448 INFO L495 AbstractCegarLoop]: Abstraction has 556 states and 826 transitions. [2022-07-19 10:54:10,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:10,448 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 826 transitions. [2022-07-19 10:54:10,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 10:54:10,450 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:10,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:10,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 10:54:10,450 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:10,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:10,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1813713707, now seen corresponding path program 1 times [2022-07-19 10:54:10,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:10,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076126573] [2022-07-19 10:54:10,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:10,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:10,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 10:54:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:10,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:10,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:10,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076126573] [2022-07-19 10:54:10,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076126573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:10,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:10,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:54:10,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527033012] [2022-07-19 10:54:10,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:10,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:54:10,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:10,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:54:10,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:54:10,555 INFO L87 Difference]: Start difference. First operand 556 states and 826 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:10,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:10,830 INFO L93 Difference]: Finished difference Result 579 states and 854 transitions. [2022-07-19 10:54:10,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:54:10,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-07-19 10:54:10,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:10,833 INFO L225 Difference]: With dead ends: 579 [2022-07-19 10:54:10,833 INFO L226 Difference]: Without dead ends: 571 [2022-07-19 10:54:10,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:54:10,834 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 408 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:10,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 799 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:54:10,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-07-19 10:54:10,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 556. [2022-07-19 10:54:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 447 states have (on average 1.378076062639821) internal successors, (616), 454 states have internal predecessors, (616), 83 states have call successors, (83), 25 states have call predecessors, (83), 25 states have return successors, (126), 77 states have call predecessors, (126), 74 states have call successors, (126) [2022-07-19 10:54:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 825 transitions. [2022-07-19 10:54:10,852 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 825 transitions. Word has length 28 [2022-07-19 10:54:10,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:10,862 INFO L495 AbstractCegarLoop]: Abstraction has 556 states and 825 transitions. [2022-07-19 10:54:10,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:10,863 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 825 transitions. [2022-07-19 10:54:10,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-19 10:54:10,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:10,864 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:54:10,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 10:54:10,864 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:10,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:10,865 INFO L85 PathProgramCache]: Analyzing trace with hash 123360193, now seen corresponding path program 1 times [2022-07-19 10:54:10,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:10,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827112702] [2022-07-19 10:54:10,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:10,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:10,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 10:54:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:10,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:10,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827112702] [2022-07-19 10:54:10,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827112702] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:10,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:10,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:54:10,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862936736] [2022-07-19 10:54:10,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:10,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:54:10,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:10,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:54:10,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:54:10,885 INFO L87 Difference]: Start difference. First operand 556 states and 825 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:11,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:11,038 INFO L93 Difference]: Finished difference Result 1018 states and 1542 transitions. [2022-07-19 10:54:11,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:54:11,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-07-19 10:54:11,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:11,042 INFO L225 Difference]: With dead ends: 1018 [2022-07-19 10:54:11,043 INFO L226 Difference]: Without dead ends: 989 [2022-07-19 10:54:11,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:54:11,044 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 417 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:11,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 772 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:54:11,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2022-07-19 10:54:11,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 949. [2022-07-19 10:54:11,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 759 states have (on average 1.391304347826087) internal successors, (1056), 766 states have internal predecessors, (1056), 141 states have call successors, (141), 47 states have call predecessors, (141), 48 states have return successors, (249), 137 states have call predecessors, (249), 132 states have call successors, (249) [2022-07-19 10:54:11,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1446 transitions. [2022-07-19 10:54:11,074 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1446 transitions. Word has length 29 [2022-07-19 10:54:11,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:11,074 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1446 transitions. [2022-07-19 10:54:11,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:11,075 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1446 transitions. [2022-07-19 10:54:11,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-19 10:54:11,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:11,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:11,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 10:54:11,076 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:11,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:11,076 INFO L85 PathProgramCache]: Analyzing trace with hash -462412845, now seen corresponding path program 1 times [2022-07-19 10:54:11,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:11,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172374882] [2022-07-19 10:54:11,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:11,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:11,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 10:54:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:11,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:11,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:11,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172374882] [2022-07-19 10:54:11,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172374882] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:11,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:11,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:54:11,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237374362] [2022-07-19 10:54:11,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:11,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:54:11,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:11,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:54:11,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:54:11,107 INFO L87 Difference]: Start difference. First operand 949 states and 1446 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:11,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:11,249 INFO L93 Difference]: Finished difference Result 985 states and 1494 transitions. [2022-07-19 10:54:11,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:54:11,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-07-19 10:54:11,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:11,253 INFO L225 Difference]: With dead ends: 985 [2022-07-19 10:54:11,253 INFO L226 Difference]: Without dead ends: 966 [2022-07-19 10:54:11,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:54:11,254 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 84 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:11,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 998 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:54:11,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-07-19 10:54:11,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 945. [2022-07-19 10:54:11,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 756 states have (on average 1.3915343915343916) internal successors, (1052), 763 states have internal predecessors, (1052), 140 states have call successors, (140), 47 states have call predecessors, (140), 48 states have return successors, (248), 136 states have call predecessors, (248), 131 states have call successors, (248) [2022-07-19 10:54:11,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1440 transitions. [2022-07-19 10:54:11,285 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1440 transitions. Word has length 30 [2022-07-19 10:54:11,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:11,285 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1440 transitions. [2022-07-19 10:54:11,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:11,285 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1440 transitions. [2022-07-19 10:54:11,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 10:54:11,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:11,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:11,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 10:54:11,286 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:11,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:11,287 INFO L85 PathProgramCache]: Analyzing trace with hash 415913558, now seen corresponding path program 1 times [2022-07-19 10:54:11,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:11,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884086627] [2022-07-19 10:54:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:11,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:11,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:11,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:11,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884086627] [2022-07-19 10:54:11,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884086627] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:11,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:11,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:54:11,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205347817] [2022-07-19 10:54:11,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:11,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:54:11,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:11,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:54:11,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:54:11,309 INFO L87 Difference]: Start difference. First operand 945 states and 1440 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:11,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:11,328 INFO L93 Difference]: Finished difference Result 1334 states and 2062 transitions. [2022-07-19 10:54:11,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:54:11,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-19 10:54:11,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:11,331 INFO L225 Difference]: With dead ends: 1334 [2022-07-19 10:54:11,331 INFO L226 Difference]: Without dead ends: 510 [2022-07-19 10:54:11,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:54:11,334 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 264 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:11,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 270 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:54:11,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-07-19 10:54:11,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2022-07-19 10:54:11,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 408 states have (on average 1.3553921568627452) internal successors, (553), 414 states have internal predecessors, (553), 78 states have call successors, (78), 23 states have call predecessors, (78), 23 states have return successors, (123), 73 states have call predecessors, (123), 71 states have call successors, (123) [2022-07-19 10:54:11,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 754 transitions. [2022-07-19 10:54:11,357 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 754 transitions. Word has length 34 [2022-07-19 10:54:11,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:11,357 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 754 transitions. [2022-07-19 10:54:11,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:11,357 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 754 transitions. [2022-07-19 10:54:11,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 10:54:11,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:11,358 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:11,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 10:54:11,359 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:11,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:11,359 INFO L85 PathProgramCache]: Analyzing trace with hash -2105808494, now seen corresponding path program 1 times [2022-07-19 10:54:11,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:11,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529467203] [2022-07-19 10:54:11,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:11,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:11,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 10:54:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:11,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:11,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:11,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529467203] [2022-07-19 10:54:11,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529467203] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:11,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:11,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:54:11,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688755075] [2022-07-19 10:54:11,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:11,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:54:11,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:11,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:54:11,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:54:11,390 INFO L87 Difference]: Start difference. First operand 510 states and 754 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:11,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:11,533 INFO L93 Difference]: Finished difference Result 553 states and 805 transitions. [2022-07-19 10:54:11,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:54:11,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-07-19 10:54:11,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:11,536 INFO L225 Difference]: With dead ends: 553 [2022-07-19 10:54:11,536 INFO L226 Difference]: Without dead ends: 519 [2022-07-19 10:54:11,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:54:11,537 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 94 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:11,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1167 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:54:11,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-07-19 10:54:11,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 508. [2022-07-19 10:54:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 407 states have (on average 1.3513513513513513) internal successors, (550), 413 states have internal predecessors, (550), 77 states have call successors, (77), 23 states have call predecessors, (77), 23 states have return successors, (122), 72 states have call predecessors, (122), 70 states have call successors, (122) [2022-07-19 10:54:11,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 749 transitions. [2022-07-19 10:54:11,552 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 749 transitions. Word has length 34 [2022-07-19 10:54:11,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:11,552 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 749 transitions. [2022-07-19 10:54:11,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:11,553 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 749 transitions. [2022-07-19 10:54:11,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 10:54:11,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:11,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:11,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 10:54:11,554 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:11,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:11,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1486754927, now seen corresponding path program 1 times [2022-07-19 10:54:11,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:11,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608400239] [2022-07-19 10:54:11,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:11,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:11,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:11,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 10:54:11,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:11,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:11,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:11,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608400239] [2022-07-19 10:54:11,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608400239] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:11,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:11,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:54:11,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598637233] [2022-07-19 10:54:11,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:11,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:54:11,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:11,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:54:11,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:54:11,583 INFO L87 Difference]: Start difference. First operand 508 states and 749 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:11,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:11,832 INFO L93 Difference]: Finished difference Result 720 states and 1102 transitions. [2022-07-19 10:54:11,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 10:54:11,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-07-19 10:54:11,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:11,835 INFO L225 Difference]: With dead ends: 720 [2022-07-19 10:54:11,835 INFO L226 Difference]: Without dead ends: 712 [2022-07-19 10:54:11,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:54:11,836 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 232 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:11,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 668 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:54:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-07-19 10:54:11,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 566. [2022-07-19 10:54:11,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 455 states have (on average 1.3516483516483517) internal successors, (615), 461 states have internal predecessors, (615), 84 states have call successors, (84), 25 states have call predecessors, (84), 26 states have return successors, (142), 80 states have call predecessors, (142), 77 states have call successors, (142) [2022-07-19 10:54:11,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 841 transitions. [2022-07-19 10:54:11,859 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 841 transitions. Word has length 34 [2022-07-19 10:54:11,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:11,859 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 841 transitions. [2022-07-19 10:54:11,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:11,859 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 841 transitions. [2022-07-19 10:54:11,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 10:54:11,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:11,860 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:54:11,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 10:54:11,860 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:11,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:11,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1608594996, now seen corresponding path program 1 times [2022-07-19 10:54:11,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:11,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033661444] [2022-07-19 10:54:11,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:11,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:11,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 10:54:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:11,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:11,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033661444] [2022-07-19 10:54:11,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033661444] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:11,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:11,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 10:54:11,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722490333] [2022-07-19 10:54:11,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:11,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:54:11,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:11,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:54:11,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:54:11,902 INFO L87 Difference]: Start difference. First operand 566 states and 841 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:12,170 INFO L93 Difference]: Finished difference Result 583 states and 860 transitions. [2022-07-19 10:54:12,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:54:12,170 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-07-19 10:54:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:12,173 INFO L225 Difference]: With dead ends: 583 [2022-07-19 10:54:12,173 INFO L226 Difference]: Without dead ends: 579 [2022-07-19 10:54:12,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:54:12,174 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 66 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:12,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1471 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:54:12,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2022-07-19 10:54:12,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 574. [2022-07-19 10:54:12,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 463 states have (on average 1.349892008639309) internal successors, (625), 469 states have internal predecessors, (625), 84 states have call successors, (84), 25 states have call predecessors, (84), 26 states have return successors, (142), 80 states have call predecessors, (142), 77 states have call successors, (142) [2022-07-19 10:54:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 851 transitions. [2022-07-19 10:54:12,194 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 851 transitions. Word has length 35 [2022-07-19 10:54:12,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:12,195 INFO L495 AbstractCegarLoop]: Abstraction has 574 states and 851 transitions. [2022-07-19 10:54:12,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:12,195 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 851 transitions. [2022-07-19 10:54:12,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 10:54:12,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:12,196 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:54:12,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 10:54:12,196 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:12,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:12,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1608318166, now seen corresponding path program 1 times [2022-07-19 10:54:12,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:12,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872071435] [2022-07-19 10:54:12,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:12,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:12,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 10:54:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:12,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:12,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872071435] [2022-07-19 10:54:12,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872071435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:12,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:12,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 10:54:12,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90058441] [2022-07-19 10:54:12,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:12,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:54:12,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:12,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:54:12,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:54:12,252 INFO L87 Difference]: Start difference. First operand 574 states and 851 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:12,511 INFO L93 Difference]: Finished difference Result 1065 states and 1652 transitions. [2022-07-19 10:54:12,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:54:12,511 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-07-19 10:54:12,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:12,514 INFO L225 Difference]: With dead ends: 1065 [2022-07-19 10:54:12,514 INFO L226 Difference]: Without dead ends: 605 [2022-07-19 10:54:12,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:54:12,516 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 75 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:12,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1572 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:54:12,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-07-19 10:54:12,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 586. [2022-07-19 10:54:12,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 474 states have (on average 1.3544303797468353) internal successors, (642), 481 states have internal predecessors, (642), 84 states have call successors, (84), 25 states have call predecessors, (84), 27 states have return successors, (161), 80 states have call predecessors, (161), 77 states have call successors, (161) [2022-07-19 10:54:12,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 887 transitions. [2022-07-19 10:54:12,539 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 887 transitions. Word has length 35 [2022-07-19 10:54:12,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:12,539 INFO L495 AbstractCegarLoop]: Abstraction has 586 states and 887 transitions. [2022-07-19 10:54:12,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:12,539 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 887 transitions. [2022-07-19 10:54:12,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-19 10:54:12,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:12,540 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:12,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 10:54:12,540 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:12,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:12,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1299938960, now seen corresponding path program 1 times [2022-07-19 10:54:12,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:12,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68094251] [2022-07-19 10:54:12,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:12,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:12,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:12,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:12,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68094251] [2022-07-19 10:54:12,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68094251] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:12,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:12,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:54:12,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796284979] [2022-07-19 10:54:12,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:12,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:54:12,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:12,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:54:12,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:54:12,561 INFO L87 Difference]: Start difference. First operand 586 states and 887 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:12,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:12,655 INFO L93 Difference]: Finished difference Result 610 states and 910 transitions. [2022-07-19 10:54:12,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:54:12,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-19 10:54:12,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:12,657 INFO L225 Difference]: With dead ends: 610 [2022-07-19 10:54:12,657 INFO L226 Difference]: Without dead ends: 582 [2022-07-19 10:54:12,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:54:12,658 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 270 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:12,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 410 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:54:12,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-07-19 10:54:12,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2022-07-19 10:54:12,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 468 states have (on average 1.3525641025641026) internal successors, (633), 476 states have internal predecessors, (633), 84 states have call successors, (84), 25 states have call predecessors, (84), 27 states have return successors, (159), 79 states have call predecessors, (159), 77 states have call successors, (159) [2022-07-19 10:54:12,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 876 transitions. [2022-07-19 10:54:12,688 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 876 transitions. Word has length 34 [2022-07-19 10:54:12,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:12,688 INFO L495 AbstractCegarLoop]: Abstraction has 580 states and 876 transitions. [2022-07-19 10:54:12,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:12,689 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 876 transitions. [2022-07-19 10:54:12,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 10:54:12,689 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:12,689 INFO L195 NwaCegarLoop]: 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-07-19 10:54:12,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 10:54:12,690 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:12,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:12,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1171529217, now seen corresponding path program 1 times [2022-07-19 10:54:12,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:12,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304383630] [2022-07-19 10:54:12,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:12,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:12,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 10:54:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:12,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:12,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:12,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304383630] [2022-07-19 10:54:12,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304383630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:12,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:12,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:54:12,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715233587] [2022-07-19 10:54:12,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:12,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:54:12,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:12,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:54:12,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:54:12,735 INFO L87 Difference]: Start difference. First operand 580 states and 876 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:13,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:13,154 INFO L93 Difference]: Finished difference Result 738 states and 1149 transitions. [2022-07-19 10:54:13,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:54:13,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-19 10:54:13,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:13,157 INFO L225 Difference]: With dead ends: 738 [2022-07-19 10:54:13,157 INFO L226 Difference]: Without dead ends: 721 [2022-07-19 10:54:13,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:54:13,158 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 662 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:13,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 768 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:54:13,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2022-07-19 10:54:13,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 567. [2022-07-19 10:54:13,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 457 states have (on average 1.3544857768052516) internal successors, (619), 464 states have internal predecessors, (619), 83 states have call successors, (83), 25 states have call predecessors, (83), 26 states have return successors, (140), 78 states have call predecessors, (140), 76 states have call successors, (140) [2022-07-19 10:54:13,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 842 transitions. [2022-07-19 10:54:13,184 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 842 transitions. Word has length 36 [2022-07-19 10:54:13,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:13,185 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 842 transitions. [2022-07-19 10:54:13,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 842 transitions. [2022-07-19 10:54:13,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-19 10:54:13,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:13,186 INFO L195 NwaCegarLoop]: 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-07-19 10:54:13,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 10:54:13,186 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:13,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:13,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2056934280, now seen corresponding path program 1 times [2022-07-19 10:54:13,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:13,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932723386] [2022-07-19 10:54:13,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:13,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:13,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:13,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:54:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:13,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:13,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:13,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932723386] [2022-07-19 10:54:13,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932723386] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:13,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:13,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:54:13,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385792755] [2022-07-19 10:54:13,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:13,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:54:13,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:13,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:54:13,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:54:13,214 INFO L87 Difference]: Start difference. First operand 567 states and 842 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:13,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:13,397 INFO L93 Difference]: Finished difference Result 630 states and 904 transitions. [2022-07-19 10:54:13,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:54:13,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-07-19 10:54:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:13,399 INFO L225 Difference]: With dead ends: 630 [2022-07-19 10:54:13,399 INFO L226 Difference]: Without dead ends: 377 [2022-07-19 10:54:13,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:54:13,401 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 315 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:13,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 650 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:54:13,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-19 10:54:13,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 359. [2022-07-19 10:54:13,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 295 states have (on average 1.3016949152542372) internal successors, (384), 302 states have internal predecessors, (384), 47 states have call successors, (47), 17 states have call predecessors, (47), 16 states have return successors, (61), 40 states have call predecessors, (61), 40 states have call successors, (61) [2022-07-19 10:54:13,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 492 transitions. [2022-07-19 10:54:13,416 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 492 transitions. Word has length 39 [2022-07-19 10:54:13,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:13,416 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 492 transitions. [2022-07-19 10:54:13,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:13,416 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 492 transitions. [2022-07-19 10:54:13,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 10:54:13,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:13,417 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:54:13,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 10:54:13,417 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:13,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:13,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1922765712, now seen corresponding path program 1 times [2022-07-19 10:54:13,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:13,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502886021] [2022-07-19 10:54:13,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:13,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:13,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:13,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:13,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502886021] [2022-07-19 10:54:13,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502886021] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:13,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:13,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:54:13,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555989559] [2022-07-19 10:54:13,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:13,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:54:13,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:13,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:54:13,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:54:13,433 INFO L87 Difference]: Start difference. First operand 359 states and 492 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:13,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:13,502 INFO L93 Difference]: Finished difference Result 504 states and 710 transitions. [2022-07-19 10:54:13,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:54:13,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-19 10:54:13,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:13,504 INFO L225 Difference]: With dead ends: 504 [2022-07-19 10:54:13,504 INFO L226 Difference]: Without dead ends: 491 [2022-07-19 10:54:13,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:54:13,505 INFO L413 NwaCegarLoop]: 420 mSDtfsCounter, 161 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:13,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 641 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:54:13,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-07-19 10:54:13,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 375. [2022-07-19 10:54:13,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 310 states have (on average 1.2903225806451613) internal successors, (400), 317 states have internal predecessors, (400), 47 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (62), 41 states have call predecessors, (62), 40 states have call successors, (62) [2022-07-19 10:54:13,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 509 transitions. [2022-07-19 10:54:13,523 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 509 transitions. Word has length 35 [2022-07-19 10:54:13,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:13,523 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 509 transitions. [2022-07-19 10:54:13,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:13,523 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 509 transitions. [2022-07-19 10:54:13,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-19 10:54:13,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:13,524 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:54:13,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 10:54:13,524 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:13,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:13,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1798212464, now seen corresponding path program 1 times [2022-07-19 10:54:13,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:13,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964080113] [2022-07-19 10:54:13,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:13,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:13,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:13,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:13,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964080113] [2022-07-19 10:54:13,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964080113] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:13,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:13,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:54:13,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735371034] [2022-07-19 10:54:13,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:13,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:54:13,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:13,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:54:13,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:54:13,552 INFO L87 Difference]: Start difference. First operand 375 states and 509 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:13,653 INFO L93 Difference]: Finished difference Result 387 states and 521 transitions. [2022-07-19 10:54:13,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:54:13,653 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-19 10:54:13,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:13,654 INFO L225 Difference]: With dead ends: 387 [2022-07-19 10:54:13,654 INFO L226 Difference]: Without dead ends: 353 [2022-07-19 10:54:13,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:54:13,655 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 262 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:13,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 411 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:54:13,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-07-19 10:54:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2022-07-19 10:54:13,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 288 states have (on average 1.28125) internal successors, (369), 294 states have internal predecessors, (369), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (61), 40 states have call predecessors, (61), 40 states have call successors, (61) [2022-07-19 10:54:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 476 transitions. [2022-07-19 10:54:13,671 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 476 transitions. Word has length 35 [2022-07-19 10:54:13,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:13,672 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 476 transitions. [2022-07-19 10:54:13,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:13,672 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 476 transitions. [2022-07-19 10:54:13,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 10:54:13,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:13,672 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:54:13,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 10:54:13,673 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:13,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:13,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1722219638, now seen corresponding path program 1 times [2022-07-19 10:54:13,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:13,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406324214] [2022-07-19 10:54:13,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:13,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:13,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 10:54:13,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:13,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:13,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:13,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406324214] [2022-07-19 10:54:13,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406324214] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:13,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:13,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 10:54:13,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235053664] [2022-07-19 10:54:13,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:13,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:54:13,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:13,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:54:13,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:54:13,711 INFO L87 Difference]: Start difference. First operand 351 states and 476 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:13,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:13,947 INFO L93 Difference]: Finished difference Result 355 states and 479 transitions. [2022-07-19 10:54:13,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:54:13,948 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-07-19 10:54:13,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:13,949 INFO L225 Difference]: With dead ends: 355 [2022-07-19 10:54:13,949 INFO L226 Difference]: Without dead ends: 324 [2022-07-19 10:54:13,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:54:13,950 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 60 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:13,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1424 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:54:13,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-07-19 10:54:13,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2022-07-19 10:54:13,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 263 states have (on average 1.2889733840304183) internal successors, (339), 269 states have internal predecessors, (339), 45 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (60), 39 states have call predecessors, (60), 39 states have call successors, (60) [2022-07-19 10:54:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 444 transitions. [2022-07-19 10:54:13,965 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 444 transitions. Word has length 37 [2022-07-19 10:54:13,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:13,966 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 444 transitions. [2022-07-19 10:54:13,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:13,966 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 444 transitions. [2022-07-19 10:54:13,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-19 10:54:13,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:13,966 INFO L195 NwaCegarLoop]: 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-07-19 10:54:13,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 10:54:13,967 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:13,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:13,967 INFO L85 PathProgramCache]: Analyzing trace with hash -70447595, now seen corresponding path program 1 times [2022-07-19 10:54:13,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:13,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295398619] [2022-07-19 10:54:13,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:13,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:14,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:14,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295398619] [2022-07-19 10:54:14,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295398619] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:14,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:14,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 10:54:14,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435607052] [2022-07-19 10:54:14,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:14,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 10:54:14,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:14,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 10:54:14,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:54:14,015 INFO L87 Difference]: Start difference. First operand 324 states and 444 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:14,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:14,086 INFO L93 Difference]: Finished difference Result 345 states and 466 transitions. [2022-07-19 10:54:14,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:54:14,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-19 10:54:14,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:14,088 INFO L225 Difference]: With dead ends: 345 [2022-07-19 10:54:14,088 INFO L226 Difference]: Without dead ends: 323 [2022-07-19 10:54:14,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:54:14,089 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 43 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:14,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1424 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:54:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-07-19 10:54:14,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2022-07-19 10:54:14,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 262 states have (on average 1.286259541984733) internal successors, (337), 268 states have internal predecessors, (337), 45 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (60), 39 states have call predecessors, (60), 39 states have call successors, (60) [2022-07-19 10:54:14,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 442 transitions. [2022-07-19 10:54:14,117 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 442 transitions. Word has length 36 [2022-07-19 10:54:14,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:14,118 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 442 transitions. [2022-07-19 10:54:14,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:14,118 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 442 transitions. [2022-07-19 10:54:14,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-19 10:54:14,118 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:14,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:14,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-19 10:54:14,119 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:14,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:14,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2018897985, now seen corresponding path program 1 times [2022-07-19 10:54:14,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:14,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037932660] [2022-07-19 10:54:14,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:14,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:14,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-19 10:54:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:14,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:14,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037932660] [2022-07-19 10:54:14,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037932660] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:14,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:14,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:54:14,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772826688] [2022-07-19 10:54:14,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:14,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:54:14,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:14,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:54:14,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:54:14,144 INFO L87 Difference]: Start difference. First operand 323 states and 442 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:14,264 INFO L93 Difference]: Finished difference Result 352 states and 479 transitions. [2022-07-19 10:54:14,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:54:14,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-07-19 10:54:14,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:14,266 INFO L225 Difference]: With dead ends: 352 [2022-07-19 10:54:14,266 INFO L226 Difference]: Without dead ends: 322 [2022-07-19 10:54:14,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:54:14,267 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 79 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:14,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1067 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:54:14,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-07-19 10:54:14,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 308. [2022-07-19 10:54:14,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 249 states have (on average 1.2931726907630523) internal successors, (322), 255 states have internal predecessors, (322), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2022-07-19 10:54:14,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 425 transitions. [2022-07-19 10:54:14,283 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 425 transitions. Word has length 38 [2022-07-19 10:54:14,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:14,283 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 425 transitions. [2022-07-19 10:54:14,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:14,283 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 425 transitions. [2022-07-19 10:54:14,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 10:54:14,283 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:14,284 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:54:14,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-19 10:54:14,284 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:14,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:14,284 INFO L85 PathProgramCache]: Analyzing trace with hash 233678808, now seen corresponding path program 1 times [2022-07-19 10:54:14,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:14,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121871142] [2022-07-19 10:54:14,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:14,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:14,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:14,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:14,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121871142] [2022-07-19 10:54:14,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121871142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:14,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:14,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 10:54:14,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400863955] [2022-07-19 10:54:14,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:14,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:54:14,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:14,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:54:14,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:54:14,324 INFO L87 Difference]: Start difference. First operand 308 states and 425 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:14,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:14,396 INFO L93 Difference]: Finished difference Result 323 states and 441 transitions. [2022-07-19 10:54:14,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:54:14,396 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-19 10:54:14,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:14,397 INFO L225 Difference]: With dead ends: 323 [2022-07-19 10:54:14,397 INFO L226 Difference]: Without dead ends: 319 [2022-07-19 10:54:14,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:54:14,398 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 46 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:14,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1090 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:54:14,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-19 10:54:14,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2022-07-19 10:54:14,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 256 states have (on average 1.2890625) internal successors, (330), 262 states have internal predecessors, (330), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2022-07-19 10:54:14,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 433 transitions. [2022-07-19 10:54:14,415 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 433 transitions. Word has length 37 [2022-07-19 10:54:14,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:14,415 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 433 transitions. [2022-07-19 10:54:14,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:14,415 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 433 transitions. [2022-07-19 10:54:14,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-19 10:54:14,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:14,416 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:54:14,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-19 10:54:14,416 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:14,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:14,417 INFO L85 PathProgramCache]: Analyzing trace with hash 233401978, now seen corresponding path program 1 times [2022-07-19 10:54:14,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:14,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249863774] [2022-07-19 10:54:14,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:14,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:14,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:14,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:14,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249863774] [2022-07-19 10:54:14,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249863774] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:14,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:14,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-19 10:54:14,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151677622] [2022-07-19 10:54:14,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:14,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-19 10:54:14,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:14,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-19 10:54:14,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-19 10:54:14,453 INFO L87 Difference]: Start difference. First operand 315 states and 433 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:14,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:14,635 INFO L93 Difference]: Finished difference Result 431 states and 618 transitions. [2022-07-19 10:54:14,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-19 10:54:14,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-19 10:54:14,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:14,637 INFO L225 Difference]: With dead ends: 431 [2022-07-19 10:54:14,637 INFO L226 Difference]: Without dead ends: 402 [2022-07-19 10:54:14,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:54:14,638 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 344 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:14,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 504 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:54:14,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-07-19 10:54:14,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 292. [2022-07-19 10:54:14,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 233 states have (on average 1.3004291845493563) internal successors, (303), 239 states have internal predecessors, (303), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2022-07-19 10:54:14,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 406 transitions. [2022-07-19 10:54:14,659 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 406 transitions. Word has length 37 [2022-07-19 10:54:14,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:14,660 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 406 transitions. [2022-07-19 10:54:14,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:54:14,660 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 406 transitions. [2022-07-19 10:54:14,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 10:54:14,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:14,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:14,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-19 10:54:14,661 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:14,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:14,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1150124824, now seen corresponding path program 1 times [2022-07-19 10:54:14,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:14,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438541272] [2022-07-19 10:54:14,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:14,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:14,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-19 10:54:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:14,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-19 10:54:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:14,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:14,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438541272] [2022-07-19 10:54:14,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438541272] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:14,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:14,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:54:14,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476061218] [2022-07-19 10:54:14,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:14,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:54:14,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:14,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:54:14,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:54:14,694 INFO L87 Difference]: Start difference. First operand 292 states and 406 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:54:14,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:14,835 INFO L93 Difference]: Finished difference Result 544 states and 787 transitions. [2022-07-19 10:54:14,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:54:14,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-07-19 10:54:14,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:14,837 INFO L225 Difference]: With dead ends: 544 [2022-07-19 10:54:14,837 INFO L226 Difference]: Without dead ends: 310 [2022-07-19 10:54:14,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:54:14,838 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 112 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:14,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 635 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:54:14,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-19 10:54:14,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 302. [2022-07-19 10:54:14,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 243 states have (on average 1.3045267489711934) internal successors, (317), 248 states have internal predecessors, (317), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2022-07-19 10:54:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 420 transitions. [2022-07-19 10:54:14,862 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 420 transitions. Word has length 43 [2022-07-19 10:54:14,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:14,863 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 420 transitions. [2022-07-19 10:54:14,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:54:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 420 transitions. [2022-07-19 10:54:14,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-19 10:54:14,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:14,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:14,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-19 10:54:14,864 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:14,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:14,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1967801604, now seen corresponding path program 1 times [2022-07-19 10:54:14,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:14,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605360624] [2022-07-19 10:54:14,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:14,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:14,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 10:54:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:14,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:14,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:14,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605360624] [2022-07-19 10:54:14,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605360624] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:14,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:14,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 10:54:14,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688519399] [2022-07-19 10:54:14,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:14,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 10:54:14,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:14,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 10:54:14,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:54:14,979 INFO L87 Difference]: Start difference. First operand 302 states and 420 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:15,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:15,273 INFO L93 Difference]: Finished difference Result 333 states and 468 transitions. [2022-07-19 10:54:15,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 10:54:15,273 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-07-19 10:54:15,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:15,275 INFO L225 Difference]: With dead ends: 333 [2022-07-19 10:54:15,275 INFO L226 Difference]: Without dead ends: 310 [2022-07-19 10:54:15,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-19 10:54:15,276 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 77 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:15,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1275 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:54:15,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-19 10:54:15,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 301. [2022-07-19 10:54:15,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 242 states have (on average 1.3016528925619835) internal successors, (315), 247 states have internal predecessors, (315), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2022-07-19 10:54:15,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 418 transitions. [2022-07-19 10:54:15,299 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 418 transitions. Word has length 43 [2022-07-19 10:54:15,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:15,300 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 418 transitions. [2022-07-19 10:54:15,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:15,300 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 418 transitions. [2022-07-19 10:54:15,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 10:54:15,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:15,301 INFO L195 NwaCegarLoop]: 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-07-19 10:54:15,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-19 10:54:15,301 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:15,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:15,301 INFO L85 PathProgramCache]: Analyzing trace with hash -896869873, now seen corresponding path program 1 times [2022-07-19 10:54:15,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:15,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292095884] [2022-07-19 10:54:15,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:15,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:15,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:54:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:15,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:15,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:15,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:15,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292095884] [2022-07-19 10:54:15,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292095884] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:15,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:15,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 10:54:15,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898481907] [2022-07-19 10:54:15,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:15,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 10:54:15,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:15,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 10:54:15,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 10:54:15,354 INFO L87 Difference]: Start difference. First operand 301 states and 418 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:54:15,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:15,565 INFO L93 Difference]: Finished difference Result 569 states and 825 transitions. [2022-07-19 10:54:15,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 10:54:15,566 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-07-19 10:54:15,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:15,567 INFO L225 Difference]: With dead ends: 569 [2022-07-19 10:54:15,567 INFO L226 Difference]: Without dead ends: 326 [2022-07-19 10:54:15,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:54:15,568 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 61 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:15,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1129 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:54:15,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-07-19 10:54:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 313. [2022-07-19 10:54:15,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 252 states have (on average 1.2936507936507937) internal successors, (326), 257 states have internal predecessors, (326), 44 states have call successors, (44), 15 states have call predecessors, (44), 16 states have return successors, (77), 40 states have call predecessors, (77), 38 states have call successors, (77) [2022-07-19 10:54:15,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 447 transitions. [2022-07-19 10:54:15,586 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 447 transitions. Word has length 48 [2022-07-19 10:54:15,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:15,586 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 447 transitions. [2022-07-19 10:54:15,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:54:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 447 transitions. [2022-07-19 10:54:15,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-19 10:54:15,587 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:15,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:15,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-19 10:54:15,587 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:15,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:15,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1018197871, now seen corresponding path program 1 times [2022-07-19 10:54:15,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:15,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667598576] [2022-07-19 10:54:15,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:15,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:15,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-19 10:54:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:15,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:15,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:15,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667598576] [2022-07-19 10:54:15,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667598576] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:15,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:15,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 10:54:15,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426092357] [2022-07-19 10:54:15,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:15,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:54:15,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:15,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:54:15,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:54:15,669 INFO L87 Difference]: Start difference. First operand 313 states and 447 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:15,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:15,953 INFO L93 Difference]: Finished difference Result 315 states and 448 transitions. [2022-07-19 10:54:15,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:54:15,954 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-07-19 10:54:15,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:15,955 INFO L225 Difference]: With dead ends: 315 [2022-07-19 10:54:15,955 INFO L226 Difference]: Without dead ends: 282 [2022-07-19 10:54:15,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-19 10:54:15,956 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 66 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:15,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1244 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:54:15,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-19 10:54:15,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-07-19 10:54:15,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 224 states have (on average 1.3169642857142858) internal successors, (295), 228 states have internal predecessors, (295), 42 states have call successors, (42), 14 states have call predecessors, (42), 15 states have return successors, (76), 39 states have call predecessors, (76), 37 states have call successors, (76) [2022-07-19 10:54:15,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 413 transitions. [2022-07-19 10:54:15,972 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 413 transitions. Word has length 44 [2022-07-19 10:54:15,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:15,972 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 413 transitions. [2022-07-19 10:54:15,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-19 10:54:15,972 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 413 transitions. [2022-07-19 10:54:15,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-19 10:54:15,973 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:15,973 INFO L195 NwaCegarLoop]: 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-07-19 10:54:15,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-19 10:54:15,973 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:15,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:15,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1224484534, now seen corresponding path program 1 times [2022-07-19 10:54:15,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:15,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609142000] [2022-07-19 10:54:15,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:15,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:15,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:15,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-19 10:54:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:15,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:16,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:16,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:16,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609142000] [2022-07-19 10:54:16,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609142000] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:16,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:16,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:54:16,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688745251] [2022-07-19 10:54:16,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:16,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:54:16,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:16,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:54:16,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:54:16,002 INFO L87 Difference]: Start difference. First operand 282 states and 413 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:54:16,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:16,147 INFO L93 Difference]: Finished difference Result 441 states and 673 transitions. [2022-07-19 10:54:16,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:54:16,147 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-07-19 10:54:16,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:16,149 INFO L225 Difference]: With dead ends: 441 [2022-07-19 10:54:16,149 INFO L226 Difference]: Without dead ends: 438 [2022-07-19 10:54:16,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-19 10:54:16,150 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 140 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:16,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 793 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:54:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-07-19 10:54:16,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 286. [2022-07-19 10:54:16,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 228 states have (on average 1.3201754385964912) internal successors, (301), 232 states have internal predecessors, (301), 42 states have call successors, (42), 14 states have call predecessors, (42), 15 states have return successors, (76), 39 states have call predecessors, (76), 37 states have call successors, (76) [2022-07-19 10:54:16,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 419 transitions. [2022-07-19 10:54:16,174 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 419 transitions. Word has length 49 [2022-07-19 10:54:16,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:16,174 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 419 transitions. [2022-07-19 10:54:16,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:54:16,174 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 419 transitions. [2022-07-19 10:54:16,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-19 10:54:16,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:16,175 INFO L195 NwaCegarLoop]: 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-07-19 10:54:16,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-19 10:54:16,175 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:16,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:16,176 INFO L85 PathProgramCache]: Analyzing trace with hash -2015471348, now seen corresponding path program 1 times [2022-07-19 10:54:16,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:16,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029638338] [2022-07-19 10:54:16,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:16,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:16,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:16,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-19 10:54:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:16,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:16,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:16,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:16,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:16,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029638338] [2022-07-19 10:54:16,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029638338] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:16,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:16,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 10:54:16,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437321480] [2022-07-19 10:54:16,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:16,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 10:54:16,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:16,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 10:54:16,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 10:54:16,212 INFO L87 Difference]: Start difference. First operand 286 states and 419 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:54:16,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:16,374 INFO L93 Difference]: Finished difference Result 658 states and 979 transitions. [2022-07-19 10:54:16,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:54:16,374 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-07-19 10:54:16,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:16,376 INFO L225 Difference]: With dead ends: 658 [2022-07-19 10:54:16,376 INFO L226 Difference]: Without dead ends: 405 [2022-07-19 10:54:16,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:54:16,378 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 214 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:16,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 543 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:54:16,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-07-19 10:54:16,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 373. [2022-07-19 10:54:16,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 297 states have (on average 1.2996632996632997) internal successors, (386), 302 states have internal predecessors, (386), 53 states have call successors, (53), 18 states have call predecessors, (53), 22 states have return successors, (96), 52 states have call predecessors, (96), 49 states have call successors, (96) [2022-07-19 10:54:16,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 535 transitions. [2022-07-19 10:54:16,399 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 535 transitions. Word has length 49 [2022-07-19 10:54:16,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:16,399 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 535 transitions. [2022-07-19 10:54:16,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-19 10:54:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 535 transitions. [2022-07-19 10:54:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-19 10:54:16,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:16,400 INFO L195 NwaCegarLoop]: 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-07-19 10:54:16,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-19 10:54:16,401 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:16,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:16,401 INFO L85 PathProgramCache]: Analyzing trace with hash -726473774, now seen corresponding path program 1 times [2022-07-19 10:54:16,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:16,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063774324] [2022-07-19 10:54:16,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:16,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:16,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 10:54:16,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:16,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:54:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:16,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:16,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:16,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:16,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:16,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063774324] [2022-07-19 10:54:16,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063774324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:16,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:16,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 10:54:16,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803126593] [2022-07-19 10:54:16,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:16,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:54:16,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:16,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:54:16,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:54:16,542 INFO L87 Difference]: Start difference. First operand 373 states and 535 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:54:16,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:16,715 INFO L93 Difference]: Finished difference Result 691 states and 1016 transitions. [2022-07-19 10:54:16,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 10:54:16,716 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-07-19 10:54:16,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:16,717 INFO L225 Difference]: With dead ends: 691 [2022-07-19 10:54:16,717 INFO L226 Difference]: Without dead ends: 346 [2022-07-19 10:54:16,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:54:16,719 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 88 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:16,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 983 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:54:16,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-19 10:54:16,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2022-07-19 10:54:16,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 271 states have (on average 1.2767527675276753) internal successors, (346), 275 states have internal predecessors, (346), 52 states have call successors, (52), 18 states have call predecessors, (52), 22 states have return successors, (96), 52 states have call predecessors, (96), 49 states have call successors, (96) [2022-07-19 10:54:16,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 494 transitions. [2022-07-19 10:54:16,742 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 494 transitions. Word has length 50 [2022-07-19 10:54:16,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:16,742 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 494 transitions. [2022-07-19 10:54:16,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 10:54:16,743 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 494 transitions. [2022-07-19 10:54:16,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-19 10:54:16,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:16,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:16,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-19 10:54:16,744 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:16,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:16,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1339562411, now seen corresponding path program 1 times [2022-07-19 10:54:16,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:16,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504111115] [2022-07-19 10:54:16,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:16,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:16,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 10:54:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:16,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:54:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:16,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:16,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:16,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:16,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:16,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504111115] [2022-07-19 10:54:16,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504111115] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:16,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:16,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 10:54:16,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536538163] [2022-07-19 10:54:16,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:16,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 10:54:16,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:16,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 10:54:16,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:54:16,832 INFO L87 Difference]: Start difference. First operand 346 states and 494 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:54:17,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:17,107 INFO L93 Difference]: Finished difference Result 659 states and 959 transitions. [2022-07-19 10:54:17,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:54:17,107 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2022-07-19 10:54:17,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:17,109 INFO L225 Difference]: With dead ends: 659 [2022-07-19 10:54:17,109 INFO L226 Difference]: Without dead ends: 341 [2022-07-19 10:54:17,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:54:17,110 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 232 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:17,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 839 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:54:17,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-19 10:54:17,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2022-07-19 10:54:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 267 states have (on average 1.2659176029962547) internal successors, (338), 271 states have internal predecessors, (338), 52 states have call successors, (52), 18 states have call predecessors, (52), 21 states have return successors, (91), 51 states have call predecessors, (91), 49 states have call successors, (91) [2022-07-19 10:54:17,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 481 transitions. [2022-07-19 10:54:17,134 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 481 transitions. Word has length 54 [2022-07-19 10:54:17,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:17,134 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 481 transitions. [2022-07-19 10:54:17,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-19 10:54:17,134 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 481 transitions. [2022-07-19 10:54:17,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 10:54:17,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:17,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:17,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-19 10:54:17,136 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:17,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:17,136 INFO L85 PathProgramCache]: Analyzing trace with hash 330640549, now seen corresponding path program 1 times [2022-07-19 10:54:17,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:17,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923395048] [2022-07-19 10:54:17,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:17,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:17,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 10:54:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:17,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:54:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:17,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:17,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:17,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:17,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:17,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:17,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923395048] [2022-07-19 10:54:17,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923395048] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:17,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:17,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 10:54:17,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23446595] [2022-07-19 10:54:17,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:17,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 10:54:17,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:17,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 10:54:17,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:54:17,188 INFO L87 Difference]: Start difference. First operand 341 states and 481 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 10:54:17,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:17,324 INFO L93 Difference]: Finished difference Result 666 states and 963 transitions. [2022-07-19 10:54:17,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 10:54:17,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2022-07-19 10:54:17,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:17,326 INFO L225 Difference]: With dead ends: 666 [2022-07-19 10:54:17,326 INFO L226 Difference]: Without dead ends: 353 [2022-07-19 10:54:17,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-19 10:54:17,328 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 51 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:17,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 686 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 10:54:17,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-07-19 10:54:17,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 344. [2022-07-19 10:54:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 270 states have (on average 1.262962962962963) internal successors, (341), 274 states have internal predecessors, (341), 52 states have call successors, (52), 18 states have call predecessors, (52), 21 states have return successors, (91), 51 states have call predecessors, (91), 49 states have call successors, (91) [2022-07-19 10:54:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 484 transitions. [2022-07-19 10:54:17,353 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 484 transitions. Word has length 57 [2022-07-19 10:54:17,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:17,353 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 484 transitions. [2022-07-19 10:54:17,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 10:54:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 484 transitions. [2022-07-19 10:54:17,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-19 10:54:17,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:17,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:17,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-19 10:54:17,354 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:17,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:17,354 INFO L85 PathProgramCache]: Analyzing trace with hash 942519397, now seen corresponding path program 1 times [2022-07-19 10:54:17,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:17,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347105511] [2022-07-19 10:54:17,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:17,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:17,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 10:54:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:17,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:54:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:17,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:17,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:17,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:17,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:17,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:17,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347105511] [2022-07-19 10:54:17,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347105511] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:17,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:17,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 10:54:17,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402142135] [2022-07-19 10:54:17,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:17,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 10:54:17,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:17,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 10:54:17,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-19 10:54:17,454 INFO L87 Difference]: Start difference. First operand 344 states and 484 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 10:54:17,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:17,683 INFO L93 Difference]: Finished difference Result 662 states and 947 transitions. [2022-07-19 10:54:17,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 10:54:17,684 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2022-07-19 10:54:17,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:17,686 INFO L225 Difference]: With dead ends: 662 [2022-07-19 10:54:17,686 INFO L226 Difference]: Without dead ends: 347 [2022-07-19 10:54:17,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:54:17,688 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 46 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:17,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1287 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:54:17,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-19 10:54:17,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 344. [2022-07-19 10:54:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 270 states have (on average 1.2518518518518518) internal successors, (338), 274 states have internal predecessors, (338), 52 states have call successors, (52), 18 states have call predecessors, (52), 21 states have return successors, (91), 51 states have call predecessors, (91), 49 states have call successors, (91) [2022-07-19 10:54:17,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 481 transitions. [2022-07-19 10:54:17,719 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 481 transitions. Word has length 57 [2022-07-19 10:54:17,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:17,719 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 481 transitions. [2022-07-19 10:54:17,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-19 10:54:17,720 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 481 transitions. [2022-07-19 10:54:17,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-19 10:54:17,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:17,721 INFO L195 NwaCegarLoop]: 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-07-19 10:54:17,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-19 10:54:17,721 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:17,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:17,721 INFO L85 PathProgramCache]: Analyzing trace with hash -146309345, now seen corresponding path program 1 times [2022-07-19 10:54:17,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:17,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661540760] [2022-07-19 10:54:17,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:17,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:17,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 10:54:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:17,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:54:17,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:17,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:17,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:17,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 10:54:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:17,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:17,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661540760] [2022-07-19 10:54:17,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661540760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:17,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:17,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 10:54:17,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60658590] [2022-07-19 10:54:17,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:17,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 10:54:17,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:17,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 10:54:17,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-19 10:54:17,796 INFO L87 Difference]: Start difference. First operand 344 states and 481 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 10:54:18,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:18,076 INFO L93 Difference]: Finished difference Result 623 states and 870 transitions. [2022-07-19 10:54:18,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:54:18,076 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-07-19 10:54:18,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:18,078 INFO L225 Difference]: With dead ends: 623 [2022-07-19 10:54:18,078 INFO L226 Difference]: Without dead ends: 322 [2022-07-19 10:54:18,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:54:18,079 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 165 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:18,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1228 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:54:18,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-07-19 10:54:18,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 314. [2022-07-19 10:54:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 246 states have (on average 1.2560975609756098) internal successors, (309), 252 states have internal predecessors, (309), 49 states have call successors, (49), 18 states have call predecessors, (49), 18 states have return successors, (70), 43 states have call predecessors, (70), 46 states have call successors, (70) [2022-07-19 10:54:18,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 428 transitions. [2022-07-19 10:54:18,100 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 428 transitions. Word has length 68 [2022-07-19 10:54:18,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:18,115 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 428 transitions. [2022-07-19 10:54:18,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 10:54:18,115 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 428 transitions. [2022-07-19 10:54:18,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-19 10:54:18,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:18,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:18,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-19 10:54:18,116 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:18,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:18,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1989043251, now seen corresponding path program 1 times [2022-07-19 10:54:18,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:18,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974971144] [2022-07-19 10:54:18,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:18,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:18,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 10:54:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:18,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:54:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:18,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:18,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:18,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 10:54:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:18,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:18,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:18,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974971144] [2022-07-19 10:54:18,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974971144] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:18,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:18,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-19 10:54:18,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535184673] [2022-07-19 10:54:18,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:18,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 10:54:18,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:18,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 10:54:18,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:54:18,240 INFO L87 Difference]: Start difference. First operand 314 states and 428 transitions. Second operand has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 10:54:18,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:18,627 INFO L93 Difference]: Finished difference Result 350 states and 477 transitions. [2022-07-19 10:54:18,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 10:54:18,627 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 73 [2022-07-19 10:54:18,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:18,629 INFO L225 Difference]: With dead ends: 350 [2022-07-19 10:54:18,629 INFO L226 Difference]: Without dead ends: 329 [2022-07-19 10:54:18,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-07-19 10:54:18,630 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 126 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 2065 SdHoareTripleChecker+Invalid, 885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:18,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 2065 Invalid, 885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:54:18,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-19 10:54:18,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 317. [2022-07-19 10:54:18,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 248 states have (on average 1.2540322580645162) internal successors, (311), 255 states have internal predecessors, (311), 49 states have call successors, (49), 18 states have call predecessors, (49), 19 states have return successors, (71), 43 states have call predecessors, (71), 46 states have call successors, (71) [2022-07-19 10:54:18,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 431 transitions. [2022-07-19 10:54:18,648 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 431 transitions. Word has length 73 [2022-07-19 10:54:18,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:18,648 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 431 transitions. [2022-07-19 10:54:18,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 10:54:18,649 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 431 transitions. [2022-07-19 10:54:18,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-19 10:54:18,649 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:18,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:18,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-19 10:54:18,650 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:18,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:18,650 INFO L85 PathProgramCache]: Analyzing trace with hash -182846632, now seen corresponding path program 1 times [2022-07-19 10:54:18,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:18,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674891837] [2022-07-19 10:54:18,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:18,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:18,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 10:54:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:18,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:54:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:18,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:18,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:18,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 10:54:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:18,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:18,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674891837] [2022-07-19 10:54:18,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674891837] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:18,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:18,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-19 10:54:18,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792516345] [2022-07-19 10:54:18,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:18,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 10:54:18,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:18,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 10:54:18,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:54:18,792 INFO L87 Difference]: Start difference. First operand 317 states and 431 transitions. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 10:54:19,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:19,225 INFO L93 Difference]: Finished difference Result 354 states and 481 transitions. [2022-07-19 10:54:19,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 10:54:19,227 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2022-07-19 10:54:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:19,228 INFO L225 Difference]: With dead ends: 354 [2022-07-19 10:54:19,228 INFO L226 Difference]: Without dead ends: 333 [2022-07-19 10:54:19,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-07-19 10:54:19,229 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 126 mSDsluCounter, 2170 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 2379 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:19,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 2379 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:54:19,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-07-19 10:54:19,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 317. [2022-07-19 10:54:19,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 248 states have (on average 1.2540322580645162) internal successors, (311), 255 states have internal predecessors, (311), 49 states have call successors, (49), 18 states have call predecessors, (49), 19 states have return successors, (71), 43 states have call predecessors, (71), 46 states have call successors, (71) [2022-07-19 10:54:19,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 431 transitions. [2022-07-19 10:54:19,247 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 431 transitions. Word has length 74 [2022-07-19 10:54:19,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:19,248 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 431 transitions. [2022-07-19 10:54:19,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 10:54:19,248 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 431 transitions. [2022-07-19 10:54:19,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-19 10:54:19,250 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:19,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:54:19,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-19 10:54:19,251 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:19,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:19,251 INFO L85 PathProgramCache]: Analyzing trace with hash -673237615, now seen corresponding path program 1 times [2022-07-19 10:54:19,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:19,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838114138] [2022-07-19 10:54:19,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:19,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:19,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:19,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 10:54:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:19,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:54:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:19,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:19,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:19,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:19,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 10:54:19,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:19,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-19 10:54:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:19,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:19,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:19,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838114138] [2022-07-19 10:54:19,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838114138] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:19,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:19,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-19 10:54:19,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104849229] [2022-07-19 10:54:19,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:19,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 10:54:19,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:19,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 10:54:19,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-07-19 10:54:19,407 INFO L87 Difference]: Start difference. First operand 317 states and 431 transitions. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 10:54:20,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:20,112 INFO L93 Difference]: Finished difference Result 468 states and 698 transitions. [2022-07-19 10:54:20,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 10:54:20,112 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 82 [2022-07-19 10:54:20,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:20,114 INFO L225 Difference]: With dead ends: 468 [2022-07-19 10:54:20,114 INFO L226 Difference]: Without dead ends: 429 [2022-07-19 10:54:20,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2022-07-19 10:54:20,115 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 194 mSDsluCounter, 2445 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 2688 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:20,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 2688 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 10:54:20,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-07-19 10:54:20,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 413. [2022-07-19 10:54:20,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 316 states have (on average 1.2626582278481013) internal successors, (399), 327 states have internal predecessors, (399), 76 states have call successors, (76), 18 states have call predecessors, (76), 20 states have return successors, (110), 67 states have call predecessors, (110), 72 states have call successors, (110) [2022-07-19 10:54:20,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 585 transitions. [2022-07-19 10:54:20,156 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 585 transitions. Word has length 82 [2022-07-19 10:54:20,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:20,156 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 585 transitions. [2022-07-19 10:54:20,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 10:54:20,156 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 585 transitions. [2022-07-19 10:54:20,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 10:54:20,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:20,157 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:54:20,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-19 10:54:20,157 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:20,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:20,158 INFO L85 PathProgramCache]: Analyzing trace with hash -166689667, now seen corresponding path program 1 times [2022-07-19 10:54:20,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:20,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810658919] [2022-07-19 10:54:20,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:20,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:20,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:20,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 10:54:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:20,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:54:20,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:20,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:20,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:20,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:20,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 10:54:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:20,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 10:54:20,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:20,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:20,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810658919] [2022-07-19 10:54:20,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810658919] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:20,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:20,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 10:54:20,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989592808] [2022-07-19 10:54:20,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:20,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:54:20,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:20,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:54:20,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:54:20,239 INFO L87 Difference]: Start difference. First operand 413 states and 585 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 10:54:20,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:20,578 INFO L93 Difference]: Finished difference Result 809 states and 1103 transitions. [2022-07-19 10:54:20,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-19 10:54:20,578 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 84 [2022-07-19 10:54:20,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:20,581 INFO L225 Difference]: With dead ends: 809 [2022-07-19 10:54:20,581 INFO L226 Difference]: Without dead ends: 538 [2022-07-19 10:54:20,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2022-07-19 10:54:20,582 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 377 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:20,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1031 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:54:20,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-07-19 10:54:20,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 496. [2022-07-19 10:54:20,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.2532299741602067) internal successors, (485), 397 states have internal predecessors, (485), 79 states have call successors, (79), 25 states have call predecessors, (79), 29 states have return successors, (114), 73 states have call predecessors, (114), 75 states have call successors, (114) [2022-07-19 10:54:20,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 678 transitions. [2022-07-19 10:54:20,609 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 678 transitions. Word has length 84 [2022-07-19 10:54:20,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:20,609 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 678 transitions. [2022-07-19 10:54:20,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 10:54:20,609 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 678 transitions. [2022-07-19 10:54:20,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 10:54:20,610 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:20,610 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:54:20,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-19 10:54:20,610 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:20,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:20,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1602435204, now seen corresponding path program 1 times [2022-07-19 10:54:20,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:20,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902335860] [2022-07-19 10:54:20,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:20,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:20,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 10:54:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:20,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:54:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:20,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:20,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:20,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 10:54:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:20,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 10:54:20,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:20,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:20,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:20,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902335860] [2022-07-19 10:54:20,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902335860] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:20,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:20,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 10:54:20,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530304501] [2022-07-19 10:54:20,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:20,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:54:20,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:20,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:54:20,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:54:20,699 INFO L87 Difference]: Start difference. First operand 496 states and 678 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 10:54:21,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:21,125 INFO L93 Difference]: Finished difference Result 867 states and 1198 transitions. [2022-07-19 10:54:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-19 10:54:21,126 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 84 [2022-07-19 10:54:21,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:21,128 INFO L225 Difference]: With dead ends: 867 [2022-07-19 10:54:21,128 INFO L226 Difference]: Without dead ends: 496 [2022-07-19 10:54:21,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-07-19 10:54:21,130 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 447 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:21,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 712 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:54:21,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-07-19 10:54:21,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2022-07-19 10:54:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.248062015503876) internal successors, (483), 397 states have internal predecessors, (483), 79 states have call successors, (79), 25 states have call predecessors, (79), 29 states have return successors, (106), 73 states have call predecessors, (106), 75 states have call successors, (106) [2022-07-19 10:54:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 668 transitions. [2022-07-19 10:54:21,160 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 668 transitions. Word has length 84 [2022-07-19 10:54:21,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:21,160 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 668 transitions. [2022-07-19 10:54:21,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-19 10:54:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 668 transitions. [2022-07-19 10:54:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-19 10:54:21,161 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:21,161 INFO L195 NwaCegarLoop]: 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-07-19 10:54:21,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-19 10:54:21,161 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:21,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:21,162 INFO L85 PathProgramCache]: Analyzing trace with hash 716383564, now seen corresponding path program 1 times [2022-07-19 10:54:21,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:21,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546441335] [2022-07-19 10:54:21,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:21,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:21,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 10:54:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:21,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:54:21,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:21,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:21,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:21,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-19 10:54:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:21,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-19 10:54:21,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:21,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:21,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:21,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546441335] [2022-07-19 10:54:21,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546441335] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:21,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:21,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-19 10:54:21,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348343410] [2022-07-19 10:54:21,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:21,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-19 10:54:21,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:21,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-19 10:54:21,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-07-19 10:54:21,316 INFO L87 Difference]: Start difference. First operand 496 states and 668 transitions. Second operand has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 11 states have internal predecessors, (70), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 10:54:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:21,989 INFO L93 Difference]: Finished difference Result 657 states and 955 transitions. [2022-07-19 10:54:21,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-19 10:54:21,990 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 11 states have internal predecessors, (70), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 83 [2022-07-19 10:54:21,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:21,992 INFO L225 Difference]: With dead ends: 657 [2022-07-19 10:54:21,992 INFO L226 Difference]: Without dead ends: 610 [2022-07-19 10:54:21,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2022-07-19 10:54:21,993 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 249 mSDsluCounter, 2094 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 2335 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:21,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 2335 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1474 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 10:54:21,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-07-19 10:54:22,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 493. [2022-07-19 10:54:22,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 385 states have (on average 1.2493506493506494) internal successors, (481), 394 states have internal predecessors, (481), 79 states have call successors, (79), 25 states have call predecessors, (79), 28 states have return successors, (105), 73 states have call predecessors, (105), 75 states have call successors, (105) [2022-07-19 10:54:22,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 665 transitions. [2022-07-19 10:54:22,041 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 665 transitions. Word has length 83 [2022-07-19 10:54:22,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:22,041 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 665 transitions. [2022-07-19 10:54:22,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 11 states have internal predecessors, (70), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 10:54:22,041 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 665 transitions. [2022-07-19 10:54:22,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 10:54:22,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:22,042 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:54:22,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-19 10:54:22,042 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:22,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:22,043 INFO L85 PathProgramCache]: Analyzing trace with hash 971177342, now seen corresponding path program 1 times [2022-07-19 10:54:22,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:22,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654562028] [2022-07-19 10:54:22,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:22,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:22,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 10:54:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:22,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:54:22,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:22,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:22,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:22,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 10:54:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:22,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 10:54:22,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:22,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:22,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:22,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654562028] [2022-07-19 10:54:22,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654562028] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:22,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:22,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-19 10:54:22,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117390174] [2022-07-19 10:54:22,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:22,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 10:54:22,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:22,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 10:54:22,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:54:22,183 INFO L87 Difference]: Start difference. First operand 493 states and 665 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:54:22,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:22,803 INFO L93 Difference]: Finished difference Result 957 states and 1298 transitions. [2022-07-19 10:54:22,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-19 10:54:22,803 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 84 [2022-07-19 10:54:22,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:22,807 INFO L225 Difference]: With dead ends: 957 [2022-07-19 10:54:22,807 INFO L226 Difference]: Without dead ends: 931 [2022-07-19 10:54:22,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2022-07-19 10:54:22,808 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 348 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:22,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 2112 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:54:22,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2022-07-19 10:54:22,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 585. [2022-07-19 10:54:22,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 461 states have (on average 1.2190889370932756) internal successors, (562), 473 states have internal predecessors, (562), 85 states have call successors, (85), 31 states have call predecessors, (85), 38 states have return successors, (115), 80 states have call predecessors, (115), 81 states have call successors, (115) [2022-07-19 10:54:22,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 762 transitions. [2022-07-19 10:54:22,845 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 762 transitions. Word has length 84 [2022-07-19 10:54:22,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:22,845 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 762 transitions. [2022-07-19 10:54:22,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:54:22,845 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 762 transitions. [2022-07-19 10:54:22,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-19 10:54:22,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:22,846 INFO L195 NwaCegarLoop]: 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] [2022-07-19 10:54:22,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-19 10:54:22,846 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:22,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:22,847 INFO L85 PathProgramCache]: Analyzing trace with hash -171325124, now seen corresponding path program 1 times [2022-07-19 10:54:22,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:22,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130974941] [2022-07-19 10:54:22,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:22,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:22,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-19 10:54:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:22,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:54:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:22,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:22,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:22,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:22,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 10:54:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:22,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 10:54:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:22,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:22,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130974941] [2022-07-19 10:54:22,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130974941] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:22,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:22,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-19 10:54:22,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977226136] [2022-07-19 10:54:22,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:22,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 10:54:22,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:22,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 10:54:22,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:54:22,995 INFO L87 Difference]: Start difference. First operand 585 states and 762 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:54:23,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:23,604 INFO L93 Difference]: Finished difference Result 952 states and 1287 transitions. [2022-07-19 10:54:23,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-19 10:54:23,604 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 84 [2022-07-19 10:54:23,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:23,607 INFO L225 Difference]: With dead ends: 952 [2022-07-19 10:54:23,607 INFO L226 Difference]: Without dead ends: 918 [2022-07-19 10:54:23,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2022-07-19 10:54:23,610 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 273 mSDsluCounter, 2854 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 3201 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:23,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 3201 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-19 10:54:23,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-07-19 10:54:23,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 468. [2022-07-19 10:54:23,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 366 states have (on average 1.2486338797814207) internal successors, (457), 375 states have internal predecessors, (457), 75 states have call successors, (75), 23 states have call predecessors, (75), 26 states have return successors, (100), 69 states have call predecessors, (100), 71 states have call successors, (100) [2022-07-19 10:54:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 632 transitions. [2022-07-19 10:54:23,643 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 632 transitions. Word has length 84 [2022-07-19 10:54:23,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:23,643 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 632 transitions. [2022-07-19 10:54:23,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-19 10:54:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 632 transitions. [2022-07-19 10:54:23,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-19 10:54:23,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:23,644 INFO L195 NwaCegarLoop]: 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-07-19 10:54:23,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-19 10:54:23,645 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:23,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:23,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1715684878, now seen corresponding path program 1 times [2022-07-19 10:54:23,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:23,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145119686] [2022-07-19 10:54:23,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:23,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:23,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 10:54:23,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:23,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:54:23,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:23,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:23,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:23,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 10:54:23,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:23,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 10:54:23,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:23,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 10:54:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:23,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:23,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:23,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145119686] [2022-07-19 10:54:23,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145119686] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:23,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:23,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-19 10:54:23,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591765759] [2022-07-19 10:54:23,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:23,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 10:54:23,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:23,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 10:54:23,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:54:23,803 INFO L87 Difference]: Start difference. First operand 468 states and 632 transitions. Second operand has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 10:54:24,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:24,632 INFO L93 Difference]: Finished difference Result 932 states and 1258 transitions. [2022-07-19 10:54:24,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-19 10:54:24,633 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 93 [2022-07-19 10:54:24,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:24,636 INFO L225 Difference]: With dead ends: 932 [2022-07-19 10:54:24,636 INFO L226 Difference]: Without dead ends: 885 [2022-07-19 10:54:24,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2022-07-19 10:54:24,637 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 531 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 2123 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:24,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 2123 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-19 10:54:24,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2022-07-19 10:54:24,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 858. [2022-07-19 10:54:24,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 666 states have (on average 1.2147147147147148) internal successors, (809), 684 states have internal predecessors, (809), 142 states have call successors, (142), 43 states have call predecessors, (142), 49 states have return successors, (185), 130 states have call predecessors, (185), 137 states have call successors, (185) [2022-07-19 10:54:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1136 transitions. [2022-07-19 10:54:24,710 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1136 transitions. Word has length 93 [2022-07-19 10:54:24,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:24,710 INFO L495 AbstractCegarLoop]: Abstraction has 858 states and 1136 transitions. [2022-07-19 10:54:24,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 10:54:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1136 transitions. [2022-07-19 10:54:24,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-19 10:54:24,712 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:24,712 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 10:54:24,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-19 10:54:24,712 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:24,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:24,713 INFO L85 PathProgramCache]: Analyzing trace with hash 327002288, now seen corresponding path program 1 times [2022-07-19 10:54:24,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:24,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345435876] [2022-07-19 10:54:24,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:24,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:24,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 10:54:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:24,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:54:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:24,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:24,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:24,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:24,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 10:54:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:24,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 10:54:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:24,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:24,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:24,807 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-19 10:54:24,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:24,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345435876] [2022-07-19 10:54:24,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345435876] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:24,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:24,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 10:54:24,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859418499] [2022-07-19 10:54:24,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:24,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:54:24,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:24,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:54:24,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:54:24,808 INFO L87 Difference]: Start difference. First operand 858 states and 1136 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-19 10:54:25,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:25,245 INFO L93 Difference]: Finished difference Result 1692 states and 2335 transitions. [2022-07-19 10:54:25,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:54:25,246 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 95 [2022-07-19 10:54:25,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:25,251 INFO L225 Difference]: With dead ends: 1692 [2022-07-19 10:54:25,251 INFO L226 Difference]: Without dead ends: 1142 [2022-07-19 10:54:25,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:54:25,255 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 158 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:25,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1354 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:54:25,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2022-07-19 10:54:25,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 834. [2022-07-19 10:54:25,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 650 states have (on average 1.1953846153846155) internal successors, (777), 664 states have internal predecessors, (777), 134 states have call successors, (134), 43 states have call predecessors, (134), 49 states have return successors, (173), 126 states have call predecessors, (173), 129 states have call successors, (173) [2022-07-19 10:54:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1084 transitions. [2022-07-19 10:54:25,328 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1084 transitions. Word has length 95 [2022-07-19 10:54:25,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:25,328 INFO L495 AbstractCegarLoop]: Abstraction has 834 states and 1084 transitions. [2022-07-19 10:54:25,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-19 10:54:25,329 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1084 transitions. [2022-07-19 10:54:25,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-19 10:54:25,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:25,330 INFO L195 NwaCegarLoop]: 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-07-19 10:54:25,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-19 10:54:25,331 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:25,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:25,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1808548852, now seen corresponding path program 1 times [2022-07-19 10:54:25,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:25,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890586282] [2022-07-19 10:54:25,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:25,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:25,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 10:54:25,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:25,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:54:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:25,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:25,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:25,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-19 10:54:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:25,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-19 10:54:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:25,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 10:54:25,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:54:25,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:25,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890586282] [2022-07-19 10:54:25,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890586282] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:25,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:25,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-19 10:54:25,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835027701] [2022-07-19 10:54:25,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:25,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-19 10:54:25,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:25,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-19 10:54:25,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-19 10:54:25,476 INFO L87 Difference]: Start difference. First operand 834 states and 1084 transitions. Second operand has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 10:54:26,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:26,277 INFO L93 Difference]: Finished difference Result 858 states and 1116 transitions. [2022-07-19 10:54:26,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-19 10:54:26,277 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 93 [2022-07-19 10:54:26,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:26,280 INFO L225 Difference]: With dead ends: 858 [2022-07-19 10:54:26,280 INFO L226 Difference]: Without dead ends: 809 [2022-07-19 10:54:26,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2022-07-19 10:54:26,281 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 363 mSDsluCounter, 2672 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 3028 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 2042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:26,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 3028 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 2042 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-19 10:54:26,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-19 10:54:26,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 306. [2022-07-19 10:54:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 242 states have (on average 1.1363636363636365) internal successors, (275), 247 states have internal predecessors, (275), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (48), 37 states have call predecessors, (48), 38 states have call successors, (48) [2022-07-19 10:54:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 364 transitions. [2022-07-19 10:54:26,329 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 364 transitions. Word has length 93 [2022-07-19 10:54:26,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:26,329 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 364 transitions. [2022-07-19 10:54:26,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-19 10:54:26,329 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 364 transitions. [2022-07-19 10:54:26,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-19 10:54:26,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:26,330 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 10:54:26,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-19 10:54:26,330 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:26,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:26,331 INFO L85 PathProgramCache]: Analyzing trace with hash 46403579, now seen corresponding path program 1 times [2022-07-19 10:54:26,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:26,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027806152] [2022-07-19 10:54:26,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:26,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:26,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 10:54:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:26,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:54:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:26,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:26,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:26,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 10:54:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:26,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 10:54:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:26,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:26,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:26,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 10:54:26,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:26,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 10:54:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:26,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:26,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-19 10:54:26,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:26,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027806152] [2022-07-19 10:54:26,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027806152] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 10:54:26,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189412706] [2022-07-19 10:54:26,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:26,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 10:54:26,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:54:26,467 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-07-19 10:54:26,468 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-07-19 10:54:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:26,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-19 10:54:26,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 10:54:26,725 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-19 10:54:26,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 10:54:26,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189412706] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:26,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 10:54:26,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-07-19 10:54:26,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098661973] [2022-07-19 10:54:26,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:26,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 10:54:26,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:26,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 10:54:26,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-07-19 10:54:26,727 INFO L87 Difference]: Start difference. First operand 306 states and 364 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 10:54:26,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:26,816 INFO L93 Difference]: Finished difference Result 513 states and 620 transitions. [2022-07-19 10:54:26,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 10:54:26,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 133 [2022-07-19 10:54:26,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:26,818 INFO L225 Difference]: With dead ends: 513 [2022-07-19 10:54:26,818 INFO L226 Difference]: Without dead ends: 327 [2022-07-19 10:54:26,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:54:26,819 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:26,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 715 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:54:26,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-07-19 10:54:26,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 322. [2022-07-19 10:54:26,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 256 states have (on average 1.12890625) internal successors, (289), 262 states have internal predecessors, (289), 41 states have call successors, (41), 21 states have call predecessors, (41), 24 states have return successors, (55), 38 states have call predecessors, (55), 38 states have call successors, (55) [2022-07-19 10:54:26,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 385 transitions. [2022-07-19 10:54:26,844 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 385 transitions. Word has length 133 [2022-07-19 10:54:26,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:26,845 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 385 transitions. [2022-07-19 10:54:26,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-19 10:54:26,845 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 385 transitions. [2022-07-19 10:54:26,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-19 10:54:26,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:26,846 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 10:54:26,866 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 10:54:27,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-07-19 10:54:27,061 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:27,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:27,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1067504510, now seen corresponding path program 1 times [2022-07-19 10:54:27,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:27,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973091891] [2022-07-19 10:54:27,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:27,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 10:54:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:54:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 10:54:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 10:54:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:27,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 10:54:27,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 10:54:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-19 10:54:27,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:27,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973091891] [2022-07-19 10:54:27,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973091891] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:27,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:27,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 10:54:27,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941225995] [2022-07-19 10:54:27,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:27,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:54:27,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:27,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:54:27,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:54:27,210 INFO L87 Difference]: Start difference. First operand 322 states and 385 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-19 10:54:27,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:27,593 INFO L93 Difference]: Finished difference Result 534 states and 639 transitions. [2022-07-19 10:54:27,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:54:27,594 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 134 [2022-07-19 10:54:27,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:27,595 INFO L225 Difference]: With dead ends: 534 [2022-07-19 10:54:27,595 INFO L226 Difference]: Without dead ends: 362 [2022-07-19 10:54:27,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:54:27,596 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 118 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:27,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1066 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:54:27,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-07-19 10:54:27,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 315. [2022-07-19 10:54:27,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 251 states have (on average 1.1155378486055776) internal successors, (280), 256 states have internal predecessors, (280), 39 states have call successors, (39), 21 states have call predecessors, (39), 24 states have return successors, (51), 37 states have call predecessors, (51), 36 states have call successors, (51) [2022-07-19 10:54:27,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 370 transitions. [2022-07-19 10:54:27,645 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 370 transitions. Word has length 134 [2022-07-19 10:54:27,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:27,646 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 370 transitions. [2022-07-19 10:54:27,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-19 10:54:27,646 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 370 transitions. [2022-07-19 10:54:27,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-19 10:54:27,647 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:27,648 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 10:54:27,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-07-19 10:54:27,648 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:27,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:27,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1031777441, now seen corresponding path program 1 times [2022-07-19 10:54:27,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:27,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530988990] [2022-07-19 10:54:27,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:27,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 10:54:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:54:27,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:27,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 10:54:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 10:54:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:27,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 10:54:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 10:54:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 10:54:27,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 10:54:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:27,756 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-19 10:54:27,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:27,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530988990] [2022-07-19 10:54:27,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530988990] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:27,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:27,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 10:54:27,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886635394] [2022-07-19 10:54:27,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:27,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:54:27,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:27,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:54:27,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:54:27,758 INFO L87 Difference]: Start difference. First operand 315 states and 370 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 10:54:28,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:28,092 INFO L93 Difference]: Finished difference Result 384 states and 451 transitions. [2022-07-19 10:54:28,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:54:28,093 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 170 [2022-07-19 10:54:28,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:28,096 INFO L225 Difference]: With dead ends: 384 [2022-07-19 10:54:28,096 INFO L226 Difference]: Without dead ends: 317 [2022-07-19 10:54:28,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:54:28,096 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 98 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:28,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 909 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-19 10:54:28,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-07-19 10:54:28,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 217. [2022-07-19 10:54:28,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 176 states have (on average 1.1136363636363635) internal successors, (196), 178 states have internal predecessors, (196), 24 states have call successors, (24), 14 states have call predecessors, (24), 16 states have return successors, (30), 24 states have call predecessors, (30), 22 states have call successors, (30) [2022-07-19 10:54:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 250 transitions. [2022-07-19 10:54:28,116 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 250 transitions. Word has length 170 [2022-07-19 10:54:28,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:28,116 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 250 transitions. [2022-07-19 10:54:28,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 10:54:28,116 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 250 transitions. [2022-07-19 10:54:28,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-19 10:54:28,118 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:54:28,118 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-19 10:54:28,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-07-19 10:54:28,118 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:54:28,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:54:28,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1337713774, now seen corresponding path program 1 times [2022-07-19 10:54:28,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:54:28,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353190039] [2022-07-19 10:54:28,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:54:28,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:54:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:28,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-19 10:54:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:28,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 10:54:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:28,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:28,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:28,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:28,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 10:54:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:28,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 10:54:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:28,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:28,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:28,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 10:54:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:28,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-19 10:54:28,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:28,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:28,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:28,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:28,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-19 10:54:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:28,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-19 10:54:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:28,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-19 10:54:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:28,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 10:54:28,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:54:28,251 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-19 10:54:28,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:54:28,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353190039] [2022-07-19 10:54:28,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353190039] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:54:28,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:54:28,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 10:54:28,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257377968] [2022-07-19 10:54:28,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:54:28,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 10:54:28,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:54:28,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 10:54:28,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-19 10:54:28,253 INFO L87 Difference]: Start difference. First operand 217 states and 250 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 10:54:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:54:28,547 INFO L93 Difference]: Finished difference Result 223 states and 259 transitions. [2022-07-19 10:54:28,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 10:54:28,547 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 173 [2022-07-19 10:54:28,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:54:28,548 INFO L225 Difference]: With dead ends: 223 [2022-07-19 10:54:28,548 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 10:54:28,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-07-19 10:54:28,548 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 72 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 10:54:28,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 713 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 10:54:28,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 10:54:28,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 10:54:28,549 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-07-19 10:54:28,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 10:54:28,549 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 173 [2022-07-19 10:54:28,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:54:28,549 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 10:54:28,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-19 10:54:28,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 10:54:28,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 10:54:28,551 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 10:54:28,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-07-19 10:54:28,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 10:54:54,201 WARN L233 SmtUtils]: Spent 10.97s on a formula simplification. DAG size of input: 122 DAG size of output: 120 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 10:55:05,948 WARN L233 SmtUtils]: Spent 5.85s on a formula simplification. DAG size of input: 121 DAG size of output: 119 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 10:55:11,789 WARN L233 SmtUtils]: Spent 5.84s on a formula simplification. DAG size of input: 121 DAG size of output: 119 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 10:55:21,098 WARN L233 SmtUtils]: Spent 5.83s on a formula simplification. DAG size of input: 121 DAG size of output: 119 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 10:56:44,371 WARN L233 SmtUtils]: Spent 1.31m on a formula simplification. DAG size of input: 119 DAG size of output: 115 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-19 10:58:03,242 WARN L233 SmtUtils]: Spent 1.31m on a formula simplification. DAG size of input: 119 DAG size of output: 115 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)