./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-71.i -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 --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 afdbc11a14d78cfc3e8e425320a4468be878b1004162e6354634b69484bbf0df --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:01:03,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:01:03,178 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:01:03,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:01:03,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:01:03,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:01:03,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:01:03,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:01:03,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:01:03,230 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:01:03,231 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:01:03,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:01:03,232 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:01:03,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:01:03,232 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:01:03,233 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:01:03,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:01:03,234 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:01:03,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:01:03,234 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:01:03,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:01:03,235 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:01:03,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:01:03,236 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:01:03,236 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:01:03,236 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:01:03,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:01:03,237 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:01:03,237 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:01:03,237 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:01:03,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:01:03,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:01:03,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:01:03,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:01:03,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:01:03,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:01:03,240 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:01:03,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:01:03,240 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:01:03,241 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:01:03,241 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:01:03,241 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:01:03,242 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 -> afdbc11a14d78cfc3e8e425320a4468be878b1004162e6354634b69484bbf0df [2024-10-13 06:01:03,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:01:03,562 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:01:03,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:01:03,567 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:01:03,568 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:01:03,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-71.i [2024-10-13 06:01:05,337 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:01:05,614 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:01:05,614 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-71.i [2024-10-13 06:01:05,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce86fc601/bd3e4166af5f4a57b330dc138967b4f7/FLAG9a7993105 [2024-10-13 06:01:05,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce86fc601/bd3e4166af5f4a57b330dc138967b4f7 [2024-10-13 06:01:05,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:01:05,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:01:05,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:01:05,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:01:05,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:01:05,995 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:01:05" (1/1) ... [2024-10-13 06:01:05,996 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20c15c8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:05, skipping insertion in model container [2024-10-13 06:01:05,996 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:01:05" (1/1) ... [2024-10-13 06:01:06,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:01:06,212 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-71.i[916,929] [2024-10-13 06:01:06,267 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:01:06,284 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:01:06,299 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-71.i[916,929] [2024-10-13 06:01:06,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:01:06,380 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:01:06,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:06 WrapperNode [2024-10-13 06:01:06,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:01:06,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:01:06,383 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:01:06,383 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:01:06,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:06" (1/1) ... [2024-10-13 06:01:06,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:06" (1/1) ... [2024-10-13 06:01:06,462 INFO L138 Inliner]: procedures = 26, calls = 173, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 495 [2024-10-13 06:01:06,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:01:06,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:01:06,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:01:06,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:01:06,480 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:06" (1/1) ... [2024-10-13 06:01:06,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:06" (1/1) ... [2024-10-13 06:01:06,492 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:06" (1/1) ... [2024-10-13 06:01:06,526 INFO L175 MemorySlicer]: Split 138 memory accesses to 6 slices as follows [2, 20, 16, 85, 7, 8]. 62 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 3, 3, 5, 1, 2]. The 18 writes are split as follows [0, 3, 3, 8, 1, 3]. [2024-10-13 06:01:06,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:06" (1/1) ... [2024-10-13 06:01:06,527 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:06" (1/1) ... [2024-10-13 06:01:06,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:06" (1/1) ... [2024-10-13 06:01:06,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:06" (1/1) ... [2024-10-13 06:01:06,579 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:06" (1/1) ... [2024-10-13 06:01:06,584 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:06" (1/1) ... [2024-10-13 06:01:06,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:01:06,605 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:01:06,605 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:01:06,606 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:01:06,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:06" (1/1) ... [2024-10-13 06:01:06,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:01:06,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:01:06,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 06:01:06,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 06:01:06,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:01:06,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:01:06,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:01:06,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 06:01:06,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 06:01:06,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-13 06:01:06,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-13 06:01:06,739 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:01:06,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:01:06,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 06:01:06,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 06:01:06,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-13 06:01:06,740 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-13 06:01:06,740 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:01:06,740 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:01:06,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:01:06,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:01:06,740 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 06:01:06,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 06:01:06,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-13 06:01:06,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-13 06:01:06,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:01:06,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:01:06,906 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:01:06,910 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:01:07,502 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-10-13 06:01:07,502 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:01:07,541 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:01:07,542 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:01:07,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:01:07 BoogieIcfgContainer [2024-10-13 06:01:07,543 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:01:07,545 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:01:07,545 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:01:07,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:01:07,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:01:05" (1/3) ... [2024-10-13 06:01:07,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271d88ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:01:07, skipping insertion in model container [2024-10-13 06:01:07,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:01:06" (2/3) ... [2024-10-13 06:01:07,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@271d88ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:01:07, skipping insertion in model container [2024-10-13 06:01:07,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:01:07" (3/3) ... [2024-10-13 06:01:07,553 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-71.i [2024-10-13 06:01:07,571 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:01:07,571 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:01:07,650 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:01:07,658 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57596ede, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:01:07,659 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:01:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:01:07,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 06:01:07,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:07,678 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:07,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:07,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:07,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2045531038, now seen corresponding path program 1 times [2024-10-13 06:01:07,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:07,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433414668] [2024-10-13 06:01:07,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:07,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:07,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:08,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:08,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:08,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433414668] [2024-10-13 06:01:08,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433414668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:08,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:08,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 06:01:08,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384613292] [2024-10-13 06:01:08,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:08,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 06:01:08,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:08,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 06:01:08,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:01:08,111 INFO L87 Difference]: Start difference. First operand has 98 states, 76 states have (on average 1.4210526315789473) internal successors, (108), 77 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:01:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:08,157 INFO L93 Difference]: Finished difference Result 193 states and 309 transitions. [2024-10-13 06:01:08,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 06:01:08,160 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 139 [2024-10-13 06:01:08,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:08,168 INFO L225 Difference]: With dead ends: 193 [2024-10-13 06:01:08,168 INFO L226 Difference]: Without dead ends: 96 [2024-10-13 06:01:08,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 06:01:08,176 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:08,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:01:08,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-13 06:01:08,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-13 06:01:08,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:01:08,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 139 transitions. [2024-10-13 06:01:08,343 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 139 transitions. Word has length 139 [2024-10-13 06:01:08,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:08,344 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 139 transitions. [2024-10-13 06:01:08,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:01:08,345 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 139 transitions. [2024-10-13 06:01:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 06:01:08,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:08,354 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:08,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:01:08,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:08,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:08,359 INFO L85 PathProgramCache]: Analyzing trace with hash -433866812, now seen corresponding path program 1 times [2024-10-13 06:01:08,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:08,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377079740] [2024-10-13 06:01:08,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:08,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:08,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:08,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:08,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,770 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:08,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:08,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377079740] [2024-10-13 06:01:08,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377079740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:08,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:08,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:01:08,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766969523] [2024-10-13 06:01:08,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:08,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:01:08,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:08,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:01:08,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:01:08,778 INFO L87 Difference]: Start difference. First operand 96 states and 139 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:01:08,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:08,840 INFO L93 Difference]: Finished difference Result 194 states and 281 transitions. [2024-10-13 06:01:08,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:01:08,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2024-10-13 06:01:08,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:08,844 INFO L225 Difference]: With dead ends: 194 [2024-10-13 06:01:08,844 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 06:01:08,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:01:08,848 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:08,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 389 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:01:08,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 06:01:08,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2024-10-13 06:01:08,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 77 states have internal predecessors, (103), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:01:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 141 transitions. [2024-10-13 06:01:08,864 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 141 transitions. Word has length 139 [2024-10-13 06:01:08,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:08,865 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 141 transitions. [2024-10-13 06:01:08,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:01:08,866 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 141 transitions. [2024-10-13 06:01:08,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 06:01:08,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:08,867 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:08,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:01:08,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:08,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:08,868 INFO L85 PathProgramCache]: Analyzing trace with hash -376608510, now seen corresponding path program 1 times [2024-10-13 06:01:08,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:08,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469577649] [2024-10-13 06:01:08,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:08,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:08,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:08,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:09,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:09,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:09,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:09,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,015 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:09,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:09,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469577649] [2024-10-13 06:01:09,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469577649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:09,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:09,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:01:09,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949222120] [2024-10-13 06:01:09,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:09,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:01:09,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:09,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:01:09,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:01:09,018 INFO L87 Difference]: Start difference. First operand 98 states and 141 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:01:09,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:09,071 INFO L93 Difference]: Finished difference Result 198 states and 285 transitions. [2024-10-13 06:01:09,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:01:09,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2024-10-13 06:01:09,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:09,073 INFO L225 Difference]: With dead ends: 198 [2024-10-13 06:01:09,073 INFO L226 Difference]: Without dead ends: 101 [2024-10-13 06:01:09,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:01:09,079 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 1 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:09,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 393 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:01:09,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-13 06:01:09,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2024-10-13 06:01:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 79 states have (on average 1.3291139240506329) internal successors, (105), 79 states have internal predecessors, (105), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:01:09,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2024-10-13 06:01:09,091 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 139 [2024-10-13 06:01:09,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:09,092 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2024-10-13 06:01:09,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:01:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2024-10-13 06:01:09,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-13 06:01:09,094 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:09,094 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:09,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:01:09,094 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:09,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:09,094 INFO L85 PathProgramCache]: Analyzing trace with hash -376548928, now seen corresponding path program 1 times [2024-10-13 06:01:09,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:09,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755119087] [2024-10-13 06:01:09,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:09,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:09,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:09,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:09,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:09,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:09,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:09,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:09,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:09,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:09,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755119087] [2024-10-13 06:01:09,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755119087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:09,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:09,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:01:09,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049177808] [2024-10-13 06:01:09,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:09,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:01:09,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:09,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:01:09,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:01:09,437 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:01:09,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:09,538 INFO L93 Difference]: Finished difference Result 256 states and 365 transitions. [2024-10-13 06:01:09,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:01:09,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2024-10-13 06:01:09,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:09,541 INFO L225 Difference]: With dead ends: 256 [2024-10-13 06:01:09,541 INFO L226 Difference]: Without dead ends: 157 [2024-10-13 06:01:09,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:01:09,546 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 83 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:09,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 678 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:01:09,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-10-13 06:01:09,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 102. [2024-10-13 06:01:09,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:01:09,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2024-10-13 06:01:09,557 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 139 [2024-10-13 06:01:09,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:09,557 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2024-10-13 06:01:09,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:01:09,558 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2024-10-13 06:01:09,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-13 06:01:09,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:09,559 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:09,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:01:09,560 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:09,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:09,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1259755813, now seen corresponding path program 1 times [2024-10-13 06:01:09,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:09,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635161634] [2024-10-13 06:01:09,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:09,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:10,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:10,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,084 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:10,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:10,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635161634] [2024-10-13 06:01:10,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635161634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:10,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:10,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:01:10,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695430208] [2024-10-13 06:01:10,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:10,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:01:10,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:10,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:01:10,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:01:10,088 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:01:10,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:10,186 INFO L93 Difference]: Finished difference Result 259 states and 368 transitions. [2024-10-13 06:01:10,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:01:10,187 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2024-10-13 06:01:10,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:10,188 INFO L225 Difference]: With dead ends: 259 [2024-10-13 06:01:10,188 INFO L226 Difference]: Without dead ends: 158 [2024-10-13 06:01:10,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:01:10,191 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 79 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:10,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 625 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:01:10,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-10-13 06:01:10,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 114. [2024-10-13 06:01:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-13 06:01:10,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2024-10-13 06:01:10,202 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 140 [2024-10-13 06:01:10,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:10,202 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2024-10-13 06:01:10,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:01:10,203 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2024-10-13 06:01:10,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-13 06:01:10,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:10,206 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:10,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:01:10,206 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:10,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:10,206 INFO L85 PathProgramCache]: Analyzing trace with hash 881140615, now seen corresponding path program 1 times [2024-10-13 06:01:10,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:10,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663973478] [2024-10-13 06:01:10,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:10,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:10,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:10,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:10,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:10,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:10,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:10,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:11,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:11,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663973478] [2024-10-13 06:01:11,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663973478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:11,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:11,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:01:11,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587935317] [2024-10-13 06:01:11,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:11,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:01:11,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:11,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:01:11,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:01:11,006 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:01:11,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:11,373 INFO L93 Difference]: Finished difference Result 307 states and 436 transitions. [2024-10-13 06:01:11,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:01:11,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 141 [2024-10-13 06:01:11,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:11,376 INFO L225 Difference]: With dead ends: 307 [2024-10-13 06:01:11,377 INFO L226 Difference]: Without dead ends: 194 [2024-10-13 06:01:11,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:01:11,378 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 95 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:11,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 974 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:01:11,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-13 06:01:11,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2024-10-13 06:01:11,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 156 states have (on average 1.3269230769230769) internal successors, (207), 157 states have internal predecessors, (207), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 06:01:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 271 transitions. [2024-10-13 06:01:11,402 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 271 transitions. Word has length 141 [2024-10-13 06:01:11,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:11,403 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 271 transitions. [2024-10-13 06:01:11,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.166666666666666) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:01:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 271 transitions. [2024-10-13 06:01:11,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-13 06:01:11,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:11,404 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:11,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:01:11,407 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:11,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:11,409 INFO L85 PathProgramCache]: Analyzing trace with hash 563668448, now seen corresponding path program 1 times [2024-10-13 06:01:11,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:11,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703644828] [2024-10-13 06:01:11,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:11,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:11,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:11,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:11,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:11,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703644828] [2024-10-13 06:01:11,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703644828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:11,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:11,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:01:11,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780896554] [2024-10-13 06:01:11,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:11,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:01:11,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:11,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:01:11,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:01:11,718 INFO L87 Difference]: Start difference. First operand 191 states and 271 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:01:11,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:11,821 INFO L93 Difference]: Finished difference Result 422 states and 590 transitions. [2024-10-13 06:01:11,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:01:11,822 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 141 [2024-10-13 06:01:11,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:11,824 INFO L225 Difference]: With dead ends: 422 [2024-10-13 06:01:11,824 INFO L226 Difference]: Without dead ends: 232 [2024-10-13 06:01:11,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:01:11,826 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 62 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:11,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 659 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:01:11,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-13 06:01:11,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2024-10-13 06:01:11,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 188 states have (on average 1.297872340425532) internal successors, (244), 190 states have internal predecessors, (244), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-13 06:01:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 316 transitions. [2024-10-13 06:01:11,843 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 316 transitions. Word has length 141 [2024-10-13 06:01:11,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:11,844 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 316 transitions. [2024-10-13 06:01:11,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:01:11,844 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 316 transitions. [2024-10-13 06:01:11,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 06:01:11,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:11,846 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:11,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:01:11,846 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:11,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:11,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1149418449, now seen corresponding path program 1 times [2024-10-13 06:01:11,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:11,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469411310] [2024-10-13 06:01:11,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:11,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:12,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:12,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:12,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:12,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:12,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:12,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:12,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:12,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:12,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:12,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:12,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:12,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:12,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:12,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:12,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:12,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:12,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:12,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:12,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:12,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:12,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:12,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:12,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:12,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:12,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:12,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:12,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469411310] [2024-10-13 06:01:12,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469411310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:12,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:12,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:01:12,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807287753] [2024-10-13 06:01:12,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:12,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:01:12,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:12,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:01:12,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:01:12,135 INFO L87 Difference]: Start difference. First operand 229 states and 316 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:01:12,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:12,269 INFO L93 Difference]: Finished difference Result 458 states and 627 transitions. [2024-10-13 06:01:12,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:01:12,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 142 [2024-10-13 06:01:12,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:12,271 INFO L225 Difference]: With dead ends: 458 [2024-10-13 06:01:12,271 INFO L226 Difference]: Without dead ends: 230 [2024-10-13 06:01:12,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:01:12,272 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 66 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:12,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 787 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:01:12,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2024-10-13 06:01:12,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 191. [2024-10-13 06:01:12,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 154 states have (on average 1.2792207792207793) internal successors, (197), 155 states have internal predecessors, (197), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 06:01:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 261 transitions. [2024-10-13 06:01:12,306 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 261 transitions. Word has length 142 [2024-10-13 06:01:12,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:12,307 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 261 transitions. [2024-10-13 06:01:12,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:01:12,307 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 261 transitions. [2024-10-13 06:01:12,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 06:01:12,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:12,308 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:12,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:01:12,308 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:12,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:12,310 INFO L85 PathProgramCache]: Analyzing trace with hash -85271137, now seen corresponding path program 1 times [2024-10-13 06:01:12,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:12,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689597633] [2024-10-13 06:01:12,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:12,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:13,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:13,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:13,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:13,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:13,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:13,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:13,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:13,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:13,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:13,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:13,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:13,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:13,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:13,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:13,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:13,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:13,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:13,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:13,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:13,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:13,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:13,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:13,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:13,345 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:13,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:13,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689597633] [2024-10-13 06:01:13,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689597633] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:13,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:13,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:01:13,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27468277] [2024-10-13 06:01:13,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:13,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:01:13,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:13,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:01:13,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:01:13,348 INFO L87 Difference]: Start difference. First operand 191 states and 261 transitions. Second operand has 11 states, 8 states have (on average 6.25) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-13 06:01:14,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:14,124 INFO L93 Difference]: Finished difference Result 457 states and 622 transitions. [2024-10-13 06:01:14,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:01:14,125 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 6.25) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 142 [2024-10-13 06:01:14,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:14,131 INFO L225 Difference]: With dead ends: 457 [2024-10-13 06:01:14,132 INFO L226 Difference]: Without dead ends: 267 [2024-10-13 06:01:14,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:01:14,134 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 215 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:14,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 695 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:01:14,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-13 06:01:14,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 204. [2024-10-13 06:01:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 167 states have (on average 1.2874251497005988) internal successors, (215), 168 states have internal predecessors, (215), 32 states have call successors, (32), 4 states have call predecessors, (32), 4 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-13 06:01:14,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 279 transitions. [2024-10-13 06:01:14,168 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 279 transitions. Word has length 142 [2024-10-13 06:01:14,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:14,179 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 279 transitions. [2024-10-13 06:01:14,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 6.25) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-13 06:01:14,182 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 279 transitions. [2024-10-13 06:01:14,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 06:01:14,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:14,184 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:14,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:01:14,185 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:14,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:14,185 INFO L85 PathProgramCache]: Analyzing trace with hash 925846113, now seen corresponding path program 1 times [2024-10-13 06:01:14,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:14,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52960571] [2024-10-13 06:01:14,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:14,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:14,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:14,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:14,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:14,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:14,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:14,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:14,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:14,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:14,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:14,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:14,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:14,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:14,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:14,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:14,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:14,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:14,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:14,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:14,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:14,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:14,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:14,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:14,884 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:14,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:14,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52960571] [2024-10-13 06:01:14,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52960571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:14,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:14,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:01:14,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662012948] [2024-10-13 06:01:14,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:14,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:01:14,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:14,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:01:14,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:01:14,886 INFO L87 Difference]: Start difference. First operand 204 states and 279 transitions. Second operand has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:01:15,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:15,268 INFO L93 Difference]: Finished difference Result 478 states and 648 transitions. [2024-10-13 06:01:15,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:01:15,269 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 142 [2024-10-13 06:01:15,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:15,271 INFO L225 Difference]: With dead ends: 478 [2024-10-13 06:01:15,271 INFO L226 Difference]: Without dead ends: 275 [2024-10-13 06:01:15,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:01:15,272 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 86 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:15,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1176 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:01:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-13 06:01:15,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2024-10-13 06:01:15,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 217 states have (on average 1.2580645161290323) internal successors, (273), 219 states have internal predecessors, (273), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-13 06:01:15,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 367 transitions. [2024-10-13 06:01:15,303 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 367 transitions. Word has length 142 [2024-10-13 06:01:15,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:15,304 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 367 transitions. [2024-10-13 06:01:15,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.25) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:01:15,304 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 367 transitions. [2024-10-13 06:01:15,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 06:01:15,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:15,307 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:15,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:01:15,308 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:15,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:15,308 INFO L85 PathProgramCache]: Analyzing trace with hash -219284643, now seen corresponding path program 1 times [2024-10-13 06:01:15,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:15,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517288266] [2024-10-13 06:01:15,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:15,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:15,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:15,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:15,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:15,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:15,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:15,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:15,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:15,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:15,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:15,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:15,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:15,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:15,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:15,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:15,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:15,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:15,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:15,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:15,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:15,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:15,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:15,717 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:15,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:15,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517288266] [2024-10-13 06:01:15,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517288266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:15,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:15,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:01:15,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251719527] [2024-10-13 06:01:15,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:15,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:01:15,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:15,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:01:15,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:01:15,719 INFO L87 Difference]: Start difference. First operand 272 states and 367 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:01:16,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:16,012 INFO L93 Difference]: Finished difference Result 629 states and 851 transitions. [2024-10-13 06:01:16,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:01:16,013 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 142 [2024-10-13 06:01:16,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:16,016 INFO L225 Difference]: With dead ends: 629 [2024-10-13 06:01:16,016 INFO L226 Difference]: Without dead ends: 358 [2024-10-13 06:01:16,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:01:16,017 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 114 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:16,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1044 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:01:16,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-10-13 06:01:16,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 276. [2024-10-13 06:01:16,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 221 states have (on average 1.253393665158371) internal successors, (277), 223 states have internal predecessors, (277), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-13 06:01:16,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 371 transitions. [2024-10-13 06:01:16,050 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 371 transitions. Word has length 142 [2024-10-13 06:01:16,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:16,050 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 371 transitions. [2024-10-13 06:01:16,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:01:16,051 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 371 transitions. [2024-10-13 06:01:16,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-13 06:01:16,052 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:16,052 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:16,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 06:01:16,052 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:16,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:16,053 INFO L85 PathProgramCache]: Analyzing trace with hash 791832607, now seen corresponding path program 1 times [2024-10-13 06:01:16,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:16,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258687759] [2024-10-13 06:01:16,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:16,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:16,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:17,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:17,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:17,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:17,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:17,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:17,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:17,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:17,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:17,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:17,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:17,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:17,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:17,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:17,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:17,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:17,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:17,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:17,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:17,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:17,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:17,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:17,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:17,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:17,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:17,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:17,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:17,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258687759] [2024-10-13 06:01:17,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258687759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:17,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:17,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:01:17,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56952173] [2024-10-13 06:01:17,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:17,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:01:17,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:17,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:01:17,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:01:17,395 INFO L87 Difference]: Start difference. First operand 276 states and 371 transitions. Second operand has 10 states, 8 states have (on average 6.25) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-13 06:01:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:18,342 INFO L93 Difference]: Finished difference Result 609 states and 818 transitions. [2024-10-13 06:01:18,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:01:18,343 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.25) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 142 [2024-10-13 06:01:18,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:18,346 INFO L225 Difference]: With dead ends: 609 [2024-10-13 06:01:18,346 INFO L226 Difference]: Without dead ends: 334 [2024-10-13 06:01:18,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:01:18,349 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 107 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:18,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1251 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 06:01:18,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-10-13 06:01:18,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 271. [2024-10-13 06:01:18,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 216 states have (on average 1.2546296296296295) internal successors, (271), 218 states have internal predecessors, (271), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-13 06:01:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 365 transitions. [2024-10-13 06:01:18,397 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 365 transitions. Word has length 142 [2024-10-13 06:01:18,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:18,398 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 365 transitions. [2024-10-13 06:01:18,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.25) internal successors, (50), 10 states have internal predecessors, (50), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-13 06:01:18,399 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 365 transitions. [2024-10-13 06:01:18,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-13 06:01:18,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:18,400 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:18,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 06:01:18,401 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:18,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:18,401 INFO L85 PathProgramCache]: Analyzing trace with hash -310840564, now seen corresponding path program 1 times [2024-10-13 06:01:18,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:18,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994328231] [2024-10-13 06:01:18,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:18,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:19,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:19,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:19,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:19,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:19,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:19,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:19,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:19,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:19,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:19,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:19,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:19,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:19,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:19,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:19,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:19,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:19,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:19,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:19,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:19,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:19,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:19,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994328231] [2024-10-13 06:01:19,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994328231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:19,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:19,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:01:19,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136559684] [2024-10-13 06:01:19,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:19,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:01:19,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:19,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:01:19,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:01:19,719 INFO L87 Difference]: Start difference. First operand 271 states and 365 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:01:20,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:20,342 INFO L93 Difference]: Finished difference Result 681 states and 915 transitions. [2024-10-13 06:01:20,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:01:20,343 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 143 [2024-10-13 06:01:20,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:20,346 INFO L225 Difference]: With dead ends: 681 [2024-10-13 06:01:20,346 INFO L226 Difference]: Without dead ends: 411 [2024-10-13 06:01:20,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:01:20,349 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 95 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:20,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1241 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:01:20,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-10-13 06:01:20,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 289. [2024-10-13 06:01:20,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 234 states have (on average 1.264957264957265) internal successors, (296), 236 states have internal predecessors, (296), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-13 06:01:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 390 transitions. [2024-10-13 06:01:20,389 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 390 transitions. Word has length 143 [2024-10-13 06:01:20,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:20,389 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 390 transitions. [2024-10-13 06:01:20,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:01:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 390 transitions. [2024-10-13 06:01:20,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-13 06:01:20,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:20,393 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:20,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 06:01:20,393 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:20,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:20,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2035147467, now seen corresponding path program 1 times [2024-10-13 06:01:20,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:20,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739322902] [2024-10-13 06:01:20,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:20,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:20,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:20,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:20,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:20,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:20,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:20,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:20,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:20,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:20,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:20,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:20,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:20,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:20,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:20,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:20,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:20,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:20,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:20,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:20,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:20,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:20,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:20,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:20,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:20,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739322902] [2024-10-13 06:01:20,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739322902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:20,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:20,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:01:20,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182147264] [2024-10-13 06:01:20,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:20,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:01:20,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:20,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:01:20,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:01:20,644 INFO L87 Difference]: Start difference. First operand 289 states and 390 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:01:20,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:20,749 INFO L93 Difference]: Finished difference Result 607 states and 817 transitions. [2024-10-13 06:01:20,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:01:20,750 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 143 [2024-10-13 06:01:20,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:20,754 INFO L225 Difference]: With dead ends: 607 [2024-10-13 06:01:20,755 INFO L226 Difference]: Without dead ends: 319 [2024-10-13 06:01:20,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:01:20,756 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 59 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:20,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 560 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:01:20,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-13 06:01:20,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 295. [2024-10-13 06:01:20,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 240 states have (on average 1.2625) internal successors, (303), 242 states have internal predecessors, (303), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-13 06:01:20,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 397 transitions. [2024-10-13 06:01:20,817 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 397 transitions. Word has length 143 [2024-10-13 06:01:20,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:20,817 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 397 transitions. [2024-10-13 06:01:20,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:01:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 397 transitions. [2024-10-13 06:01:20,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-13 06:01:20,820 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:20,820 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:20,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 06:01:20,820 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:20,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:20,821 INFO L85 PathProgramCache]: Analyzing trace with hash 26861387, now seen corresponding path program 1 times [2024-10-13 06:01:20,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:20,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889714211] [2024-10-13 06:01:20,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:20,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:21,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:21,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:21,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889714211] [2024-10-13 06:01:21,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889714211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:21,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:21,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:01:21,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35437777] [2024-10-13 06:01:21,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:21,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:01:21,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:21,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:01:21,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:01:21,058 INFO L87 Difference]: Start difference. First operand 295 states and 397 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:01:21,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:21,153 INFO L93 Difference]: Finished difference Result 613 states and 823 transitions. [2024-10-13 06:01:21,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:01:21,154 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 143 [2024-10-13 06:01:21,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:21,157 INFO L225 Difference]: With dead ends: 613 [2024-10-13 06:01:21,157 INFO L226 Difference]: Without dead ends: 319 [2024-10-13 06:01:21,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:01:21,159 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 63 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:21,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 555 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:01:21,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-13 06:01:21,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 295. [2024-10-13 06:01:21,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 240 states have (on average 1.2583333333333333) internal successors, (302), 242 states have internal predecessors, (302), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-13 06:01:21,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 396 transitions. [2024-10-13 06:01:21,195 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 396 transitions. Word has length 143 [2024-10-13 06:01:21,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:21,195 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 396 transitions. [2024-10-13 06:01:21,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:01:21,195 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 396 transitions. [2024-10-13 06:01:21,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-13 06:01:21,196 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:21,197 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:21,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 06:01:21,197 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:21,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:21,199 INFO L85 PathProgramCache]: Analyzing trace with hash -994206967, now seen corresponding path program 1 times [2024-10-13 06:01:21,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:21,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632158692] [2024-10-13 06:01:21,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:21,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:21,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:21,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:21,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632158692] [2024-10-13 06:01:21,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632158692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:21,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:21,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:01:21,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657379333] [2024-10-13 06:01:21,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:21,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:01:21,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:21,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:01:21,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:01:21,436 INFO L87 Difference]: Start difference. First operand 295 states and 396 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:01:21,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:21,555 INFO L93 Difference]: Finished difference Result 615 states and 822 transitions. [2024-10-13 06:01:21,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:01:21,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 143 [2024-10-13 06:01:21,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:21,558 INFO L225 Difference]: With dead ends: 615 [2024-10-13 06:01:21,558 INFO L226 Difference]: Without dead ends: 321 [2024-10-13 06:01:21,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:01:21,561 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 44 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:21,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 603 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 06:01:21,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-10-13 06:01:21,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2024-10-13 06:01:21,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 260 states have (on average 1.2538461538461538) internal successors, (326), 263 states have internal predecessors, (326), 49 states have call successors, (49), 8 states have call predecessors, (49), 8 states have return successors, (49), 46 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-13 06:01:21,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 424 transitions. [2024-10-13 06:01:21,602 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 424 transitions. Word has length 143 [2024-10-13 06:01:21,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:21,603 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 424 transitions. [2024-10-13 06:01:21,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:01:21,603 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 424 transitions. [2024-10-13 06:01:21,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 06:01:21,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:21,604 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:21,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 06:01:21,605 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:21,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:21,605 INFO L85 PathProgramCache]: Analyzing trace with hash -2022836849, now seen corresponding path program 1 times [2024-10-13 06:01:21,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:21,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249402813] [2024-10-13 06:01:21,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:21,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:22,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:22,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:22,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:22,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:22,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:22,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:22,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:22,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:22,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:22,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:22,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:22,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:22,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:22,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:22,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:22,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:22,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:22,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:22,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:22,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:22,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:22,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:22,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:22,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:22,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:22,990 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:22,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:22,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249402813] [2024-10-13 06:01:22,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249402813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:22,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:22,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:01:22,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749255412] [2024-10-13 06:01:22,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:22,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:01:22,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:22,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:01:22,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:01:22,993 INFO L87 Difference]: Start difference. First operand 318 states and 424 transitions. Second operand has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-13 06:01:24,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:24,370 INFO L93 Difference]: Finished difference Result 886 states and 1184 transitions. [2024-10-13 06:01:24,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:01:24,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 144 [2024-10-13 06:01:24,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:24,374 INFO L225 Difference]: With dead ends: 886 [2024-10-13 06:01:24,374 INFO L226 Difference]: Without dead ends: 569 [2024-10-13 06:01:24,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:01:24,376 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 96 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1012 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:24,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1012 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 06:01:24,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-10-13 06:01:24,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 566. [2024-10-13 06:01:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 456 states have (on average 1.2456140350877194) internal successors, (568), 462 states have internal predecessors, (568), 94 states have call successors, (94), 15 states have call predecessors, (94), 15 states have return successors, (94), 88 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-13 06:01:24,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 756 transitions. [2024-10-13 06:01:24,466 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 756 transitions. Word has length 144 [2024-10-13 06:01:24,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:24,466 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 756 transitions. [2024-10-13 06:01:24,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.428571428571429) internal successors, (52), 9 states have internal predecessors, (52), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-13 06:01:24,467 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 756 transitions. [2024-10-13 06:01:24,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:01:24,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:24,469 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:24,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 06:01:24,470 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:24,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:24,470 INFO L85 PathProgramCache]: Analyzing trace with hash -479832057, now seen corresponding path program 1 times [2024-10-13 06:01:24,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:24,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200926340] [2024-10-13 06:01:24,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:24,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:26,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:26,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:26,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:26,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:26,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:26,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:26,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:26,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:26,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:26,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:26,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:26,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:26,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:26,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:26,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:26,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:26,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:26,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:26,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:26,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:26,529 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:26,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:26,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200926340] [2024-10-13 06:01:26,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200926340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:26,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:26,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 06:01:26,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63756083] [2024-10-13 06:01:26,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:26,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:01:26,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:26,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:01:26,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:01:26,532 INFO L87 Difference]: Start difference. First operand 566 states and 756 transitions. Second operand has 12 states, 9 states have (on average 5.888888888888889) internal successors, (53), 12 states have internal predecessors, (53), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-13 06:01:28,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:28,106 INFO L93 Difference]: Finished difference Result 1295 states and 1730 transitions. [2024-10-13 06:01:28,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 06:01:28,107 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 5.888888888888889) internal successors, (53), 12 states have internal predecessors, (53), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 145 [2024-10-13 06:01:28,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:28,112 INFO L225 Difference]: With dead ends: 1295 [2024-10-13 06:01:28,112 INFO L226 Difference]: Without dead ends: 730 [2024-10-13 06:01:28,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:01:28,116 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 90 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:28,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 863 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 06:01:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-10-13 06:01:28,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 591. [2024-10-13 06:01:28,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 481 states have (on average 1.2536382536382535) internal successors, (603), 487 states have internal predecessors, (603), 94 states have call successors, (94), 15 states have call predecessors, (94), 15 states have return successors, (94), 88 states have call predecessors, (94), 94 states have call successors, (94) [2024-10-13 06:01:28,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 791 transitions. [2024-10-13 06:01:28,185 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 791 transitions. Word has length 145 [2024-10-13 06:01:28,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:28,185 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 791 transitions. [2024-10-13 06:01:28,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 5.888888888888889) internal successors, (53), 12 states have internal predecessors, (53), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-13 06:01:28,186 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 791 transitions. [2024-10-13 06:01:28,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:01:28,188 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:28,188 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:28,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 06:01:28,189 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:28,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:28,189 INFO L85 PathProgramCache]: Analyzing trace with hash -2068179959, now seen corresponding path program 1 times [2024-10-13 06:01:28,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:28,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661053639] [2024-10-13 06:01:28,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:28,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:28,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:28,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:28,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:28,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:28,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:28,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:28,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:28,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:28,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:28,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:28,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:28,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:28,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:28,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:28,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:28,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:28,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:28,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:28,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:28,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:28,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:28,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:28,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:28,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661053639] [2024-10-13 06:01:28,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661053639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:28,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:28,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:01:28,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728631393] [2024-10-13 06:01:28,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:28,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:01:28,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:28,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:01:28,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:01:28,625 INFO L87 Difference]: Start difference. First operand 591 states and 791 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:01:29,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:29,075 INFO L93 Difference]: Finished difference Result 1457 states and 1948 transitions. [2024-10-13 06:01:29,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:01:29,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 145 [2024-10-13 06:01:29,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:29,081 INFO L225 Difference]: With dead ends: 1457 [2024-10-13 06:01:29,081 INFO L226 Difference]: Without dead ends: 867 [2024-10-13 06:01:29,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:01:29,084 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 81 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:29,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 435 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:01:29,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2024-10-13 06:01:29,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 863. [2024-10-13 06:01:29,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 863 states, 689 states have (on average 1.2351233671988389) internal successors, (851), 699 states have internal predecessors, (851), 150 states have call successors, (150), 23 states have call predecessors, (150), 23 states have return successors, (150), 140 states have call predecessors, (150), 150 states have call successors, (150) [2024-10-13 06:01:29,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1151 transitions. [2024-10-13 06:01:29,190 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1151 transitions. Word has length 145 [2024-10-13 06:01:29,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:29,190 INFO L471 AbstractCegarLoop]: Abstraction has 863 states and 1151 transitions. [2024-10-13 06:01:29,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:01:29,190 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1151 transitions. [2024-10-13 06:01:29,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:01:29,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:29,192 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:29,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 06:01:29,193 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:29,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:29,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1215670087, now seen corresponding path program 1 times [2024-10-13 06:01:29,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:29,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089973924] [2024-10-13 06:01:29,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:29,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:29,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:29,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:29,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:29,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:29,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:29,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:29,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:29,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:29,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:29,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:29,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:29,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:29,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:29,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:29,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:29,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:29,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:29,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:29,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:29,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:29,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:29,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:29,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:29,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:29,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:29,981 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:29,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:29,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089973924] [2024-10-13 06:01:29,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089973924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:29,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:29,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:01:29,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429795597] [2024-10-13 06:01:29,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:29,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:01:29,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:29,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:01:29,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:01:29,984 INFO L87 Difference]: Start difference. First operand 863 states and 1151 transitions. Second operand has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:01:31,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:31,019 INFO L93 Difference]: Finished difference Result 2282 states and 3042 transitions. [2024-10-13 06:01:31,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:01:31,020 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 145 [2024-10-13 06:01:31,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:31,028 INFO L225 Difference]: With dead ends: 2282 [2024-10-13 06:01:31,028 INFO L226 Difference]: Without dead ends: 1420 [2024-10-13 06:01:31,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:01:31,032 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 180 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:31,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1337 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:01:31,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2024-10-13 06:01:31,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 904. [2024-10-13 06:01:31,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 730 states have (on average 1.2438356164383562) internal successors, (908), 740 states have internal predecessors, (908), 150 states have call successors, (150), 23 states have call predecessors, (150), 23 states have return successors, (150), 140 states have call predecessors, (150), 150 states have call successors, (150) [2024-10-13 06:01:31,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1208 transitions. [2024-10-13 06:01:31,149 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1208 transitions. Word has length 145 [2024-10-13 06:01:31,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:31,150 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1208 transitions. [2024-10-13 06:01:31,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.3) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:01:31,150 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1208 transitions. [2024-10-13 06:01:31,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:01:31,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:31,153 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:31,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 06:01:31,153 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:31,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:31,153 INFO L85 PathProgramCache]: Analyzing trace with hash -657824557, now seen corresponding path program 1 times [2024-10-13 06:01:31,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:31,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425069818] [2024-10-13 06:01:31,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:31,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:31,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:31,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:31,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:31,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:31,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:31,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:31,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:31,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:31,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:31,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:31,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:31,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:31,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:31,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:31,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:31,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:31,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:31,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:31,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:31,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:31,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:31,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:31,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425069818] [2024-10-13 06:01:31,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425069818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:31,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:31,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:01:31,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118161056] [2024-10-13 06:01:31,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:31,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:01:31,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:31,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:01:31,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:01:31,522 INFO L87 Difference]: Start difference. First operand 904 states and 1208 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:01:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:32,013 INFO L93 Difference]: Finished difference Result 2071 states and 2762 transitions. [2024-10-13 06:01:32,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:01:32,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 145 [2024-10-13 06:01:32,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:32,020 INFO L225 Difference]: With dead ends: 2071 [2024-10-13 06:01:32,021 INFO L226 Difference]: Without dead ends: 1168 [2024-10-13 06:01:32,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:01:32,025 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 101 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:32,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 439 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:01:32,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2024-10-13 06:01:32,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 904. [2024-10-13 06:01:32,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 730 states have (on average 1.2424657534246575) internal successors, (907), 740 states have internal predecessors, (907), 150 states have call successors, (150), 23 states have call predecessors, (150), 23 states have return successors, (150), 140 states have call predecessors, (150), 150 states have call successors, (150) [2024-10-13 06:01:32,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1207 transitions. [2024-10-13 06:01:32,132 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1207 transitions. Word has length 145 [2024-10-13 06:01:32,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:32,132 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1207 transitions. [2024-10-13 06:01:32,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-13 06:01:32,132 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1207 transitions. [2024-10-13 06:01:32,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:01:32,134 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:32,134 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:32,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 06:01:32,135 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:32,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:32,136 INFO L85 PathProgramCache]: Analyzing trace with hash -798373167, now seen corresponding path program 1 times [2024-10-13 06:01:32,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:32,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295101996] [2024-10-13 06:01:32,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:32,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:36,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:36,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:36,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:36,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:36,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:36,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:36,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:36,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:36,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:36,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:36,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:36,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:36,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:36,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:36,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:36,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:36,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:36,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:36,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:36,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:36,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:36,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:36,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:36,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:36,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295101996] [2024-10-13 06:01:36,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295101996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:36,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:36,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-13 06:01:36,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188872018] [2024-10-13 06:01:36,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:36,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-13 06:01:36,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:36,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-13 06:01:36,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:01:36,949 INFO L87 Difference]: Start difference. First operand 904 states and 1207 transitions. Second operand has 15 states, 12 states have (on average 4.416666666666667) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-13 06:01:39,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:39,077 INFO L93 Difference]: Finished difference Result 2057 states and 2742 transitions. [2024-10-13 06:01:39,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 06:01:39,079 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 4.416666666666667) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 145 [2024-10-13 06:01:39,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:39,083 INFO L225 Difference]: With dead ends: 2057 [2024-10-13 06:01:39,084 INFO L226 Difference]: Without dead ends: 1154 [2024-10-13 06:01:39,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-10-13 06:01:39,087 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 87 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 1246 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:39,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1546 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1246 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-13 06:01:39,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2024-10-13 06:01:39,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 890. [2024-10-13 06:01:39,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 716 states have (on average 1.2360335195530727) internal successors, (885), 726 states have internal predecessors, (885), 150 states have call successors, (150), 23 states have call predecessors, (150), 23 states have return successors, (150), 140 states have call predecessors, (150), 150 states have call successors, (150) [2024-10-13 06:01:39,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1185 transitions. [2024-10-13 06:01:39,170 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1185 transitions. Word has length 145 [2024-10-13 06:01:39,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:39,170 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1185 transitions. [2024-10-13 06:01:39,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 4.416666666666667) internal successors, (53), 15 states have internal predecessors, (53), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-13 06:01:39,171 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1185 transitions. [2024-10-13 06:01:39,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:01:39,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:39,172 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:39,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 06:01:39,172 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:39,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:39,173 INFO L85 PathProgramCache]: Analyzing trace with hash -989305147, now seen corresponding path program 1 times [2024-10-13 06:01:39,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:39,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706988545] [2024-10-13 06:01:39,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:39,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:39,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:39,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:39,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:39,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:39,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:39,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:39,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:39,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:39,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:39,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:39,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:39,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:39,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:39,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:39,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:39,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:39,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:39,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:39,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:39,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:39,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:39,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:39,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:39,968 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:39,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:39,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706988545] [2024-10-13 06:01:39,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706988545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:39,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:39,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 06:01:39,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826143584] [2024-10-13 06:01:39,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:39,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:01:39,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:39,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:01:39,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:01:39,973 INFO L87 Difference]: Start difference. First operand 890 states and 1185 transitions. Second operand has 12 states, 10 states have (on average 5.3) internal successors, (53), 12 states have internal predecessors, (53), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-13 06:01:40,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:40,880 INFO L93 Difference]: Finished difference Result 2599 states and 3443 transitions. [2024-10-13 06:01:40,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:01:40,881 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 5.3) internal successors, (53), 12 states have internal predecessors, (53), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 145 [2024-10-13 06:01:40,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:40,894 INFO L225 Difference]: With dead ends: 2599 [2024-10-13 06:01:40,894 INFO L226 Difference]: Without dead ends: 1710 [2024-10-13 06:01:40,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2024-10-13 06:01:40,904 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 240 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:40,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 881 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:01:40,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2024-10-13 06:01:41,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 803. [2024-10-13 06:01:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 657 states have (on average 1.2450532724505328) internal successors, (818), 665 states have internal predecessors, (818), 124 states have call successors, (124), 21 states have call predecessors, (124), 21 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-13 06:01:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1066 transitions. [2024-10-13 06:01:41,067 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1066 transitions. Word has length 145 [2024-10-13 06:01:41,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:41,068 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1066 transitions. [2024-10-13 06:01:41,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 5.3) internal successors, (53), 12 states have internal predecessors, (53), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-13 06:01:41,068 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1066 transitions. [2024-10-13 06:01:41,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:01:41,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:41,073 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:41,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 06:01:41,074 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:41,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:41,074 INFO L85 PathProgramCache]: Analyzing trace with hash 706196997, now seen corresponding path program 1 times [2024-10-13 06:01:41,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:41,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782049515] [2024-10-13 06:01:41,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:41,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:41,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:41,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:41,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:41,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:41,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:41,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:41,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:41,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:41,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:41,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:41,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:41,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:41,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:41,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:41,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:41,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:41,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:41,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:41,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:41,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:41,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:41,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:41,545 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:41,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:41,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782049515] [2024-10-13 06:01:41,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782049515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:41,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:41,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-13 06:01:41,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140106877] [2024-10-13 06:01:41,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:41,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-13 06:01:41,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:41,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-13 06:01:41,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:01:41,547 INFO L87 Difference]: Start difference. First operand 803 states and 1066 transitions. Second operand has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:01:42,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:01:42,515 INFO L93 Difference]: Finished difference Result 1861 states and 2465 transitions. [2024-10-13 06:01:42,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 06:01:42,516 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 145 [2024-10-13 06:01:42,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:01:42,526 INFO L225 Difference]: With dead ends: 1861 [2024-10-13 06:01:42,526 INFO L226 Difference]: Without dead ends: 1059 [2024-10-13 06:01:42,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2024-10-13 06:01:42,530 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 194 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 06:01:42,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1506 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 06:01:42,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2024-10-13 06:01:42,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 799. [2024-10-13 06:01:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 653 states have (on average 1.2434915773353752) internal successors, (812), 661 states have internal predecessors, (812), 124 states have call successors, (124), 21 states have call predecessors, (124), 21 states have return successors, (124), 116 states have call predecessors, (124), 124 states have call successors, (124) [2024-10-13 06:01:42,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1060 transitions. [2024-10-13 06:01:42,686 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1060 transitions. Word has length 145 [2024-10-13 06:01:42,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:01:42,690 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1060 transitions. [2024-10-13 06:01:42,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 12 states have internal predecessors, (53), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-13 06:01:42,690 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1060 transitions. [2024-10-13 06:01:42,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-13 06:01:42,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:01:42,692 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 06:01:42,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 06:01:42,692 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:01:42,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:01:42,692 INFO L85 PathProgramCache]: Analyzing trace with hash -566603321, now seen corresponding path program 1 times [2024-10-13 06:01:42,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:01:42,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223688218] [2024-10-13 06:01:42,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:01:42,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:01:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:54,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:01:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:54,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:01:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:54,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:01:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:54,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:01:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:54,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:01:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:54,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:01:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:54,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:01:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:54,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:01:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:54,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:01:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:54,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:01:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:54,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:01:54,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:54,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:01:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:54,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:01:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:54,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:01:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:54,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 06:01:54,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:54,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-13 06:01:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:54,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 06:01:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:54,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 06:01:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:54,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 06:01:54,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:01:54,587 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-13 06:01:54,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:01:54,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223688218] [2024-10-13 06:01:54,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223688218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:01:54,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:01:54,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-13 06:01:54,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115533799] [2024-10-13 06:01:54,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:01:54,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 06:01:54,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:01:54,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 06:01:54,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=237, Unknown=2, NotChecked=0, Total=272 [2024-10-13 06:01:54,590 INFO L87 Difference]: Start difference. First operand 799 states and 1060 transitions. Second operand has 17 states, 13 states have (on average 4.076923076923077) internal successors, (53), 17 states have internal predecessors, (53), 5 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 5 states have call successors, (19) [2024-10-13 06:02:08,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:02:12,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:02:16,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:02:20,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-13 06:02:24,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []